./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-numeric/Binomial.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-numeric/Binomial.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c204b56aba09d3ce87e17edffdff1d33aa0b4dc87a1e1140339548dffa982588 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:45:33,678 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:45:33,735 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 01:45:33,739 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:45:33,741 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:45:33,754 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:45:33,755 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:45:33,755 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:45:33,755 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:45:33,755 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:45:33,755 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:45:33,756 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:45:33,756 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:45:33,756 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:45:33,756 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:45:33,756 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:45:33,756 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:45:33,756 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:45:33,756 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:45:33,757 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:45:33,757 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:45:33,757 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:45:33,757 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:45:33,757 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:45:33,758 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:45:33,758 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:45:33,758 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:45:33,758 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:45:33,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:45:33,759 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:45:33,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:45:33,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:45:33,759 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:45:33,759 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:45:33,759 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:45:33,759 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:45:33,759 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:45:33,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:45:33,760 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:45:33,760 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:45:33,760 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:45:33,760 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:45:33,760 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c204b56aba09d3ce87e17edffdff1d33aa0b4dc87a1e1140339548dffa982588 [2025-03-09 01:45:33,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:45:33,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:45:33,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:45:33,980 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:45:33,980 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:45:33,982 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/Binomial.c [2025-03-09 01:45:35,125 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89d71ce8d/79b72efd50ae4a92aae3147f526ff865/FLAG4e1823131 [2025-03-09 01:45:35,289 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:45:35,289 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Binomial.c [2025-03-09 01:45:35,311 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89d71ce8d/79b72efd50ae4a92aae3147f526ff865/FLAG4e1823131 [2025-03-09 01:45:35,326 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89d71ce8d/79b72efd50ae4a92aae3147f526ff865 [2025-03-09 01:45:35,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:45:35,329 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:45:35,332 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:45:35,332 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:45:35,335 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:45:35,335 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:45:35" (1/1) ... [2025-03-09 01:45:35,338 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44eeb90b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:35, skipping insertion in model container [2025-03-09 01:45:35,338 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:45:35" (1/1) ... [2025-03-09 01:45:35,350 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:45:35,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:45:35,467 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:45:35,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:45:35,487 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:45:35,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:35 WrapperNode [2025-03-09 01:45:35,488 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:45:35,489 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:45:35,489 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:45:35,489 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:45:35,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:35" (1/1) ... [2025-03-09 01:45:35,496 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:35" (1/1) ... [2025-03-09 01:45:35,507 INFO L138 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 41 [2025-03-09 01:45:35,507 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:45:35,508 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:45:35,508 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:45:35,508 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:45:35,514 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:35" (1/1) ... [2025-03-09 01:45:35,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:35" (1/1) ... [2025-03-09 01:45:35,519 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:35" (1/1) ... [2025-03-09 01:45:35,527 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-09 01:45:35,527 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:35" (1/1) ... [2025-03-09 01:45:35,528 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:35" (1/1) ... [2025-03-09 01:45:35,529 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:35" (1/1) ... [2025-03-09 01:45:35,531 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:35" (1/1) ... [2025-03-09 01:45:35,534 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:35" (1/1) ... [2025-03-09 01:45:35,534 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:35" (1/1) ... [2025-03-09 01:45:35,535 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:45:35,535 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:45:35,536 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:45:35,536 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:45:35,536 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:35" (1/1) ... [2025-03-09 01:45:35,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:45:35,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:45:35,562 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:45:35,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:45:35,581 INFO L130 BoogieDeclarations]: Found specification of procedure fact [2025-03-09 01:45:35,581 INFO L138 BoogieDeclarations]: Found implementation of procedure fact [2025-03-09 01:45:35,582 INFO L130 BoogieDeclarations]: Found specification of procedure binomialCoefficient [2025-03-09 01:45:35,582 INFO L138 BoogieDeclarations]: Found implementation of procedure binomialCoefficient [2025-03-09 01:45:35,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:45:35,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:45:35,618 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:45:35,619 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:45:35,736 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L30: havoc #t~ret1;havoc #t~ret2;havoc #t~ret3; [2025-03-09 01:45:35,819 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-03-09 01:45:35,819 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:45:35,829 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:45:35,830 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:45:35,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:45:35 BoogieIcfgContainer [2025-03-09 01:45:35,830 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:45:35,832 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:45:35,832 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:45:35,835 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:45:35,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:45:35" (1/3) ... [2025-03-09 01:45:35,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76b5deee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:45:35, skipping insertion in model container [2025-03-09 01:45:35,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:35" (2/3) ... [2025-03-09 01:45:35,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76b5deee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:45:35, skipping insertion in model container [2025-03-09 01:45:35,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:45:35" (3/3) ... [2025-03-09 01:45:35,838 INFO L128 eAbstractionObserver]: Analyzing ICFG Binomial.c [2025-03-09 01:45:35,848 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:45:35,850 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Binomial.c that has 3 procedures, 58 locations, 1 initial locations, 2 loop locations, and 14 error locations. [2025-03-09 01:45:35,882 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:45:35,890 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@42ef32c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:45:35,890 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-09 01:45:35,893 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 49 states have internal predecessors, (55), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 01:45:35,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 01:45:35,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:35,897 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:35,898 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:45:35,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:35,901 INFO L85 PathProgramCache]: Analyzing trace with hash 2110322170, now seen corresponding path program 1 times [2025-03-09 01:45:35,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:35,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210281357] [2025-03-09 01:45:35,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:35,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:35,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:45:35,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:45:35,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:35,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:36,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:45:36,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:36,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210281357] [2025-03-09 01:45:36,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210281357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:45:36,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:45:36,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:45:36,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103564411] [2025-03-09 01:45:36,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:45:36,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:45:36,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:36,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:45:36,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:45:36,036 INFO L87 Difference]: Start difference. First operand has 58 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 49 states have internal predecessors, (55), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:45:36,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:36,093 INFO L93 Difference]: Finished difference Result 114 states and 131 transitions. [2025-03-09 01:45:36,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:45:36,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-09 01:45:36,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:36,098 INFO L225 Difference]: With dead ends: 114 [2025-03-09 01:45:36,098 INFO L226 Difference]: Without dead ends: 56 [2025-03-09 01:45:36,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:45:36,102 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 23 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:36,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 154 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:45:36,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-09 01:45:36,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-09 01:45:36,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.5) internal successors, (51), 47 states have internal predecessors, (51), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 01:45:36,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2025-03-09 01:45:36,129 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 7 [2025-03-09 01:45:36,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:36,129 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2025-03-09 01:45:36,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:45:36,130 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2025-03-09 01:45:36,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 01:45:36,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:36,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:36,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:45:36,131 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting factErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:45:36,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:36,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1352081041, now seen corresponding path program 1 times [2025-03-09 01:45:36,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:36,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294580173] [2025-03-09 01:45:36,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:36,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:36,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:45:36,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:45:36,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:36,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:36,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:45:36,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:36,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294580173] [2025-03-09 01:45:36,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294580173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:45:36,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:45:36,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:45:36,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368238406] [2025-03-09 01:45:36,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:45:36,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:45:36,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:36,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:45:36,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:45:36,182 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:45:36,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:36,206 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2025-03-09 01:45:36,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:45:36,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-09 01:45:36,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:36,207 INFO L225 Difference]: With dead ends: 56 [2025-03-09 01:45:36,207 INFO L226 Difference]: Without dead ends: 55 [2025-03-09 01:45:36,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:45:36,209 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 4 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:36,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 103 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:45:36,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-09 01:45:36,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-09 01:45:36,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 46 states have internal predecessors, (50), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 01:45:36,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2025-03-09 01:45:36,218 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 13 [2025-03-09 01:45:36,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:36,218 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2025-03-09 01:45:36,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:45:36,218 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2025-03-09 01:45:36,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-09 01:45:36,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:36,221 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:36,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:45:36,221 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:45:36,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:36,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1035160666, now seen corresponding path program 1 times [2025-03-09 01:45:36,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:36,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768875851] [2025-03-09 01:45:36,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:36,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:36,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:45:36,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:45:36,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:36,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:36,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:45:36,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:36,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768875851] [2025-03-09 01:45:36,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768875851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:45:36,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:45:36,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:45:36,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221993791] [2025-03-09 01:45:36,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:45:36,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:45:36,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:36,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:45:36,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:45:36,331 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:45:36,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:36,437 INFO L93 Difference]: Finished difference Result 144 states and 166 transitions. [2025-03-09 01:45:36,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:45:36,437 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-09 01:45:36,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:36,438 INFO L225 Difference]: With dead ends: 144 [2025-03-09 01:45:36,438 INFO L226 Difference]: Without dead ends: 93 [2025-03-09 01:45:36,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:45:36,443 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 42 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:36,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 279 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:45:36,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-09 01:45:36,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2025-03-09 01:45:36,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.456140350877193) internal successors, (83), 69 states have internal predecessors, (83), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-09 01:45:36,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 105 transitions. [2025-03-09 01:45:36,451 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 105 transitions. Word has length 14 [2025-03-09 01:45:36,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:36,451 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 105 transitions. [2025-03-09 01:45:36,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:45:36,452 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 105 transitions. [2025-03-09 01:45:36,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-09 01:45:36,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:36,452 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:36,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:45:36,453 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:45:36,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:36,453 INFO L85 PathProgramCache]: Analyzing trace with hash 258011067, now seen corresponding path program 1 times [2025-03-09 01:45:36,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:36,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172338326] [2025-03-09 01:45:36,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:36,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:36,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:45:36,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:45:36,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:36,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:36,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:45:36,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:36,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172338326] [2025-03-09 01:45:36,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172338326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:45:36,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:45:36,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:45:36,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501270407] [2025-03-09 01:45:36,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:45:36,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:45:36,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:36,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:45:36,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:45:36,486 INFO L87 Difference]: Start difference. First operand 85 states and 105 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:45:36,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:36,539 INFO L93 Difference]: Finished difference Result 169 states and 208 transitions. [2025-03-09 01:45:36,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:45:36,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-09 01:45:36,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:36,540 INFO L225 Difference]: With dead ends: 169 [2025-03-09 01:45:36,540 INFO L226 Difference]: Without dead ends: 90 [2025-03-09 01:45:36,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:45:36,541 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 17 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:36,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 160 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:45:36,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-09 01:45:36,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2025-03-09 01:45:36,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 70 states have internal predecessors, (84), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-09 01:45:36,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 106 transitions. [2025-03-09 01:45:36,555 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 106 transitions. Word has length 14 [2025-03-09 01:45:36,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:36,555 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 106 transitions. [2025-03-09 01:45:36,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:45:36,555 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 106 transitions. [2025-03-09 01:45:36,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-09 01:45:36,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:36,555 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:36,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:45:36,556 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:45:36,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:36,556 INFO L85 PathProgramCache]: Analyzing trace with hash 800262069, now seen corresponding path program 1 times [2025-03-09 01:45:36,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:36,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769516656] [2025-03-09 01:45:36,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:36,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:36,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:45:36,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:45:36,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:36,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:36,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:45:36,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:36,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769516656] [2025-03-09 01:45:36,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769516656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:45:36,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:45:36,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:45:36,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737359899] [2025-03-09 01:45:36,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:45:36,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:45:36,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:36,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:45:36,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:45:36,644 INFO L87 Difference]: Start difference. First operand 86 states and 106 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 01:45:36,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:36,742 INFO L93 Difference]: Finished difference Result 214 states and 272 transitions. [2025-03-09 01:45:36,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:45:36,743 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-03-09 01:45:36,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:36,744 INFO L225 Difference]: With dead ends: 214 [2025-03-09 01:45:36,744 INFO L226 Difference]: Without dead ends: 135 [2025-03-09 01:45:36,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:45:36,745 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 36 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:36,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 301 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:45:36,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-09 01:45:36,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 123. [2025-03-09 01:45:36,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 98 states have internal predecessors, (123), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-09 01:45:36,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 161 transitions. [2025-03-09 01:45:36,759 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 161 transitions. Word has length 20 [2025-03-09 01:45:36,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:36,760 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 161 transitions. [2025-03-09 01:45:36,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 01:45:36,760 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 161 transitions. [2025-03-09 01:45:36,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 01:45:36,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:36,761 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:36,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:45:36,762 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting binomialCoefficientErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:45:36,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:36,762 INFO L85 PathProgramCache]: Analyzing trace with hash 242726150, now seen corresponding path program 1 times [2025-03-09 01:45:36,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:36,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918250707] [2025-03-09 01:45:36,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:36,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:36,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:45:36,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:45:36,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:36,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:36,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:45:36,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:36,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918250707] [2025-03-09 01:45:36,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918250707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:45:36,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:45:36,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:45:36,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352069185] [2025-03-09 01:45:36,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:45:36,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:45:36,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:36,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:45:36,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:45:36,823 INFO L87 Difference]: Start difference. First operand 123 states and 161 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 01:45:36,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:36,892 INFO L93 Difference]: Finished difference Result 148 states and 186 transitions. [2025-03-09 01:45:36,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:45:36,892 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-03-09 01:45:36,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:36,894 INFO L225 Difference]: With dead ends: 148 [2025-03-09 01:45:36,894 INFO L226 Difference]: Without dead ends: 147 [2025-03-09 01:45:36,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:45:36,895 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 44 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:36,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 251 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:45:36,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-09 01:45:36,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 138. [2025-03-09 01:45:36,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 95 states have (on average 1.431578947368421) internal successors, (136), 109 states have internal predecessors, (136), 22 states have call successors, (22), 8 states have call predecessors, (22), 8 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-09 01:45:36,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 180 transitions. [2025-03-09 01:45:36,910 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 180 transitions. Word has length 22 [2025-03-09 01:45:36,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:36,910 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 180 transitions. [2025-03-09 01:45:36,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 01:45:36,910 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 180 transitions. [2025-03-09 01:45:36,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-09 01:45:36,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:36,911 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:36,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:45:36,911 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting binomialCoefficientErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:45:36,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:36,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1065423947, now seen corresponding path program 1 times [2025-03-09 01:45:36,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:36,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700138181] [2025-03-09 01:45:36,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:36,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:36,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:45:36,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:45:36,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:36,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:36,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:45:36,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:36,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700138181] [2025-03-09 01:45:36,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700138181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:45:36,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:45:36,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:45:36,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484649173] [2025-03-09 01:45:36,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:45:36,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:45:36,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:36,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:45:36,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:45:36,967 INFO L87 Difference]: Start difference. First operand 138 states and 180 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 01:45:37,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:37,040 INFO L93 Difference]: Finished difference Result 148 states and 183 transitions. [2025-03-09 01:45:37,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:45:37,041 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-03-09 01:45:37,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:37,042 INFO L225 Difference]: With dead ends: 148 [2025-03-09 01:45:37,042 INFO L226 Difference]: Without dead ends: 147 [2025-03-09 01:45:37,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:45:37,042 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 43 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:37,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 251 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:45:37,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-09 01:45:37,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 138. [2025-03-09 01:45:37,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 109 states have internal predecessors, (135), 22 states have call successors, (22), 8 states have call predecessors, (22), 8 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-09 01:45:37,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 179 transitions. [2025-03-09 01:45:37,052 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 179 transitions. Word has length 23 [2025-03-09 01:45:37,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:37,052 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 179 transitions. [2025-03-09 01:45:37,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 01:45:37,052 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 179 transitions. [2025-03-09 01:45:37,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-09 01:45:37,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:37,053 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:37,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:45:37,053 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:45:37,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:37,053 INFO L85 PathProgramCache]: Analyzing trace with hash 405033200, now seen corresponding path program 1 times [2025-03-09 01:45:37,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:37,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113066600] [2025-03-09 01:45:37,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:37,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:37,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 01:45:37,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 01:45:37,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:37,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:37,163 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:45:37,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:37,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113066600] [2025-03-09 01:45:37,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113066600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:45:37,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:45:37,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:45:37,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383594649] [2025-03-09 01:45:37,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:45:37,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:45:37,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:37,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:45:37,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:45:37,164 INFO L87 Difference]: Start difference. First operand 138 states and 179 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 01:45:37,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:37,263 INFO L93 Difference]: Finished difference Result 273 states and 347 transitions. [2025-03-09 01:45:37,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:45:37,264 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-03-09 01:45:37,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:37,265 INFO L225 Difference]: With dead ends: 273 [2025-03-09 01:45:37,265 INFO L226 Difference]: Without dead ends: 151 [2025-03-09 01:45:37,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:45:37,266 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 46 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:37,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 335 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:45:37,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-09 01:45:37,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 142. [2025-03-09 01:45:37,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 98 states have (on average 1.4081632653061225) internal successors, (138), 112 states have internal predecessors, (138), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-09 01:45:37,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 182 transitions. [2025-03-09 01:45:37,276 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 182 transitions. Word has length 28 [2025-03-09 01:45:37,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:37,276 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 182 transitions. [2025-03-09 01:45:37,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 01:45:37,277 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 182 transitions. [2025-03-09 01:45:37,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 01:45:37,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:37,277 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:37,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:45:37,278 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting binomialCoefficientErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:45:37,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:37,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1615097025, now seen corresponding path program 1 times [2025-03-09 01:45:37,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:37,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39370040] [2025-03-09 01:45:37,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:37,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:37,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 01:45:37,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 01:45:37,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:37,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 01:45:37,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [931630257] [2025-03-09 01:45:37,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:37,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:37,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:45:37,293 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:45:37,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:45:37,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 01:45:37,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 01:45:37,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:37,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:37,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:45:37,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:45:37,372 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 01:45:37,373 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:45:37,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:37,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39370040] [2025-03-09 01:45:37,373 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 01:45:37,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931630257] [2025-03-09 01:45:37,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931630257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:45:37,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:45:37,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:45:37,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090778180] [2025-03-09 01:45:37,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:45:37,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:45:37,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:37,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:45:37,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:45:37,375 INFO L87 Difference]: Start difference. First operand 142 states and 182 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 01:45:37,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:37,423 INFO L93 Difference]: Finished difference Result 194 states and 279 transitions. [2025-03-09 01:45:37,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:45:37,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2025-03-09 01:45:37,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:37,425 INFO L225 Difference]: With dead ends: 194 [2025-03-09 01:45:37,425 INFO L226 Difference]: Without dead ends: 193 [2025-03-09 01:45:37,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:45:37,426 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 9 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:37,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 201 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:45:37,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-09 01:45:37,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 164. [2025-03-09 01:45:37,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 127 states have internal predecessors, (159), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (39), 27 states have call predecessors, (39), 25 states have call successors, (39) [2025-03-09 01:45:37,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 223 transitions. [2025-03-09 01:45:37,443 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 223 transitions. Word has length 30 [2025-03-09 01:45:37,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:37,444 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 223 transitions. [2025-03-09 01:45:37,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 01:45:37,445 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 223 transitions. [2025-03-09 01:45:37,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-09 01:45:37,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:37,445 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:37,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:45:37,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:37,646 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting binomialCoefficientErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:45:37,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:37,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1471599766, now seen corresponding path program 1 times [2025-03-09 01:45:37,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:37,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487519995] [2025-03-09 01:45:37,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:37,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:37,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 01:45:37,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 01:45:37,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:37,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 01:45:37,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1744444307] [2025-03-09 01:45:37,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:37,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:37,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:45:37,657 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:45:37,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:45:37,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 01:45:37,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 01:45:37,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:37,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:37,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:45:37,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:45:37,731 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:45:37,731 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:45:37,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:37,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487519995] [2025-03-09 01:45:37,731 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 01:45:37,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744444307] [2025-03-09 01:45:37,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744444307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:45:37,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:45:37,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:45:37,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960708750] [2025-03-09 01:45:37,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:45:37,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:45:37,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:37,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:45:37,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:45:37,733 INFO L87 Difference]: Start difference. First operand 164 states and 223 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 01:45:37,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:37,784 INFO L93 Difference]: Finished difference Result 194 states and 274 transitions. [2025-03-09 01:45:37,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:45:37,786 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2025-03-09 01:45:37,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:37,787 INFO L225 Difference]: With dead ends: 194 [2025-03-09 01:45:37,787 INFO L226 Difference]: Without dead ends: 193 [2025-03-09 01:45:37,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:45:37,788 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 8 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:37,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 250 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:45:37,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-09 01:45:37,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 168. [2025-03-09 01:45:37,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 120 states have (on average 1.35) internal successors, (162), 131 states have internal predecessors, (162), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (39), 27 states have call predecessors, (39), 25 states have call successors, (39) [2025-03-09 01:45:37,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 226 transitions. [2025-03-09 01:45:37,803 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 226 transitions. Word has length 31 [2025-03-09 01:45:37,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:37,804 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 226 transitions. [2025-03-09 01:45:37,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 01:45:37,804 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 226 transitions. [2025-03-09 01:45:37,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-09 01:45:37,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:37,805 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:37,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 01:45:38,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-09 01:45:38,006 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting binomialCoefficientErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:45:38,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:38,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1625047523, now seen corresponding path program 1 times [2025-03-09 01:45:38,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:38,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233167489] [2025-03-09 01:45:38,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:38,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:38,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 01:45:38,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 01:45:38,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:38,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 01:45:38,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1108179190] [2025-03-09 01:45:38,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:38,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:38,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:45:38,025 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:45:38,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:45:38,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 01:45:38,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 01:45:38,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:38,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:38,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:45:38,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:45:38,146 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 01:45:38,146 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:45:38,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:38,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233167489] [2025-03-09 01:45:38,146 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 01:45:38,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108179190] [2025-03-09 01:45:38,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108179190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:45:38,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:45:38,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:45:38,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352434474] [2025-03-09 01:45:38,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:45:38,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:45:38,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:38,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:45:38,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:45:38,147 INFO L87 Difference]: Start difference. First operand 168 states and 226 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:45:38,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:38,243 INFO L93 Difference]: Finished difference Result 248 states and 353 transitions. [2025-03-09 01:45:38,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:45:38,244 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2025-03-09 01:45:38,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:38,245 INFO L225 Difference]: With dead ends: 248 [2025-03-09 01:45:38,245 INFO L226 Difference]: Without dead ends: 247 [2025-03-09 01:45:38,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:45:38,246 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 26 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:38,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 255 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:45:38,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-09 01:45:38,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 199. [2025-03-09 01:45:38,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 145 states have (on average 1.3103448275862069) internal successors, (190), 153 states have internal predecessors, (190), 31 states have call successors, (31), 9 states have call predecessors, (31), 10 states have return successors, (50), 36 states have call predecessors, (50), 31 states have call successors, (50) [2025-03-09 01:45:38,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 271 transitions. [2025-03-09 01:45:38,257 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 271 transitions. Word has length 32 [2025-03-09 01:45:38,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:38,258 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 271 transitions. [2025-03-09 01:45:38,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:45:38,258 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 271 transitions. [2025-03-09 01:45:38,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-09 01:45:38,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:38,258 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:38,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 01:45:38,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:38,459 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting binomialCoefficientErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:45:38,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:38,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1163134324, now seen corresponding path program 1 times [2025-03-09 01:45:38,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:38,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703539169] [2025-03-09 01:45:38,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:38,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:38,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 01:45:38,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:45:38,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:38,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 01:45:38,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1332690150] [2025-03-09 01:45:38,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:38,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:38,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:45:38,473 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:45:38,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:45:38,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 01:45:38,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:45:38,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:38,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:38,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 01:45:38,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:45:38,567 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 01:45:38,568 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:45:39,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:39,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703539169] [2025-03-09 01:45:39,250 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 01:45:39,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332690150] [2025-03-09 01:45:39,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332690150] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:45:39,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:45:39,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-03-09 01:45:39,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891739427] [2025-03-09 01:45:39,251 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 01:45:39,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:45:39,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:39,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:45:39,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:45:39,251 INFO L87 Difference]: Start difference. First operand 199 states and 271 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:45:39,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:39,310 INFO L93 Difference]: Finished difference Result 248 states and 348 transitions. [2025-03-09 01:45:39,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:45:39,311 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2025-03-09 01:45:39,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:39,312 INFO L225 Difference]: With dead ends: 248 [2025-03-09 01:45:39,312 INFO L226 Difference]: Without dead ends: 247 [2025-03-09 01:45:39,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:45:39,313 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 25 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:39,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 217 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:45:39,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-09 01:45:39,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 203. [2025-03-09 01:45:39,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 149 states have (on average 1.2953020134228188) internal successors, (193), 157 states have internal predecessors, (193), 31 states have call successors, (31), 9 states have call predecessors, (31), 10 states have return successors, (50), 36 states have call predecessors, (50), 31 states have call successors, (50) [2025-03-09 01:45:39,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 274 transitions. [2025-03-09 01:45:39,325 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 274 transitions. Word has length 33 [2025-03-09 01:45:39,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:39,325 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 274 transitions. [2025-03-09 01:45:39,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:45:39,326 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 274 transitions. [2025-03-09 01:45:39,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-09 01:45:39,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:39,326 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:39,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 01:45:39,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:39,530 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:45:39,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:39,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1034371152, now seen corresponding path program 1 times [2025-03-09 01:45:39,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:39,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399280505] [2025-03-09 01:45:39,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:39,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:39,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 01:45:39,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 01:45:39,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:39,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:39,563 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 01:45:39,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:39,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399280505] [2025-03-09 01:45:39,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399280505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:45:39,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:45:39,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:45:39,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289996529] [2025-03-09 01:45:39,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:45:39,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:45:39,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:39,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:45:39,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:45:39,565 INFO L87 Difference]: Start difference. First operand 203 states and 274 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 01:45:39,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:39,582 INFO L93 Difference]: Finished difference Result 203 states and 274 transitions. [2025-03-09 01:45:39,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:45:39,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2025-03-09 01:45:39,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:39,583 INFO L225 Difference]: With dead ends: 203 [2025-03-09 01:45:39,583 INFO L226 Difference]: Without dead ends: 202 [2025-03-09 01:45:39,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:45:39,584 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 3 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:39,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 149 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:45:39,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-09 01:45:39,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2025-03-09 01:45:39,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 149 states have (on average 1.2818791946308725) internal successors, (191), 156 states have internal predecessors, (191), 31 states have call successors, (31), 9 states have call predecessors, (31), 10 states have return successors, (50), 36 states have call predecessors, (50), 31 states have call successors, (50) [2025-03-09 01:45:39,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 272 transitions. [2025-03-09 01:45:39,593 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 272 transitions. Word has length 38 [2025-03-09 01:45:39,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:39,593 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 272 transitions. [2025-03-09 01:45:39,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 01:45:39,593 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 272 transitions. [2025-03-09 01:45:39,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-09 01:45:39,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:39,594 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:39,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:45:39,594 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:45:39,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:39,594 INFO L85 PathProgramCache]: Analyzing trace with hash 2000734652, now seen corresponding path program 1 times [2025-03-09 01:45:39,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:39,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159649342] [2025-03-09 01:45:39,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:39,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:39,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 01:45:39,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 01:45:39,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:39,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:39,649 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 01:45:39,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:39,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159649342] [2025-03-09 01:45:39,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159649342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:45:39,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:45:39,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:45:39,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368528341] [2025-03-09 01:45:39,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:45:39,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:45:39,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:39,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:45:39,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:45:39,651 INFO L87 Difference]: Start difference. First operand 202 states and 272 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 01:45:39,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:39,683 INFO L93 Difference]: Finished difference Result 213 states and 285 transitions. [2025-03-09 01:45:39,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:45:39,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2025-03-09 01:45:39,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:39,685 INFO L225 Difference]: With dead ends: 213 [2025-03-09 01:45:39,685 INFO L226 Difference]: Without dead ends: 212 [2025-03-09 01:45:39,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:45:39,685 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 2 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:39,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 166 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:45:39,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-09 01:45:39,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2025-03-09 01:45:39,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 158 states have (on average 1.2658227848101267) internal successors, (200), 163 states have internal predecessors, (200), 32 states have call successors, (32), 9 states have call predecessors, (32), 10 states have return successors, (51), 39 states have call predecessors, (51), 32 states have call successors, (51) [2025-03-09 01:45:39,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 283 transitions. [2025-03-09 01:45:39,698 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 283 transitions. Word has length 39 [2025-03-09 01:45:39,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:39,698 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 283 transitions. [2025-03-09 01:45:39,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 01:45:39,699 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 283 transitions. [2025-03-09 01:45:39,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-09 01:45:39,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:39,699 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:39,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:45:39,700 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:45:39,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:39,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1439347686, now seen corresponding path program 1 times [2025-03-09 01:45:39,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:39,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851222231] [2025-03-09 01:45:39,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:39,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:39,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 01:45:39,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 01:45:39,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:39,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:39,741 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-09 01:45:39,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:39,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851222231] [2025-03-09 01:45:39,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851222231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:45:39,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:45:39,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:45:39,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573546461] [2025-03-09 01:45:39,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:45:39,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:45:39,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:39,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:45:39,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:45:39,744 INFO L87 Difference]: Start difference. First operand 212 states and 283 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 01:45:39,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:39,759 INFO L93 Difference]: Finished difference Result 212 states and 283 transitions. [2025-03-09 01:45:39,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:45:39,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2025-03-09 01:45:39,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:39,761 INFO L225 Difference]: With dead ends: 212 [2025-03-09 01:45:39,761 INFO L226 Difference]: Without dead ends: 211 [2025-03-09 01:45:39,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:45:39,762 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 4 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:39,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 144 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:45:39,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-09 01:45:39,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2025-03-09 01:45:39,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 158 states have (on average 1.259493670886076) internal successors, (199), 162 states have internal predecessors, (199), 32 states have call successors, (32), 9 states have call predecessors, (32), 10 states have return successors, (51), 39 states have call predecessors, (51), 32 states have call successors, (51) [2025-03-09 01:45:39,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 282 transitions. [2025-03-09 01:45:39,771 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 282 transitions. Word has length 41 [2025-03-09 01:45:39,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:39,771 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 282 transitions. [2025-03-09 01:45:39,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 01:45:39,772 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 282 transitions. [2025-03-09 01:45:39,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-09 01:45:39,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:39,772 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:39,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:45:39,772 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:45:39,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:39,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1670105299, now seen corresponding path program 1 times [2025-03-09 01:45:39,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:39,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611896862] [2025-03-09 01:45:39,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:39,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:39,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 01:45:39,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 01:45:39,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:39,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:39,804 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-09 01:45:39,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:39,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611896862] [2025-03-09 01:45:39,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611896862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:45:39,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:45:39,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:45:39,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147242637] [2025-03-09 01:45:39,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:45:39,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:45:39,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:39,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:45:39,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:45:39,805 INFO L87 Difference]: Start difference. First operand 211 states and 282 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 01:45:39,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:39,825 INFO L93 Difference]: Finished difference Result 215 states and 285 transitions. [2025-03-09 01:45:39,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:45:39,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2025-03-09 01:45:39,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:39,826 INFO L225 Difference]: With dead ends: 215 [2025-03-09 01:45:39,826 INFO L226 Difference]: Without dead ends: 214 [2025-03-09 01:45:39,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:45:39,827 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 3 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:39,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 159 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:45:39,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-09 01:45:39,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2025-03-09 01:45:39,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 160 states have (on average 1.25625) internal successors, (201), 164 states have internal predecessors, (201), 32 states have call successors, (32), 9 states have call predecessors, (32), 10 states have return successors, (51), 39 states have call predecessors, (51), 32 states have call successors, (51) [2025-03-09 01:45:39,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2025-03-09 01:45:39,837 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 42 [2025-03-09 01:45:39,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:39,837 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2025-03-09 01:45:39,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 01:45:39,838 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2025-03-09 01:45:39,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-09 01:45:39,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:39,838 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:39,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 01:45:39,839 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:45:39,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:39,839 INFO L85 PathProgramCache]: Analyzing trace with hash -223513189, now seen corresponding path program 1 times [2025-03-09 01:45:39,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:39,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235139056] [2025-03-09 01:45:39,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:39,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:39,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 01:45:39,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 01:45:39,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:39,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:39,932 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 01:45:39,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:39,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235139056] [2025-03-09 01:45:39,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235139056] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:45:39,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410151839] [2025-03-09 01:45:39,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:39,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:39,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:45:39,935 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:45:39,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:45:39,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 01:45:39,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 01:45:39,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:39,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:39,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:45:39,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:45:40,009 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 01:45:40,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:45:40,117 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 01:45:40,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410151839] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:45:40,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:45:40,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-09 01:45:40,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442085246] [2025-03-09 01:45:40,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:45:40,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:45:40,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:40,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:45:40,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:45:40,118 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand has 16 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 7 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 01:45:40,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:40,383 INFO L93 Difference]: Finished difference Result 300 states and 392 transitions. [2025-03-09 01:45:40,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 01:45:40,383 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 7 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 48 [2025-03-09 01:45:40,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:40,384 INFO L225 Difference]: With dead ends: 300 [2025-03-09 01:45:40,384 INFO L226 Difference]: Without dead ends: 299 [2025-03-09 01:45:40,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:45:40,385 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 129 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:40,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 604 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:45:40,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-03-09 01:45:40,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 276. [2025-03-09 01:45:40,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 208 states have (on average 1.2932692307692308) internal successors, (269), 214 states have internal predecessors, (269), 42 states have call successors, (42), 12 states have call predecessors, (42), 15 states have return successors, (69), 49 states have call predecessors, (69), 42 states have call successors, (69) [2025-03-09 01:45:40,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 380 transitions. [2025-03-09 01:45:40,397 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 380 transitions. Word has length 48 [2025-03-09 01:45:40,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:40,397 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 380 transitions. [2025-03-09 01:45:40,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 7 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 01:45:40,397 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 380 transitions. [2025-03-09 01:45:40,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-09 01:45:40,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:40,398 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:40,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 01:45:40,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 01:45:40,602 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:45:40,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:40,602 INFO L85 PathProgramCache]: Analyzing trace with hash 829482571, now seen corresponding path program 1 times [2025-03-09 01:45:40,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:40,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708771900] [2025-03-09 01:45:40,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:40,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:40,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 01:45:40,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 01:45:40,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:40,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:40,679 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 01:45:40,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:40,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708771900] [2025-03-09 01:45:40,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708771900] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:45:40,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267380218] [2025-03-09 01:45:40,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:40,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:40,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:45:40,682 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:45:40,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:45:40,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 01:45:40,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 01:45:40,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:40,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:40,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:45:40,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:45:40,810 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 01:45:40,811 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:45:40,871 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 01:45:40,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267380218] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:45:40,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:45:40,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-03-09 01:45:40,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849471238] [2025-03-09 01:45:40,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:45:40,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:45:40,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:40,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:45:40,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:45:40,872 INFO L87 Difference]: Start difference. First operand 276 states and 380 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 01:45:40,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:40,986 INFO L93 Difference]: Finished difference Result 515 states and 714 transitions. [2025-03-09 01:45:40,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 01:45:40,987 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 52 [2025-03-09 01:45:40,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:40,988 INFO L225 Difference]: With dead ends: 515 [2025-03-09 01:45:40,988 INFO L226 Difference]: Without dead ends: 306 [2025-03-09 01:45:40,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 93 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:45:40,989 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 31 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:40,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 277 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:45:40,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-03-09 01:45:40,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 290. [2025-03-09 01:45:40,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 222 states have (on average 1.2882882882882882) internal successors, (286), 228 states have internal predecessors, (286), 42 states have call successors, (42), 12 states have call predecessors, (42), 15 states have return successors, (69), 49 states have call predecessors, (69), 42 states have call successors, (69) [2025-03-09 01:45:41,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 397 transitions. [2025-03-09 01:45:41,000 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 397 transitions. Word has length 52 [2025-03-09 01:45:41,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:41,000 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 397 transitions. [2025-03-09 01:45:41,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 01:45:41,001 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 397 transitions. [2025-03-09 01:45:41,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-09 01:45:41,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:41,001 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:41,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 01:45:41,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-09 01:45:41,202 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:45:41,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:41,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1346086293, now seen corresponding path program 1 times [2025-03-09 01:45:41,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:41,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121409936] [2025-03-09 01:45:41,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:41,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:41,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-09 01:45:41,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 01:45:41,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:41,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:41,248 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 01:45:41,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:41,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121409936] [2025-03-09 01:45:41,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121409936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:45:41,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:45:41,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:45:41,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322847995] [2025-03-09 01:45:41,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:45:41,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:45:41,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:41,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:45:41,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:45:41,249 INFO L87 Difference]: Start difference. First operand 290 states and 397 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 01:45:41,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:41,308 INFO L93 Difference]: Finished difference Result 519 states and 716 transitions. [2025-03-09 01:45:41,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:45:41,309 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 54 [2025-03-09 01:45:41,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:41,310 INFO L225 Difference]: With dead ends: 519 [2025-03-09 01:45:41,310 INFO L226 Difference]: Without dead ends: 263 [2025-03-09 01:45:41,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:45:41,311 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 16 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:41,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 192 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:45:41,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-09 01:45:41,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 262. [2025-03-09 01:45:41,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 200 states have (on average 1.275) internal successors, (255), 207 states have internal predecessors, (255), 37 states have call successors, (37), 11 states have call predecessors, (37), 14 states have return successors, (61), 43 states have call predecessors, (61), 37 states have call successors, (61) [2025-03-09 01:45:41,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 353 transitions. [2025-03-09 01:45:41,322 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 353 transitions. Word has length 54 [2025-03-09 01:45:41,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:41,322 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 353 transitions. [2025-03-09 01:45:41,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 01:45:41,322 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 353 transitions. [2025-03-09 01:45:41,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-09 01:45:41,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:41,323 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:41,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 01:45:41,323 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:45:41,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:41,323 INFO L85 PathProgramCache]: Analyzing trace with hash 253721654, now seen corresponding path program 2 times [2025-03-09 01:45:41,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:41,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460277787] [2025-03-09 01:45:41,323 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:45:41,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:41,327 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-03-09 01:45:41,331 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 01:45:41,331 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:45:41,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:41,403 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:45:41,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:41,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460277787] [2025-03-09 01:45:41,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460277787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:45:41,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:45:41,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 01:45:41,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195102022] [2025-03-09 01:45:41,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:45:41,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:45:41,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:41,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:45:41,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:45:41,405 INFO L87 Difference]: Start difference. First operand 262 states and 353 transitions. Second operand has 8 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 01:45:41,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:41,524 INFO L93 Difference]: Finished difference Result 537 states and 742 transitions. [2025-03-09 01:45:41,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:45:41,524 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 54 [2025-03-09 01:45:41,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:41,526 INFO L225 Difference]: With dead ends: 537 [2025-03-09 01:45:41,526 INFO L226 Difference]: Without dead ends: 313 [2025-03-09 01:45:41,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:45:41,527 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 40 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:41,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 309 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:45:41,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-09 01:45:41,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 306. [2025-03-09 01:45:41,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 234 states have (on average 1.3034188034188035) internal successors, (305), 239 states have internal predecessors, (305), 45 states have call successors, (45), 13 states have call predecessors, (45), 16 states have return successors, (75), 53 states have call predecessors, (75), 45 states have call successors, (75) [2025-03-09 01:45:41,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 425 transitions. [2025-03-09 01:45:41,540 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 425 transitions. Word has length 54 [2025-03-09 01:45:41,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:41,540 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 425 transitions. [2025-03-09 01:45:41,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 01:45:41,540 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 425 transitions. [2025-03-09 01:45:41,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 01:45:41,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:41,540 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:41,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 01:45:41,541 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:45:41,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:41,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1454196139, now seen corresponding path program 1 times [2025-03-09 01:45:41,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:41,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229403395] [2025-03-09 01:45:41,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:41,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:41,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 01:45:41,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 01:45:41,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:41,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 01:45:41,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1551479653] [2025-03-09 01:45:41,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:41,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:41,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:45:41,555 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:45:41,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:45:41,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 01:45:41,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 01:45:41,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:41,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:41,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:45:41,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:45:41,634 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-09 01:45:41,634 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:45:41,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:41,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229403395] [2025-03-09 01:45:41,635 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 01:45:41,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551479653] [2025-03-09 01:45:41,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551479653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:45:41,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:45:41,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:45:41,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716861298] [2025-03-09 01:45:41,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:45:41,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:45:41,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:41,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:45:41,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:45:41,636 INFO L87 Difference]: Start difference. First operand 306 states and 425 transitions. Second operand has 6 states, 4 states have (on average 8.25) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 01:45:41,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:41,658 INFO L93 Difference]: Finished difference Result 306 states and 425 transitions. [2025-03-09 01:45:41,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:45:41,659 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 8.25) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2025-03-09 01:45:41,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:41,660 INFO L225 Difference]: With dead ends: 306 [2025-03-09 01:45:41,660 INFO L226 Difference]: Without dead ends: 305 [2025-03-09 01:45:41,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:45:41,661 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:41,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 194 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:45:41,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-03-09 01:45:41,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2025-03-09 01:45:41,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 234 states have (on average 1.2905982905982907) internal successors, (302), 238 states have internal predecessors, (302), 45 states have call successors, (45), 13 states have call predecessors, (45), 16 states have return successors, (75), 53 states have call predecessors, (75), 45 states have call successors, (75) [2025-03-09 01:45:41,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 422 transitions. [2025-03-09 01:45:41,675 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 422 transitions. Word has length 55 [2025-03-09 01:45:41,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:41,676 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 422 transitions. [2025-03-09 01:45:41,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 8.25) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 01:45:41,676 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 422 transitions. [2025-03-09 01:45:41,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-09 01:45:41,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:41,676 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:41,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 01:45:41,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:41,877 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:45:41,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:41,878 INFO L85 PathProgramCache]: Analyzing trace with hash -2130407378, now seen corresponding path program 1 times [2025-03-09 01:45:41,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:41,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598639380] [2025-03-09 01:45:41,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:41,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:41,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 01:45:41,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 01:45:41,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:41,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 01:45:41,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1620712320] [2025-03-09 01:45:41,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:41,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:41,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:45:41,890 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:45:41,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:45:41,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 01:45:41,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 01:45:41,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:41,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:41,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:45:41,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:45:42,028 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-09 01:45:42,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:45:42,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:42,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598639380] [2025-03-09 01:45:42,097 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 01:45:42,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620712320] [2025-03-09 01:45:42,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620712320] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:45:42,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:45:42,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2025-03-09 01:45:42,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930630139] [2025-03-09 01:45:42,097 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 01:45:42,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:45:42,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:42,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:45:42,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-09 01:45:42,099 INFO L87 Difference]: Start difference. First operand 305 states and 422 transitions. Second operand has 13 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 01:45:42,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:42,347 INFO L93 Difference]: Finished difference Result 327 states and 440 transitions. [2025-03-09 01:45:42,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 01:45:42,347 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 56 [2025-03-09 01:45:42,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:42,349 INFO L225 Difference]: With dead ends: 327 [2025-03-09 01:45:42,349 INFO L226 Difference]: Without dead ends: 326 [2025-03-09 01:45:42,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:45:42,353 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 63 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:42,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 313 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:45:42,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-03-09 01:45:42,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 305. [2025-03-09 01:45:42,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 234 states have (on average 1.2863247863247864) internal successors, (301), 238 states have internal predecessors, (301), 45 states have call successors, (45), 13 states have call predecessors, (45), 16 states have return successors, (75), 53 states have call predecessors, (75), 45 states have call successors, (75) [2025-03-09 01:45:42,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 421 transitions. [2025-03-09 01:45:42,368 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 421 transitions. Word has length 56 [2025-03-09 01:45:42,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:42,368 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 421 transitions. [2025-03-09 01:45:42,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 01:45:42,368 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 421 transitions. [2025-03-09 01:45:42,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-09 01:45:42,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:42,371 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:42,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 01:45:42,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-09 01:45:42,572 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:45:42,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:42,573 INFO L85 PathProgramCache]: Analyzing trace with hash -901698318, now seen corresponding path program 1 times [2025-03-09 01:45:42,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:42,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595730743] [2025-03-09 01:45:42,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:42,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:42,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-09 01:45:42,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-09 01:45:42,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:42,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:42,639 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-09 01:45:42,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:42,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595730743] [2025-03-09 01:45:42,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595730743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:45:42,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:45:42,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:45:42,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336052286] [2025-03-09 01:45:42,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:45:42,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:45:42,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:42,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:45:42,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:45:42,641 INFO L87 Difference]: Start difference. First operand 305 states and 421 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 01:45:42,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:42,721 INFO L93 Difference]: Finished difference Result 564 states and 774 transitions. [2025-03-09 01:45:42,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:45:42,721 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 64 [2025-03-09 01:45:42,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:42,723 INFO L225 Difference]: With dead ends: 564 [2025-03-09 01:45:42,723 INFO L226 Difference]: Without dead ends: 308 [2025-03-09 01:45:42,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:45:42,724 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 35 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:42,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 346 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:45:42,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-09 01:45:42,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 301. [2025-03-09 01:45:42,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 231 states have (on average 1.2727272727272727) internal successors, (294), 235 states have internal predecessors, (294), 43 states have call successors, (43), 14 states have call predecessors, (43), 17 states have return successors, (69), 51 states have call predecessors, (69), 43 states have call successors, (69) [2025-03-09 01:45:42,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 406 transitions. [2025-03-09 01:45:42,747 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 406 transitions. Word has length 64 [2025-03-09 01:45:42,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:42,747 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 406 transitions. [2025-03-09 01:45:42,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 01:45:42,748 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 406 transitions. [2025-03-09 01:45:42,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-09 01:45:42,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:42,748 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:42,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-09 01:45:42,748 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting binomialCoefficientErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:45:42,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:42,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1041334019, now seen corresponding path program 1 times [2025-03-09 01:45:42,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:42,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035355462] [2025-03-09 01:45:42,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:42,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:42,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 01:45:42,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 01:45:42,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:42,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:42,840 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-09 01:45:42,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:42,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035355462] [2025-03-09 01:45:42,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035355462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:45:42,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:45:42,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:45:42,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680574165] [2025-03-09 01:45:42,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:45:42,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:45:42,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:42,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:45:42,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:45:42,842 INFO L87 Difference]: Start difference. First operand 301 states and 406 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-09 01:45:42,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:42,938 INFO L93 Difference]: Finished difference Result 307 states and 406 transitions. [2025-03-09 01:45:42,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:45:42,939 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 66 [2025-03-09 01:45:42,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:42,941 INFO L225 Difference]: With dead ends: 307 [2025-03-09 01:45:42,941 INFO L226 Difference]: Without dead ends: 306 [2025-03-09 01:45:42,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:45:42,942 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 42 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:42,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 328 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:45:42,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-03-09 01:45:42,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 300. [2025-03-09 01:45:42,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 231 states have (on average 1.2380952380952381) internal successors, (286), 234 states have internal predecessors, (286), 43 states have call successors, (43), 14 states have call predecessors, (43), 17 states have return successors, (69), 51 states have call predecessors, (69), 43 states have call successors, (69) [2025-03-09 01:45:42,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 398 transitions. [2025-03-09 01:45:42,958 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 398 transitions. Word has length 66 [2025-03-09 01:45:42,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:42,958 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 398 transitions. [2025-03-09 01:45:42,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-09 01:45:42,958 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 398 transitions. [2025-03-09 01:45:42,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-09 01:45:42,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:42,959 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:42,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-09 01:45:42,959 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting binomialCoefficientErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:45:42,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:42,960 INFO L85 PathProgramCache]: Analyzing trace with hash -2078383784, now seen corresponding path program 1 times [2025-03-09 01:45:42,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:42,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737477002] [2025-03-09 01:45:42,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:42,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:42,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-09 01:45:42,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-09 01:45:42,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:42,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:43,034 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-09 01:45:43,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:43,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737477002] [2025-03-09 01:45:43,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737477002] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:45:43,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485987211] [2025-03-09 01:45:43,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:43,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:43,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:45:43,037 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:45:43,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 01:45:43,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-09 01:45:43,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-09 01:45:43,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:43,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:43,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 01:45:43,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:45:43,177 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-09 01:45:43,177 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:45:43,278 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-09 01:45:43,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485987211] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:45:43,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:45:43,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-03-09 01:45:43,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942921851] [2025-03-09 01:45:43,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:45:43,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 01:45:43,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:43,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 01:45:43,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-03-09 01:45:43,280 INFO L87 Difference]: Start difference. First operand 300 states and 398 transitions. Second operand has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 16 states have internal predecessors, (67), 10 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-09 01:45:43,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:43,481 INFO L93 Difference]: Finished difference Result 428 states and 572 transitions. [2025-03-09 01:45:43,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 01:45:43,482 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 16 states have internal predecessors, (67), 10 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) Word has length 67 [2025-03-09 01:45:43,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:43,484 INFO L225 Difference]: With dead ends: 428 [2025-03-09 01:45:43,484 INFO L226 Difference]: Without dead ends: 427 [2025-03-09 01:45:43,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2025-03-09 01:45:43,485 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 121 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:43,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 689 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:45:43,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-03-09 01:45:43,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 408. [2025-03-09 01:45:43,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 315 states have (on average 1.2126984126984126) internal successors, (382), 314 states have internal predecessors, (382), 64 states have call successors, (64), 17 states have call predecessors, (64), 20 states have return successors, (108), 76 states have call predecessors, (108), 64 states have call successors, (108) [2025-03-09 01:45:43,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 554 transitions. [2025-03-09 01:45:43,510 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 554 transitions. Word has length 67 [2025-03-09 01:45:43,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:43,511 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 554 transitions. [2025-03-09 01:45:43,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 16 states have internal predecessors, (67), 10 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-09 01:45:43,511 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 554 transitions. [2025-03-09 01:45:43,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-09 01:45:43,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:43,511 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:43,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 01:45:43,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-09 01:45:43,716 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:45:43,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:43,716 INFO L85 PathProgramCache]: Analyzing trace with hash 2097932589, now seen corresponding path program 2 times [2025-03-09 01:45:43,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:43,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975678065] [2025-03-09 01:45:43,716 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:45:43,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:43,720 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-03-09 01:45:43,723 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-03-09 01:45:43,724 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:45:43,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:43,820 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-09 01:45:43,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:43,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975678065] [2025-03-09 01:45:43,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975678065] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:45:43,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107220861] [2025-03-09 01:45:43,821 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:45:43,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:43,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:45:43,822 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:45:43,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 01:45:43,847 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-03-09 01:45:43,861 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-03-09 01:45:43,861 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:45:43,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:43,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:45:43,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:45:43,974 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-09 01:45:43,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:45:44,116 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-09 01:45:44,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107220861] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:45:44,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:45:44,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2025-03-09 01:45:44,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442417366] [2025-03-09 01:45:44,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:45:44,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 01:45:44,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:44,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 01:45:44,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2025-03-09 01:45:44,118 INFO L87 Difference]: Start difference. First operand 408 states and 554 transitions. Second operand has 24 states, 23 states have (on average 3.652173913043478) internal successors, (84), 18 states have internal predecessors, (84), 10 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-09 01:45:44,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:44,594 INFO L93 Difference]: Finished difference Result 499 states and 642 transitions. [2025-03-09 01:45:44,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-09 01:45:44,594 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.652173913043478) internal successors, (84), 18 states have internal predecessors, (84), 10 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) Word has length 72 [2025-03-09 01:45:44,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:44,596 INFO L225 Difference]: With dead ends: 499 [2025-03-09 01:45:44,596 INFO L226 Difference]: Without dead ends: 498 [2025-03-09 01:45:44,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=1228, Unknown=0, NotChecked=0, Total=1406 [2025-03-09 01:45:44,617 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 200 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:44,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 808 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 01:45:44,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-03-09 01:45:44,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 478. [2025-03-09 01:45:44,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 368 states have (on average 1.2119565217391304) internal successors, (446), 372 states have internal predecessors, (446), 70 states have call successors, (70), 23 states have call predecessors, (70), 31 states have return successors, (118), 82 states have call predecessors, (118), 70 states have call successors, (118) [2025-03-09 01:45:44,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 634 transitions. [2025-03-09 01:45:44,639 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 634 transitions. Word has length 72 [2025-03-09 01:45:44,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:44,640 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 634 transitions. [2025-03-09 01:45:44,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.652173913043478) internal successors, (84), 18 states have internal predecessors, (84), 10 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-09 01:45:44,640 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 634 transitions. [2025-03-09 01:45:44,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-09 01:45:44,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:44,640 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:44,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 01:45:44,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-09 01:45:44,843 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting binomialCoefficientErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:45:44,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:44,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1713704998, now seen corresponding path program 1 times [2025-03-09 01:45:44,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:44,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314748238] [2025-03-09 01:45:44,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:44,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:44,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-09 01:45:44,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-09 01:45:44,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:44,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:44,944 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-09 01:45:44,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:44,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314748238] [2025-03-09 01:45:44,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314748238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:45:44,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:45:44,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:45:44,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489109694] [2025-03-09 01:45:44,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:45:44,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:45:44,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:44,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:45:44,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:45:44,946 INFO L87 Difference]: Start difference. First operand 478 states and 634 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-09 01:45:45,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:45,124 INFO L93 Difference]: Finished difference Result 869 states and 1176 transitions. [2025-03-09 01:45:45,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:45:45,125 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 76 [2025-03-09 01:45:45,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:45,127 INFO L225 Difference]: With dead ends: 869 [2025-03-09 01:45:45,127 INFO L226 Difference]: Without dead ends: 436 [2025-03-09 01:45:45,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:45:45,129 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 43 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:45,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 371 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:45:45,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-03-09 01:45:45,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 374. [2025-03-09 01:45:45,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 283 states have (on average 1.254416961130742) internal successors, (355), 295 states have internal predecessors, (355), 55 states have call successors, (55), 23 states have call predecessors, (55), 27 states have return successors, (76), 55 states have call predecessors, (76), 55 states have call successors, (76) [2025-03-09 01:45:45,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 486 transitions. [2025-03-09 01:45:45,157 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 486 transitions. Word has length 76 [2025-03-09 01:45:45,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:45,158 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 486 transitions. [2025-03-09 01:45:45,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-09 01:45:45,158 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 486 transitions. [2025-03-09 01:45:45,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-09 01:45:45,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:45,159 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:45,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-09 01:45:45,159 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:45:45,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:45,159 INFO L85 PathProgramCache]: Analyzing trace with hash 440881600, now seen corresponding path program 1 times [2025-03-09 01:45:45,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:45,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342886739] [2025-03-09 01:45:45,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:45,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:45,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 01:45:45,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 01:45:45,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:45,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 01:45:45,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [75470326] [2025-03-09 01:45:45,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:45,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:45,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:45:45,170 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:45:45,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 01:45:45,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 01:45:45,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 01:45:45,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:45,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:45,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:45:45,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:45:45,370 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 40 proven. 18 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-09 01:45:45,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:45:45,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:45,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342886739] [2025-03-09 01:45:45,480 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 01:45:45,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75470326] [2025-03-09 01:45:45,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75470326] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:45:45,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:45:45,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2025-03-09 01:45:45,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081042129] [2025-03-09 01:45:45,481 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 01:45:45,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 01:45:45,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:45,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 01:45:45,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2025-03-09 01:45:45,482 INFO L87 Difference]: Start difference. First operand 374 states and 486 transitions. Second operand has 17 states, 14 states have (on average 3.5) internal successors, (49), 15 states have internal predecessors, (49), 8 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-09 01:45:45,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:45,858 INFO L93 Difference]: Finished difference Result 510 states and 649 transitions. [2025-03-09 01:45:45,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-09 01:45:45,858 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 3.5) internal successors, (49), 15 states have internal predecessors, (49), 8 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) Word has length 80 [2025-03-09 01:45:45,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:45,860 INFO L225 Difference]: With dead ends: 510 [2025-03-09 01:45:45,860 INFO L226 Difference]: Without dead ends: 506 [2025-03-09 01:45:45,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=810, Unknown=0, NotChecked=0, Total=930 [2025-03-09 01:45:45,861 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 112 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:45,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 509 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:45:45,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-03-09 01:45:45,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 447. [2025-03-09 01:45:45,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 341 states have (on average 1.2316715542521994) internal successors, (420), 351 states have internal predecessors, (420), 63 states have call successors, (63), 27 states have call predecessors, (63), 34 states have return successors, (92), 68 states have call predecessors, (92), 63 states have call successors, (92) [2025-03-09 01:45:45,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 575 transitions. [2025-03-09 01:45:45,880 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 575 transitions. Word has length 80 [2025-03-09 01:45:45,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:45,880 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 575 transitions. [2025-03-09 01:45:45,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 3.5) internal successors, (49), 15 states have internal predecessors, (49), 8 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-09 01:45:45,880 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 575 transitions. [2025-03-09 01:45:45,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-09 01:45:45,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:45,881 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:45,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-09 01:45:46,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-09 01:45:46,085 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting binomialCoefficientErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:45:46,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:46,086 INFO L85 PathProgramCache]: Analyzing trace with hash 515985528, now seen corresponding path program 1 times [2025-03-09 01:45:46,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:46,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362083283] [2025-03-09 01:45:46,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:46,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:46,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-09 01:45:46,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-09 01:45:46,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:46,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 01:45:46,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [48761413] [2025-03-09 01:45:46,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:46,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:46,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:45:46,122 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:45:46,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 01:45:46,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-09 01:45:46,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-09 01:45:46,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:46,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:46,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:45:46,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:45:46,233 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-09 01:45:46,233 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:45:46,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:46,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362083283] [2025-03-09 01:45:46,233 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 01:45:46,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48761413] [2025-03-09 01:45:46,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48761413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:45:46,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:45:46,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:45:46,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584522799] [2025-03-09 01:45:46,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:45:46,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:45:46,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:46,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:45:46,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:45:46,235 INFO L87 Difference]: Start difference. First operand 447 states and 575 transitions. Second operand has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-09 01:45:46,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:46,293 INFO L93 Difference]: Finished difference Result 447 states and 575 transitions. [2025-03-09 01:45:46,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:45:46,293 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2025-03-09 01:45:46,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:46,295 INFO L225 Difference]: With dead ends: 447 [2025-03-09 01:45:46,295 INFO L226 Difference]: Without dead ends: 446 [2025-03-09 01:45:46,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:45:46,296 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 7 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:46,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 152 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:45:46,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-03-09 01:45:46,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2025-03-09 01:45:46,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 341 states have (on average 1.2052785923753666) internal successors, (411), 350 states have internal predecessors, (411), 63 states have call successors, (63), 27 states have call predecessors, (63), 34 states have return successors, (92), 68 states have call predecessors, (92), 63 states have call successors, (92) [2025-03-09 01:45:46,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 566 transitions. [2025-03-09 01:45:46,323 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 566 transitions. Word has length 84 [2025-03-09 01:45:46,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:46,323 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 566 transitions. [2025-03-09 01:45:46,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-09 01:45:46,323 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 566 transitions. [2025-03-09 01:45:46,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-09 01:45:46,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:46,325 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:46,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-09 01:45:46,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-09 01:45:46,526 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting binomialCoefficientErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:45:46,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:46,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1184317827, now seen corresponding path program 1 times [2025-03-09 01:45:46,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:46,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033185466] [2025-03-09 01:45:46,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:46,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:46,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-09 01:45:46,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-09 01:45:46,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:46,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 01:45:46,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1778014812] [2025-03-09 01:45:46,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:46,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:46,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:45:46,539 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:45:46,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 01:45:46,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-09 01:45:46,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-09 01:45:46,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:46,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:46,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 01:45:46,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:45:46,726 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 49 proven. 7 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-09 01:45:46,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:45:46,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:46,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033185466] [2025-03-09 01:45:46,960 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 01:45:46,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778014812] [2025-03-09 01:45:46,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778014812] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:45:46,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:45:46,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-03-09 01:45:46,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742069287] [2025-03-09 01:45:46,961 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 01:45:46,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:45:46,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:46,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:45:46,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:45:46,962 INFO L87 Difference]: Start difference. First operand 446 states and 566 transitions. Second operand has 11 states, 9 states have (on average 5.555555555555555) internal successors, (50), 11 states have internal predecessors, (50), 3 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-09 01:45:47,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:47,143 INFO L93 Difference]: Finished difference Result 569 states and 763 transitions. [2025-03-09 01:45:47,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:45:47,143 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.555555555555555) internal successors, (50), 11 states have internal predecessors, (50), 3 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 85 [2025-03-09 01:45:47,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:47,146 INFO L225 Difference]: With dead ends: 569 [2025-03-09 01:45:47,146 INFO L226 Difference]: Without dead ends: 568 [2025-03-09 01:45:47,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:45:47,146 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 12 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:47,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 223 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:45:47,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-03-09 01:45:47,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 483. [2025-03-09 01:45:47,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 371 states have (on average 1.1859838274932615) internal successors, (440), 377 states have internal predecessors, (440), 70 states have call successors, (70), 27 states have call predecessors, (70), 34 states have return successors, (99), 78 states have call predecessors, (99), 70 states have call successors, (99) [2025-03-09 01:45:47,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 609 transitions. [2025-03-09 01:45:47,167 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 609 transitions. Word has length 85 [2025-03-09 01:45:47,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:47,167 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 609 transitions. [2025-03-09 01:45:47,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.555555555555555) internal successors, (50), 11 states have internal predecessors, (50), 3 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-09 01:45:47,167 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 609 transitions. [2025-03-09 01:45:47,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-09 01:45:47,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:47,168 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:47,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-09 01:45:47,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:47,372 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting binomialCoefficientErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:45:47,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:47,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1940853014, now seen corresponding path program 2 times [2025-03-09 01:45:47,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:47,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905222402] [2025-03-09 01:45:47,373 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:45:47,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:47,379 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-03-09 01:45:47,390 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-03-09 01:45:47,390 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:45:47,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 01:45:47,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [96099508] [2025-03-09 01:45:47,392 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:45:47,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:47,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:45:47,394 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:45:47,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-09 01:45:47,419 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-03-09 01:45:47,435 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-03-09 01:45:47,436 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:45:47,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:47,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-09 01:45:47,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:45:47,655 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 52 proven. 22 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-09 01:45:47,655 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:46:20,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:46:20,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905222402] [2025-03-09 01:46:20,275 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 01:46:20,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96099508] [2025-03-09 01:46:20,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96099508] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:46:20,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:46:20,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2025-03-09 01:46:20,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110548814] [2025-03-09 01:46:20,275 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 01:46:20,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 01:46:20,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:46:20,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 01:46:20,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=481, Unknown=5, NotChecked=0, Total=552 [2025-03-09 01:46:20,276 INFO L87 Difference]: Start difference. First operand 483 states and 609 transitions. Second operand has 18 states, 16 states have (on average 3.125) internal successors, (50), 17 states have internal predecessors, (50), 7 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-09 01:46:32,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:46:32,178 INFO L93 Difference]: Finished difference Result 563 states and 740 transitions. [2025-03-09 01:46:32,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 01:46:32,178 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 17 states have internal predecessors, (50), 7 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 86 [2025-03-09 01:46:32,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:46:32,181 INFO L225 Difference]: With dead ends: 563 [2025-03-09 01:46:32,182 INFO L226 Difference]: Without dead ends: 561 [2025-03-09 01:46:32,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 42.4s TimeCoverageRelationStatistics Valid=113, Invalid=692, Unknown=7, NotChecked=0, Total=812 [2025-03-09 01:46:32,183 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 65 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 01:46:32,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 507 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 01:46:32,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-03-09 01:46:32,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 501. [2025-03-09 01:46:32,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 385 states have (on average 1.1792207792207792) internal successors, (454), 391 states have internal predecessors, (454), 72 states have call successors, (72), 27 states have call predecessors, (72), 36 states have return successors, (108), 82 states have call predecessors, (108), 72 states have call successors, (108) [2025-03-09 01:46:32,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 634 transitions. [2025-03-09 01:46:32,206 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 634 transitions. Word has length 86 [2025-03-09 01:46:32,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:46:32,206 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 634 transitions. [2025-03-09 01:46:32,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 17 states have internal predecessors, (50), 7 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-09 01:46:32,206 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 634 transitions. [2025-03-09 01:46:32,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-09 01:46:32,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:46:32,208 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 6, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:46:32,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-09 01:46:32,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:46:32,409 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:46:32,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:46:32,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1468822456, now seen corresponding path program 2 times [2025-03-09 01:46:32,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:46:32,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157371957] [2025-03-09 01:46:32,409 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:46:32,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:46:32,414 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 100 statements into 2 equivalence classes. [2025-03-09 01:46:32,421 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 100 of 100 statements. [2025-03-09 01:46:32,421 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:46:32,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:46:32,544 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 64 proven. 44 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-09 01:46:32,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:46:32,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157371957] [2025-03-09 01:46:32,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157371957] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:46:32,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399864670] [2025-03-09 01:46:32,546 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:46:32,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:46:32,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:46:32,550 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:46:32,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-09 01:46:32,578 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 100 statements into 2 equivalence classes. [2025-03-09 01:46:32,596 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 100 of 100 statements. [2025-03-09 01:46:32,596 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:46:32,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:46:32,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:46:32,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:46:32,648 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 143 proven. 7 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-09 01:46:32,648 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:46:32,884 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 64 proven. 45 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-09 01:46:32,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399864670] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:46:32,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:46:32,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 12 [2025-03-09 01:46:32,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757275689] [2025-03-09 01:46:32,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:46:32,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:46:32,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:46:32,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:46:32,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:46:32,886 INFO L87 Difference]: Start difference. First operand 501 states and 634 transitions. Second operand has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 8 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-09 01:46:33,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:46:33,093 INFO L93 Difference]: Finished difference Result 1009 states and 1310 transitions. [2025-03-09 01:46:33,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:46:33,093 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 8 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) Word has length 100 [2025-03-09 01:46:33,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:46:33,096 INFO L225 Difference]: With dead ends: 1009 [2025-03-09 01:46:33,096 INFO L226 Difference]: Without dead ends: 549 [2025-03-09 01:46:33,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 193 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-03-09 01:46:33,098 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 39 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:46:33,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 352 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:46:33,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-03-09 01:46:33,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 490. [2025-03-09 01:46:33,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 377 states have (on average 1.1830238726790452) internal successors, (446), 383 states have internal predecessors, (446), 70 states have call successors, (70), 27 states have call predecessors, (70), 35 states have return successors, (100), 79 states have call predecessors, (100), 70 states have call successors, (100) [2025-03-09 01:46:33,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 616 transitions. [2025-03-09 01:46:33,119 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 616 transitions. Word has length 100 [2025-03-09 01:46:33,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:46:33,119 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 616 transitions. [2025-03-09 01:46:33,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 8 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-09 01:46:33,120 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 616 transitions. [2025-03-09 01:46:33,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-09 01:46:33,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:46:33,120 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:46:33,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-09 01:46:33,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:46:33,321 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:46:33,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:46:33,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1606358972, now seen corresponding path program 3 times [2025-03-09 01:46:33,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:46:33,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892031249] [2025-03-09 01:46:33,322 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:46:33,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:46:33,327 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 90 statements into 7 equivalence classes. [2025-03-09 01:46:33,339 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 79 of 90 statements. [2025-03-09 01:46:33,339 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-09 01:46:33,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:46:33,488 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 55 proven. 10 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-09 01:46:33,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:46:33,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892031249] [2025-03-09 01:46:33,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892031249] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:46:33,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786189949] [2025-03-09 01:46:33,490 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:46:33,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:46:33,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:46:33,492 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:46:33,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-09 01:46:33,517 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 90 statements into 7 equivalence classes. [2025-03-09 01:46:33,531 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 60 of 90 statements. [2025-03-09 01:46:33,531 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 01:46:33,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:46:33,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 01:46:33,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:46:33,711 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 50 proven. 6 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-09 01:46:33,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:46:34,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786189949] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:46:34,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:46:34,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 19 [2025-03-09 01:46:34,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331116507] [2025-03-09 01:46:34,219 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 01:46:34,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 01:46:34,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:46:34,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 01:46:34,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:46:34,220 INFO L87 Difference]: Start difference. First operand 490 states and 616 transitions. Second operand has 19 states, 19 states have (on average 4.0) internal successors, (76), 17 states have internal predecessors, (76), 7 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-09 01:46:34,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:46:34,818 INFO L93 Difference]: Finished difference Result 1033 states and 1341 transitions. [2025-03-09 01:46:34,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 01:46:34,818 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 17 states have internal predecessors, (76), 7 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) Word has length 90 [2025-03-09 01:46:34,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:46:34,821 INFO L225 Difference]: With dead ends: 1033 [2025-03-09 01:46:34,821 INFO L226 Difference]: Without dead ends: 578 [2025-03-09 01:46:34,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2025-03-09 01:46:34,825 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 53 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 01:46:34,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 646 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 01:46:34,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-03-09 01:46:34,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 488. [2025-03-09 01:46:34,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 377 states have (on average 1.1618037135278514) internal successors, (438), 379 states have internal predecessors, (438), 68 states have call successors, (68), 27 states have call predecessors, (68), 35 states have return successors, (101), 81 states have call predecessors, (101), 68 states have call successors, (101) [2025-03-09 01:46:34,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 607 transitions. [2025-03-09 01:46:34,850 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 607 transitions. Word has length 90 [2025-03-09 01:46:34,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:46:34,850 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 607 transitions. [2025-03-09 01:46:34,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 17 states have internal predecessors, (76), 7 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-09 01:46:34,851 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 607 transitions. [2025-03-09 01:46:34,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-09 01:46:34,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:46:34,851 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:46:34,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-09 01:46:35,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-09 01:46:35,052 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:46:35,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:46:35,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1428753309, now seen corresponding path program 1 times [2025-03-09 01:46:35,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:46:35,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128724554] [2025-03-09 01:46:35,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:46:35,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:46:35,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-09 01:46:35,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-09 01:46:35,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:46:35,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:46:35,110 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-03-09 01:46:35,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:46:35,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128724554] [2025-03-09 01:46:35,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128724554] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:46:35,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262327424] [2025-03-09 01:46:35,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:46:35,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:46:35,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:46:35,113 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:46:35,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-09 01:46:35,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-09 01:46:35,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-09 01:46:35,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:46:35,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:46:35,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:46:35,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:46:35,176 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-03-09 01:46:35,177 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:46:35,285 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-03-09 01:46:35,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262327424] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:46:35,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:46:35,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-09 01:46:35,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239800590] [2025-03-09 01:46:35,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:46:35,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:46:35,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:46:35,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:46:35,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:46:35,287 INFO L87 Difference]: Start difference. First operand 488 states and 607 transitions. Second operand has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 5 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-09 01:46:35,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:46:35,398 INFO L93 Difference]: Finished difference Result 564 states and 715 transitions. [2025-03-09 01:46:35,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:46:35,399 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 5 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 93 [2025-03-09 01:46:35,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:46:35,402 INFO L225 Difference]: With dead ends: 564 [2025-03-09 01:46:35,402 INFO L226 Difference]: Without dead ends: 563 [2025-03-09 01:46:35,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:46:35,403 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 8 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:46:35,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 250 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:46:35,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-03-09 01:46:35,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2025-03-09 01:46:35,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 441 states have (on average 1.1609977324263039) internal successors, (512), 442 states have internal predecessors, (512), 79 states have call successors, (79), 27 states have call predecessors, (79), 35 states have return successors, (112), 93 states have call predecessors, (112), 79 states have call successors, (112) [2025-03-09 01:46:35,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 703 transitions. [2025-03-09 01:46:35,434 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 703 transitions. Word has length 93 [2025-03-09 01:46:35,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:46:35,434 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 703 transitions. [2025-03-09 01:46:35,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 5 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-09 01:46:35,434 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 703 transitions. [2025-03-09 01:46:35,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-09 01:46:35,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:46:35,439 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:46:35,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-09 01:46:35,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:46:35,640 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:46:35,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:46:35,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1134722300, now seen corresponding path program 1 times [2025-03-09 01:46:35,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:46:35,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614631926] [2025-03-09 01:46:35,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:46:35,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:46:35,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-09 01:46:35,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-09 01:46:35,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:46:35,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:46:35,750 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-03-09 01:46:35,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:46:35,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614631926] [2025-03-09 01:46:35,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614631926] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:46:35,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404310217] [2025-03-09 01:46:35,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:46:35,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:46:35,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:46:35,752 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:46:35,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-09 01:46:35,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-09 01:46:35,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-09 01:46:35,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:46:35,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:46:35,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:46:35,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:46:35,851 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-03-09 01:46:35,851 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:46:36,043 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-03-09 01:46:36,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404310217] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:46:36,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:46:36,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-09 01:46:36,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383930596] [2025-03-09 01:46:36,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:46:36,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:46:36,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:46:36,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:46:36,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:46:36,044 INFO L87 Difference]: Start difference. First operand 563 states and 703 transitions. Second operand has 16 states, 13 states have (on average 5.0) internal successors, (65), 12 states have internal predecessors, (65), 7 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-09 01:46:36,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:46:36,337 INFO L93 Difference]: Finished difference Result 815 states and 1018 transitions. [2025-03-09 01:46:36,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 01:46:36,339 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 5.0) internal successors, (65), 12 states have internal predecessors, (65), 7 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 106 [2025-03-09 01:46:36,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:46:36,342 INFO L225 Difference]: With dead ends: 815 [2025-03-09 01:46:36,342 INFO L226 Difference]: Without dead ends: 802 [2025-03-09 01:46:36,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:46:36,343 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 107 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:46:36,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 496 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:46:36,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2025-03-09 01:46:36,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 723. [2025-03-09 01:46:36,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 571 states have (on average 1.1698774080560421) internal successors, (668), 567 states have internal predecessors, (668), 99 states have call successors, (99), 34 states have call predecessors, (99), 45 states have return successors, (148), 121 states have call predecessors, (148), 99 states have call successors, (148) [2025-03-09 01:46:36,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 915 transitions. [2025-03-09 01:46:36,380 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 915 transitions. Word has length 106 [2025-03-09 01:46:36,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:46:36,381 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 915 transitions. [2025-03-09 01:46:36,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 5.0) internal successors, (65), 12 states have internal predecessors, (65), 7 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-09 01:46:36,381 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 915 transitions. [2025-03-09 01:46:36,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-09 01:46:36,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:46:36,382 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 7, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:46:36,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-09 01:46:36,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:46:36,583 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:46:36,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:46:36,583 INFO L85 PathProgramCache]: Analyzing trace with hash -148640384, now seen corresponding path program 2 times [2025-03-09 01:46:36,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:46:36,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437948740] [2025-03-09 01:46:36,583 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:46:36,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:46:36,587 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-03-09 01:46:36,592 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 112 of 112 statements. [2025-03-09 01:46:36,592 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:46:36,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:46:36,729 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-03-09 01:46:36,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:46:36,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437948740] [2025-03-09 01:46:36,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437948740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:46:36,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:46:36,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:46:36,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897977441] [2025-03-09 01:46:36,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:46:36,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:46:36,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:46:36,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:46:36,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:46:36,731 INFO L87 Difference]: Start difference. First operand 723 states and 915 transitions. Second operand has 8 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-09 01:46:36,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:46:36,902 INFO L93 Difference]: Finished difference Result 1211 states and 1535 transitions. [2025-03-09 01:46:36,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:46:36,903 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 112 [2025-03-09 01:46:36,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:46:36,906 INFO L225 Difference]: With dead ends: 1211 [2025-03-09 01:46:36,906 INFO L226 Difference]: Without dead ends: 753 [2025-03-09 01:46:36,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:46:36,908 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 41 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:46:36,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 442 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:46:36,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2025-03-09 01:46:36,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 749. [2025-03-09 01:46:36,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 592 states have (on average 1.1706081081081081) internal successors, (693), 588 states have internal predecessors, (693), 102 states have call successors, (102), 36 states have call predecessors, (102), 47 states have return successors, (149), 124 states have call predecessors, (149), 102 states have call successors, (149) [2025-03-09 01:46:36,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 944 transitions. [2025-03-09 01:46:36,954 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 944 transitions. Word has length 112 [2025-03-09 01:46:36,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:46:36,954 INFO L471 AbstractCegarLoop]: Abstraction has 749 states and 944 transitions. [2025-03-09 01:46:36,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-09 01:46:36,954 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 944 transitions. [2025-03-09 01:46:36,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-09 01:46:36,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:46:36,956 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:46:36,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-09 01:46:36,956 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting binomialCoefficientErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:46:36,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:46:36,957 INFO L85 PathProgramCache]: Analyzing trace with hash -675900341, now seen corresponding path program 1 times [2025-03-09 01:46:36,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:46:36,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789912381] [2025-03-09 01:46:36,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:46:36,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:46:36,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-09 01:46:36,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-09 01:46:36,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:46:36,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:46:37,079 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2025-03-09 01:46:37,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:46:37,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789912381] [2025-03-09 01:46:37,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789912381] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:46:37,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170919330] [2025-03-09 01:46:37,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:46:37,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:46:37,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:46:37,082 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:46:37,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-09 01:46:37,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-09 01:46:37,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-09 01:46:37,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:46:37,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:46:37,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:46:37,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:46:37,252 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-09 01:46:37,252 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:46:37,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170919330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:46:37,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:46:37,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 15 [2025-03-09 01:46:37,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736405958] [2025-03-09 01:46:37,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:46:37,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:46:37,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:46:37,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:46:37,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2025-03-09 01:46:37,254 INFO L87 Difference]: Start difference. First operand 749 states and 944 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-09 01:46:37,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:46:37,503 INFO L93 Difference]: Finished difference Result 1314 states and 1666 transitions. [2025-03-09 01:46:37,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:46:37,504 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 115 [2025-03-09 01:46:37,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:46:37,517 INFO L225 Difference]: With dead ends: 1314 [2025-03-09 01:46:37,517 INFO L226 Difference]: Without dead ends: 708 [2025-03-09 01:46:37,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:46:37,520 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 41 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:46:37,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 409 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:46:37,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2025-03-09 01:46:37,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 701. [2025-03-09 01:46:37,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 554 states have (on average 1.1714801444043321) internal successors, (649), 552 states have internal predecessors, (649), 94 states have call successors, (94), 36 states have call predecessors, (94), 45 states have return successors, (131), 112 states have call predecessors, (131), 94 states have call successors, (131) [2025-03-09 01:46:37,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 874 transitions. [2025-03-09 01:46:37,553 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 874 transitions. Word has length 115 [2025-03-09 01:46:37,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:46:37,553 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 874 transitions. [2025-03-09 01:46:37,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-09 01:46:37,553 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 874 transitions. [2025-03-09 01:46:37,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-09 01:46:37,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:46:37,555 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:46:37,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-09 01:46:37,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:46:37,755 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting binomialCoefficientErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:46:37,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:46:37,756 INFO L85 PathProgramCache]: Analyzing trace with hash -343658998, now seen corresponding path program 2 times [2025-03-09 01:46:37,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:46:37,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588674143] [2025-03-09 01:46:37,756 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:46:37,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:46:37,760 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 115 statements into 2 equivalence classes. [2025-03-09 01:46:37,768 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 115 of 115 statements. [2025-03-09 01:46:37,768 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:46:37,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:46:37,865 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2025-03-09 01:46:37,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:46:37,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588674143] [2025-03-09 01:46:37,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588674143] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:46:37,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464812439] [2025-03-09 01:46:37,866 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:46:37,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:46:37,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:46:37,868 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:46:37,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-09 01:46:37,894 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 115 statements into 2 equivalence classes. [2025-03-09 01:46:37,914 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 115 of 115 statements. [2025-03-09 01:46:37,914 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:46:37,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:46:37,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:46:37,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:46:37,966 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-09 01:46:37,966 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:46:37,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464812439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:46:37,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:46:37,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2025-03-09 01:46:37,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491202369] [2025-03-09 01:46:37,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:46:37,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:46:37,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:46:37,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:46:37,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:46:37,968 INFO L87 Difference]: Start difference. First operand 701 states and 874 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-09 01:46:38,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:46:38,035 INFO L93 Difference]: Finished difference Result 1056 states and 1316 transitions. [2025-03-09 01:46:38,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:46:38,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 115 [2025-03-09 01:46:38,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:46:38,038 INFO L225 Difference]: With dead ends: 1056 [2025-03-09 01:46:38,039 INFO L226 Difference]: Without dead ends: 596 [2025-03-09 01:46:38,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:46:38,040 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 15 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:46:38,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 206 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:46:38,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-03-09 01:46:38,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 595. [2025-03-09 01:46:38,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 470 states have (on average 1.1659574468085105) internal successors, (548), 469 states have internal predecessors, (548), 79 states have call successors, (79), 31 states have call predecessors, (79), 38 states have return successors, (111), 94 states have call predecessors, (111), 79 states have call successors, (111) [2025-03-09 01:46:38,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 738 transitions. [2025-03-09 01:46:38,073 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 738 transitions. Word has length 115 [2025-03-09 01:46:38,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:46:38,073 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 738 transitions. [2025-03-09 01:46:38,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-09 01:46:38,074 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 738 transitions. [2025-03-09 01:46:38,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-09 01:46:38,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:46:38,075 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:46:38,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-09 01:46:38,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-09 01:46:38,276 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting binomialCoefficientErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:46:38,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:46:38,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1246617265, now seen corresponding path program 3 times [2025-03-09 01:46:38,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:46:38,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225443853] [2025-03-09 01:46:38,276 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:46:38,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:46:38,281 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 125 statements into 8 equivalence classes. [2025-03-09 01:46:38,282 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 125 statements. [2025-03-09 01:46:38,283 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:46:38,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:46:38,319 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2025-03-09 01:46:38,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:46:38,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225443853] [2025-03-09 01:46:38,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225443853] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:46:38,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419228957] [2025-03-09 01:46:38,320 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:46:38,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:46:38,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:46:38,322 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:46:38,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-09 01:46:38,349 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 125 statements into 8 equivalence classes. [2025-03-09 01:46:38,353 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 125 statements. [2025-03-09 01:46:38,353 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:46:38,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:46:38,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:46:38,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:46:38,456 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2025-03-09 01:46:38,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:46:38,608 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2025-03-09 01:46:38,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419228957] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:46:38,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:46:38,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-09 01:46:38,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399446303] [2025-03-09 01:46:38,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:46:38,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:46:38,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:46:38,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:46:38,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:46:38,610 INFO L87 Difference]: Start difference. First operand 595 states and 738 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 6 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-09 01:46:38,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:46:38,725 INFO L93 Difference]: Finished difference Result 598 states and 738 transitions. [2025-03-09 01:46:38,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:46:38,726 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 6 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 125 [2025-03-09 01:46:38,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:46:38,728 INFO L225 Difference]: With dead ends: 598 [2025-03-09 01:46:38,728 INFO L226 Difference]: Without dead ends: 597 [2025-03-09 01:46:38,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 244 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:46:38,729 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 36 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:46:38,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 292 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:46:38,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-03-09 01:46:38,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 595. [2025-03-09 01:46:38,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 470 states have (on average 1.1617021276595745) internal successors, (546), 469 states have internal predecessors, (546), 79 states have call successors, (79), 31 states have call predecessors, (79), 38 states have return successors, (111), 94 states have call predecessors, (111), 79 states have call successors, (111) [2025-03-09 01:46:38,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 736 transitions. [2025-03-09 01:46:38,755 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 736 transitions. Word has length 125 [2025-03-09 01:46:38,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:46:38,755 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 736 transitions. [2025-03-09 01:46:38,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 6 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-09 01:46:38,756 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 736 transitions. [2025-03-09 01:46:38,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-09 01:46:38,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:46:38,766 INFO L218 NwaCegarLoop]: trace histogram [14, 11, 7, 7, 7, 7, 7, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:46:38,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-09 01:46:38,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-09 01:46:38,966 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:46:38,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:46:38,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1770082695, now seen corresponding path program 1 times [2025-03-09 01:46:38,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:46:38,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378855787] [2025-03-09 01:46:38,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:46:38,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:46:38,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-09 01:46:38,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-09 01:46:38,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:46:38,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:46:39,167 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 97 proven. 46 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2025-03-09 01:46:39,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:46:39,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378855787] [2025-03-09 01:46:39,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378855787] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:46:39,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222908858] [2025-03-09 01:46:39,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:46:39,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:46:39,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:46:39,170 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:46:39,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-09 01:46:39,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-09 01:46:39,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-09 01:46:39,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:46:39,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:46:39,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:46:39,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:46:39,290 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 241 proven. 10 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2025-03-09 01:46:39,290 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:46:39,497 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 97 proven. 46 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2025-03-09 01:46:39,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222908858] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:46:39,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:46:39,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 15 [2025-03-09 01:46:39,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689425713] [2025-03-09 01:46:39,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:46:39,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 01:46:39,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:46:39,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 01:46:39,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-09 01:46:39,498 INFO L87 Difference]: Start difference. First operand 595 states and 736 transitions. Second operand has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 11 states have internal predecessors, (60), 8 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-09 01:46:39,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:46:39,780 INFO L93 Difference]: Finished difference Result 1218 states and 1522 transitions. [2025-03-09 01:46:39,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 01:46:39,780 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 11 states have internal predecessors, (60), 8 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 140 [2025-03-09 01:46:39,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:46:39,783 INFO L225 Difference]: With dead ends: 1218 [2025-03-09 01:46:39,783 INFO L226 Difference]: Without dead ends: 693 [2025-03-09 01:46:39,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 269 SyntacticMatches, 12 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2025-03-09 01:46:39,786 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 59 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:46:39,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 533 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:46:39,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2025-03-09 01:46:39,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 688. [2025-03-09 01:46:39,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 542 states have (on average 1.1586715867158672) internal successors, (628), 539 states have internal predecessors, (628), 93 states have call successors, (93), 38 states have call predecessors, (93), 45 states have return successors, (127), 110 states have call predecessors, (127), 93 states have call successors, (127) [2025-03-09 01:46:39,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 848 transitions. [2025-03-09 01:46:39,832 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 848 transitions. Word has length 140 [2025-03-09 01:46:39,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:46:39,833 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 848 transitions. [2025-03-09 01:46:39,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 11 states have internal predecessors, (60), 8 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-09 01:46:39,833 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 848 transitions. [2025-03-09 01:46:39,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-09 01:46:39,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:46:39,834 INFO L218 NwaCegarLoop]: trace histogram [14, 11, 7, 7, 7, 7, 7, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:46:39,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-09 01:46:40,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-09 01:46:40,035 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:46:40,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:46:40,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1245914697, now seen corresponding path program 1 times [2025-03-09 01:46:40,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:46:40,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854563592] [2025-03-09 01:46:40,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:46:40,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:46:40,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-09 01:46:40,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-09 01:46:40,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:46:40,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:46:40,173 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 94 proven. 43 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2025-03-09 01:46:40,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:46:40,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854563592] [2025-03-09 01:46:40,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854563592] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:46:40,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165458854] [2025-03-09 01:46:40,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:46:40,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:46:40,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:46:40,175 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:46:40,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-09 01:46:40,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-09 01:46:40,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-09 01:46:40,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:46:40,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:46:40,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:46:40,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:46:40,280 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 226 proven. 7 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-03-09 01:46:40,280 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:46:40,473 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 94 proven. 43 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2025-03-09 01:46:40,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165458854] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:46:40,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:46:40,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 11 [2025-03-09 01:46:40,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554447132] [2025-03-09 01:46:40,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:46:40,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:46:40,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:46:40,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:46:40,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:46:40,474 INFO L87 Difference]: Start difference. First operand 688 states and 848 transitions. Second operand has 11 states, 10 states have (on average 5.6) internal successors, (56), 8 states have internal predecessors, (56), 6 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-09 01:46:40,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:46:40,685 INFO L93 Difference]: Finished difference Result 1244 states and 1552 transitions. [2025-03-09 01:46:40,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:46:40,686 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 8 states have internal predecessors, (56), 6 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 144 [2025-03-09 01:46:40,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:46:40,689 INFO L225 Difference]: With dead ends: 1244 [2025-03-09 01:46:40,689 INFO L226 Difference]: Without dead ends: 722 [2025-03-09 01:46:40,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 281 SyntacticMatches, 8 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:46:40,692 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 50 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:46:40,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 398 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:46:40,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2025-03-09 01:46:40,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 669. [2025-03-09 01:46:40,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 526 states have (on average 1.1577946768060836) internal successors, (609), 524 states have internal predecessors, (609), 92 states have call successors, (92), 38 states have call predecessors, (92), 43 states have return successors, (122), 106 states have call predecessors, (122), 92 states have call successors, (122) [2025-03-09 01:46:40,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 823 transitions. [2025-03-09 01:46:40,722 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 823 transitions. Word has length 144 [2025-03-09 01:46:40,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:46:40,723 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 823 transitions. [2025-03-09 01:46:40,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 8 states have internal predecessors, (56), 6 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-09 01:46:40,723 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 823 transitions. [2025-03-09 01:46:40,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-09 01:46:40,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:46:40,724 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:46:40,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-09 01:46:40,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:46:40,925 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting binomialCoefficientErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:46:40,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:46:40,925 INFO L85 PathProgramCache]: Analyzing trace with hash -68536893, now seen corresponding path program 1 times [2025-03-09 01:46:40,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:46:40,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598552778] [2025-03-09 01:46:40,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:46:40,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:46:40,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-09 01:46:40,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-09 01:46:40,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:46:40,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:46:41,062 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2025-03-09 01:46:41,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:46:41,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598552778] [2025-03-09 01:46:41,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598552778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:46:41,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:46:41,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:46:41,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828340631] [2025-03-09 01:46:41,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:46:41,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:46:41,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:46:41,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:46:41,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:46:41,063 INFO L87 Difference]: Start difference. First operand 669 states and 823 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-09 01:46:41,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:46:41,265 INFO L93 Difference]: Finished difference Result 1177 states and 1459 transitions. [2025-03-09 01:46:41,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:46:41,266 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 134 [2025-03-09 01:46:41,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:46:41,268 INFO L225 Difference]: With dead ends: 1177 [2025-03-09 01:46:41,269 INFO L226 Difference]: Without dead ends: 680 [2025-03-09 01:46:41,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:46:41,270 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 39 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:46:41,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 353 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:46:41,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2025-03-09 01:46:41,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 669. [2025-03-09 01:46:41,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 526 states have (on average 1.1577946768060836) internal successors, (609), 524 states have internal predecessors, (609), 92 states have call successors, (92), 38 states have call predecessors, (92), 43 states have return successors, (120), 106 states have call predecessors, (120), 92 states have call successors, (120) [2025-03-09 01:46:41,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 821 transitions. [2025-03-09 01:46:41,297 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 821 transitions. Word has length 134 [2025-03-09 01:46:41,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:46:41,297 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 821 transitions. [2025-03-09 01:46:41,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-09 01:46:41,297 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 821 transitions. [2025-03-09 01:46:41,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-09 01:46:41,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:46:41,298 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 9, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:46:41,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-09 01:46:41,298 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting binomialCoefficientErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:46:41,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:46:41,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1424539761, now seen corresponding path program 1 times [2025-03-09 01:46:41,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:46:41,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86650326] [2025-03-09 01:46:41,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:46:41,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:46:41,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-09 01:46:41,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-09 01:46:41,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:46:41,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:46:41,444 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 94 proven. 26 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2025-03-09 01:46:41,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:46:41,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86650326] [2025-03-09 01:46:41,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86650326] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:46:41,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263891085] [2025-03-09 01:46:41,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:46:41,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:46:41,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:46:41,446 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:46:41,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-09 01:46:41,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-09 01:46:41,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-09 01:46:41,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:46:41,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:46:41,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:46:41,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:46:41,545 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 232 proven. 2 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2025-03-09 01:46:41,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:46:41,791 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 94 proven. 27 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-09 01:46:41,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263891085] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:46:41,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:46:41,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 14 [2025-03-09 01:46:41,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681861421] [2025-03-09 01:46:41,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:46:41,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:46:41,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:46:41,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:46:41,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:46:41,793 INFO L87 Difference]: Start difference. First operand 669 states and 821 transitions. Second operand has 14 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 8 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-09 01:46:42,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:46:42,046 INFO L93 Difference]: Finished difference Result 1306 states and 1638 transitions. [2025-03-09 01:46:42,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:46:42,048 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 8 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) Word has length 140 [2025-03-09 01:46:42,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:46:42,051 INFO L225 Difference]: With dead ends: 1306 [2025-03-09 01:46:42,051 INFO L226 Difference]: Without dead ends: 693 [2025-03-09 01:46:42,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 271 SyntacticMatches, 9 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:46:42,055 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 41 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:46:42,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 509 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:46:42,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2025-03-09 01:46:42,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 669. [2025-03-09 01:46:42,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 526 states have (on average 1.1520912547528517) internal successors, (606), 524 states have internal predecessors, (606), 92 states have call successors, (92), 38 states have call predecessors, (92), 43 states have return successors, (118), 106 states have call predecessors, (118), 92 states have call successors, (118) [2025-03-09 01:46:42,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 816 transitions. [2025-03-09 01:46:42,085 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 816 transitions. Word has length 140 [2025-03-09 01:46:42,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:46:42,087 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 816 transitions. [2025-03-09 01:46:42,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 8 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-09 01:46:42,087 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 816 transitions. [2025-03-09 01:46:42,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-09 01:46:42,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:46:42,088 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 9, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:46:42,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-03-09 01:46:42,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:46:42,289 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting binomialCoefficientErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:46:42,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:46:42,291 INFO L85 PathProgramCache]: Analyzing trace with hash -145569857, now seen corresponding path program 2 times [2025-03-09 01:46:42,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:46:42,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226729842] [2025-03-09 01:46:42,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:46:42,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:46:42,297 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 144 statements into 2 equivalence classes. [2025-03-09 01:46:42,306 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 144 of 144 statements. [2025-03-09 01:46:42,306 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:46:42,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 01:46:42,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1274224006] [2025-03-09 01:46:42,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:46:42,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:46:42,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:46:42,309 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:46:42,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-09 01:46:42,338 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 144 statements into 2 equivalence classes. [2025-03-09 01:46:42,366 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 144 of 144 statements. [2025-03-09 01:46:42,366 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:46:42,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:46:42,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-09 01:46:42,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:46:42,648 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 148 proven. 25 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2025-03-09 01:46:42,649 INFO L312 TraceCheckSpWp]: Computing backward predicates...