./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 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 10:11:25,645 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 10:11:25,711 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-19 10:11:25,716 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 10:11:25,718 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 10:11:25,745 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 10:11:25,746 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 10:11:25,747 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 10:11:25,747 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 10:11:25,747 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 10:11:25,748 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 10:11:25,748 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 10:11:25,749 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 10:11:25,749 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 10:11:25,749 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 10:11:25,750 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 10:11:25,750 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 10:11:25,751 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 10:11:25,751 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 10:11:25,751 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 10:11:25,752 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 10:11:25,752 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 10:11:25,752 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 10:11:25,753 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 10:11:25,753 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 10:11:25,754 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 10:11:25,754 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 10:11:25,754 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 10:11:25,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 10:11:25,755 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 10:11:25,755 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 10:11:25,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:11:25,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 10:11:25,756 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 10:11:25,756 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 10:11:25,757 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 10:11:25,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 10:11:25,757 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 10:11:25,757 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 10:11:25,758 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 10:11:25,758 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 10:11:25,758 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 [2024-11-19 10:11:26,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 10:11:26,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 10:11:26,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 10:11:26,085 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 10:11:26,086 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 10:11:26,088 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/Binomial.c [2024-11-19 10:11:27,556 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 10:11:27,739 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 10:11:27,740 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Binomial.c [2024-11-19 10:11:27,749 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58e1f56b8/d457d863a944421c9fd84c1d2eceaf1f/FLAGc16b8e0c2 [2024-11-19 10:11:28,140 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58e1f56b8/d457d863a944421c9fd84c1d2eceaf1f [2024-11-19 10:11:28,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 10:11:28,146 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 10:11:28,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 10:11:28,148 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 10:11:28,153 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 10:11:28,154 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:11:28" (1/1) ... [2024-11-19 10:11:28,155 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9fe2df3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:28, skipping insertion in model container [2024-11-19 10:11:28,155 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:11:28" (1/1) ... [2024-11-19 10:11:28,172 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 10:11:28,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:11:28,361 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 10:11:28,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:11:28,386 INFO L204 MainTranslator]: Completed translation [2024-11-19 10:11:28,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:28 WrapperNode [2024-11-19 10:11:28,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 10:11:28,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 10:11:28,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 10:11:28,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 10:11:28,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:28" (1/1) ... [2024-11-19 10:11:28,399 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:28" (1/1) ... [2024-11-19 10:11:28,417 INFO L138 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2024-11-19 10:11:28,417 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 10:11:28,418 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 10:11:28,418 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 10:11:28,418 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 10:11:28,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:28" (1/1) ... [2024-11-19 10:11:28,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:28" (1/1) ... [2024-11-19 10:11:28,432 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:28" (1/1) ... [2024-11-19 10:11:28,447 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-19 10:11:28,447 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:28" (1/1) ... [2024-11-19 10:11:28,448 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:28" (1/1) ... [2024-11-19 10:11:28,450 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:28" (1/1) ... [2024-11-19 10:11:28,457 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:28" (1/1) ... [2024-11-19 10:11:28,458 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:28" (1/1) ... [2024-11-19 10:11:28,459 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:28" (1/1) ... [2024-11-19 10:11:28,463 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 10:11:28,464 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 10:11:28,464 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 10:11:28,464 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 10:11:28,465 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:28" (1/1) ... [2024-11-19 10:11:28,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:11:28,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:11:28,510 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) [2024-11-19 10:11:28,513 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 [2024-11-19 10:11:28,559 INFO L130 BoogieDeclarations]: Found specification of procedure fact [2024-11-19 10:11:28,560 INFO L138 BoogieDeclarations]: Found implementation of procedure fact [2024-11-19 10:11:28,560 INFO L130 BoogieDeclarations]: Found specification of procedure binomialCoefficient [2024-11-19 10:11:28,560 INFO L138 BoogieDeclarations]: Found implementation of procedure binomialCoefficient [2024-11-19 10:11:28,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 10:11:28,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 10:11:28,619 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 10:11:28,621 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 10:11:28,872 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-11-19 10:11:28,872 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 10:11:28,896 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 10:11:28,896 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 10:11:28,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:11:28 BoogieIcfgContainer [2024-11-19 10:11:28,897 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 10:11:28,900 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 10:11:28,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 10:11:28,903 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 10:11:28,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:11:28" (1/3) ... [2024-11-19 10:11:28,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb5f29a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:11:28, skipping insertion in model container [2024-11-19 10:11:28,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:28" (2/3) ... [2024-11-19 10:11:28,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb5f29a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:11:28, skipping insertion in model container [2024-11-19 10:11:28,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:11:28" (3/3) ... [2024-11-19 10:11:28,907 INFO L112 eAbstractionObserver]: Analyzing ICFG Binomial.c [2024-11-19 10:11:28,922 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 10:11:28,922 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-11-19 10:11:28,974 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 10:11:28,981 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;@3c4eb720, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 10:11:28,982 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-19 10:11:28,986 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 52 states have internal predecessors, (60), 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) [2024-11-19 10:11:28,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 10:11:28,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:28,993 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:11:28,993 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:11:28,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:28,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1898283155, now seen corresponding path program 1 times [2024-11-19 10:11:29,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:29,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611776867] [2024-11-19 10:11:29,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:29,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:29,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:11:29,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:29,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611776867] [2024-11-19 10:11:29,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611776867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:11:29,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:11:29,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:11:29,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433925340] [2024-11-19 10:11:29,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:11:29,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 10:11:29,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:29,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 10:11:29,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 10:11:29,186 INFO L87 Difference]: Start difference. First operand has 61 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 52 states have internal predecessors, (60), 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 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2024-11-19 10:11:29,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:29,218 INFO L93 Difference]: Finished difference Result 118 states and 138 transitions. [2024-11-19 10:11:29,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 10:11:29,220 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2024-11-19 10:11:29,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:29,227 INFO L225 Difference]: With dead ends: 118 [2024-11-19 10:11:29,228 INFO L226 Difference]: Without dead ends: 57 [2024-11-19 10:11:29,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 10:11:29,237 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:11:29,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:11:29,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-19 10:11:29,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-19 10:11:29,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 48 states have internal predecessors, (52), 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) [2024-11-19 10:11:29,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2024-11-19 10:11:29,285 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 9 [2024-11-19 10:11:29,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:29,286 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2024-11-19 10:11:29,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2024-11-19 10:11:29,286 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2024-11-19 10:11:29,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 10:11:29,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:29,287 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:11:29,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 10:11:29,288 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:11:29,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:29,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1897717126, now seen corresponding path program 1 times [2024-11-19 10:11:29,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:29,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427112072] [2024-11-19 10:11:29,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:29,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:29,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:11:29,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:29,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427112072] [2024-11-19 10:11:29,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427112072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:11:29,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:11:29,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:11:29,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082561982] [2024-11-19 10:11:29,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:11:29,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:11:29,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:29,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:11:29,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:11:29,374 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) [2024-11-19 10:11:29,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:29,456 INFO L93 Difference]: Finished difference Result 111 states and 126 transitions. [2024-11-19 10:11:29,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:11:29,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2024-11-19 10:11:29,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:29,458 INFO L225 Difference]: With dead ends: 111 [2024-11-19 10:11:29,458 INFO L226 Difference]: Without dead ends: 58 [2024-11-19 10:11:29,459 INFO L431 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 [2024-11-19 10:11:29,461 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 24 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:11:29,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 149 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:11:29,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-19 10:11:29,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-19 10:11:29,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 49 states have internal predecessors, (53), 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) [2024-11-19 10:11:29,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2024-11-19 10:11:29,476 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 9 [2024-11-19 10:11:29,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:29,476 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2024-11-19 10:11:29,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) [2024-11-19 10:11:29,477 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2024-11-19 10:11:29,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 10:11:29,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:29,477 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:11:29,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 10:11:29,478 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:11:29,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:29,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1419301016, now seen corresponding path program 1 times [2024-11-19 10:11:29,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:29,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803422549] [2024-11-19 10:11:29,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:29,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:29,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:11:29,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:29,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803422549] [2024-11-19 10:11:29,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803422549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:11:29,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:11:29,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:11:29,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596908609] [2024-11-19 10:11:29,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:11:29,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:11:29,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:29,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:11:29,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:11:29,542 INFO L87 Difference]: Start difference. First operand 58 states and 65 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) [2024-11-19 10:11:29,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:29,575 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2024-11-19 10:11:29,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:11:29,576 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 [2024-11-19 10:11:29,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:29,577 INFO L225 Difference]: With dead ends: 58 [2024-11-19 10:11:29,577 INFO L226 Difference]: Without dead ends: 57 [2024-11-19 10:11:29,578 INFO L431 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 [2024-11-19 10:11:29,579 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 4 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 107 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 [2024-11-19 10:11:29,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 107 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:11:29,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-19 10:11:29,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-19 10:11:29,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 48 states have internal predecessors, (52), 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) [2024-11-19 10:11:29,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2024-11-19 10:11:29,594 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 13 [2024-11-19 10:11:29,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:29,596 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2024-11-19 10:11:29,597 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) [2024-11-19 10:11:29,597 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2024-11-19 10:11:29,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 10:11:29,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:29,599 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:11:29,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 10:11:29,600 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:11:29,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:29,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1048658574, now seen corresponding path program 1 times [2024-11-19 10:11:29,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:29,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370587442] [2024-11-19 10:11:29,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:29,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:29,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:11:29,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:29,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370587442] [2024-11-19 10:11:29,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370587442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:11:29,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:11:29,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 10:11:29,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766658804] [2024-11-19 10:11:29,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:11:29,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 10:11:29,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:29,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 10:11:29,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:11:29,742 INFO L87 Difference]: Start difference. First operand 57 states and 64 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) [2024-11-19 10:11:29,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:29,897 INFO L93 Difference]: Finished difference Result 150 states and 172 transitions. [2024-11-19 10:11:29,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 10:11:29,897 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 [2024-11-19 10:11:29,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:29,899 INFO L225 Difference]: With dead ends: 150 [2024-11-19 10:11:29,899 INFO L226 Difference]: Without dead ends: 97 [2024-11-19 10:11:29,899 INFO L431 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 [2024-11-19 10:11:29,901 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 44 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 335 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 [2024-11-19 10:11:29,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 335 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:11:29,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-19 10:11:29,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2024-11-19 10:11:29,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 71 states have internal predecessors, (85), 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) [2024-11-19 10:11:29,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 107 transitions. [2024-11-19 10:11:29,920 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 107 transitions. Word has length 14 [2024-11-19 10:11:29,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:29,920 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 107 transitions. [2024-11-19 10:11:29,920 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) [2024-11-19 10:11:29,920 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 107 transitions. [2024-11-19 10:11:29,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 10:11:29,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:29,921 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:11:29,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 10:11:29,921 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:11:29,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:29,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1204972684, now seen corresponding path program 1 times [2024-11-19 10:11:29,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:29,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843772365] [2024-11-19 10:11:29,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:29,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:29,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:11:29,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:29,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843772365] [2024-11-19 10:11:29,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843772365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:11:29,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:11:29,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:11:29,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761102710] [2024-11-19 10:11:29,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:11:29,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:11:29,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:29,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:11:29,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:11:29,961 INFO L87 Difference]: Start difference. First operand 87 states and 107 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) [2024-11-19 10:11:30,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:30,018 INFO L93 Difference]: Finished difference Result 175 states and 214 transitions. [2024-11-19 10:11:30,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:11:30,018 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 [2024-11-19 10:11:30,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:30,019 INFO L225 Difference]: With dead ends: 175 [2024-11-19 10:11:30,019 INFO L226 Difference]: Without dead ends: 94 [2024-11-19 10:11:30,020 INFO L431 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 [2024-11-19 10:11:30,021 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 19 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:11:30,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 163 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:11:30,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-19 10:11:30,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2024-11-19 10:11:30,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 72 states have internal predecessors, (86), 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) [2024-11-19 10:11:30,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2024-11-19 10:11:30,032 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 14 [2024-11-19 10:11:30,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:30,032 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2024-11-19 10:11:30,032 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) [2024-11-19 10:11:30,033 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2024-11-19 10:11:30,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 10:11:30,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:30,033 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:11:30,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 10:11:30,034 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:11:30,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:30,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1152590759, now seen corresponding path program 1 times [2024-11-19 10:11:30,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:30,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603607794] [2024-11-19 10:11:30,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:30,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:30,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:11:30,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:30,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603607794] [2024-11-19 10:11:30,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603607794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:11:30,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:11:30,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 10:11:30,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498781652] [2024-11-19 10:11:30,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:11:30,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 10:11:30,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:30,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 10:11:30,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:11:30,176 INFO L87 Difference]: Start difference. First operand 88 states and 108 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) [2024-11-19 10:11:30,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:30,338 INFO L93 Difference]: Finished difference Result 218 states and 276 transitions. [2024-11-19 10:11:30,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 10:11:30,339 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 [2024-11-19 10:11:30,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:30,343 INFO L225 Difference]: With dead ends: 218 [2024-11-19 10:11:30,344 INFO L226 Difference]: Without dead ends: 137 [2024-11-19 10:11:30,345 INFO L431 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 [2024-11-19 10:11:30,348 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 36 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:11:30,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 322 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:11:30,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-19 10:11:30,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 125. [2024-11-19 10:11:30,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 100 states have internal predecessors, (125), 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) [2024-11-19 10:11:30,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 163 transitions. [2024-11-19 10:11:30,369 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 163 transitions. Word has length 20 [2024-11-19 10:11:30,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:30,369 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 163 transitions. [2024-11-19 10:11:30,370 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) [2024-11-19 10:11:30,370 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 163 transitions. [2024-11-19 10:11:30,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 10:11:30,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:30,372 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:11:30,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 10:11:30,372 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting binomialCoefficientErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:11:30,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:30,373 INFO L85 PathProgramCache]: Analyzing trace with hash 461279503, now seen corresponding path program 1 times [2024-11-19 10:11:30,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:30,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084112841] [2024-11-19 10:11:30,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:30,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:30,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 10:11:30,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:30,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084112841] [2024-11-19 10:11:30,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084112841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:11:30,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:11:30,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 10:11:30,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814996055] [2024-11-19 10:11:30,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:11:30,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:11:30,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:30,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:11:30,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:11:30,469 INFO L87 Difference]: Start difference. First operand 125 states and 163 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) [2024-11-19 10:11:30,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:30,561 INFO L93 Difference]: Finished difference Result 152 states and 190 transitions. [2024-11-19 10:11:30,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 10:11:30,563 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 [2024-11-19 10:11:30,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:30,566 INFO L225 Difference]: With dead ends: 152 [2024-11-19 10:11:30,566 INFO L226 Difference]: Without dead ends: 151 [2024-11-19 10:11:30,566 INFO L431 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 [2024-11-19 10:11:30,567 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 46 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:11:30,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 259 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:11:30,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-19 10:11:30,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 140. [2024-11-19 10:11:30,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 97 states have (on average 1.422680412371134) internal successors, (138), 111 states have internal predecessors, (138), 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) [2024-11-19 10:11:30,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 182 transitions. [2024-11-19 10:11:30,582 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 182 transitions. Word has length 22 [2024-11-19 10:11:30,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:30,583 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 182 transitions. [2024-11-19 10:11:30,583 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) [2024-11-19 10:11:30,583 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 182 transitions. [2024-11-19 10:11:30,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 10:11:30,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:30,584 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:11:30,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 10:11:30,584 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting binomialCoefficientErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:11:30,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:30,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1414762759, now seen corresponding path program 1 times [2024-11-19 10:11:30,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:30,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679265842] [2024-11-19 10:11:30,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:30,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:30,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 10:11:30,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:30,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679265842] [2024-11-19 10:11:30,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679265842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:11:30,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:11:30,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 10:11:30,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602712395] [2024-11-19 10:11:30,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:11:30,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:11:30,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:30,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:11:30,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:11:30,667 INFO L87 Difference]: Start difference. First operand 140 states and 182 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) [2024-11-19 10:11:30,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:30,760 INFO L93 Difference]: Finished difference Result 152 states and 187 transitions. [2024-11-19 10:11:30,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 10:11:30,760 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 [2024-11-19 10:11:30,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:30,762 INFO L225 Difference]: With dead ends: 152 [2024-11-19 10:11:30,762 INFO L226 Difference]: Without dead ends: 151 [2024-11-19 10:11:30,762 INFO L431 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 [2024-11-19 10:11:30,763 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 46 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:11:30,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 256 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:11:30,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-19 10:11:30,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 140. [2024-11-19 10:11:30,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 97 states have (on average 1.4123711340206186) internal successors, (137), 111 states have internal predecessors, (137), 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) [2024-11-19 10:11:30,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 181 transitions. [2024-11-19 10:11:30,794 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 181 transitions. Word has length 23 [2024-11-19 10:11:30,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:30,794 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 181 transitions. [2024-11-19 10:11:30,794 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) [2024-11-19 10:11:30,794 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 181 transitions. [2024-11-19 10:11:30,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 10:11:30,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:30,795 INFO L215 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] [2024-11-19 10:11:30,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 10:11:30,795 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:11:30,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:30,796 INFO L85 PathProgramCache]: Analyzing trace with hash -376350556, now seen corresponding path program 1 times [2024-11-19 10:11:30,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:30,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133855813] [2024-11-19 10:11:30,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:30,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:30,919 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 10:11:30,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:30,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133855813] [2024-11-19 10:11:30,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133855813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:11:30,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:11:30,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 10:11:30,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78141306] [2024-11-19 10:11:30,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:11:30,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 10:11:30,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:30,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 10:11:30,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:11:30,921 INFO L87 Difference]: Start difference. First operand 140 states and 181 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) [2024-11-19 10:11:31,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:31,053 INFO L93 Difference]: Finished difference Result 279 states and 353 transitions. [2024-11-19 10:11:31,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 10:11:31,054 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 [2024-11-19 10:11:31,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:31,055 INFO L225 Difference]: With dead ends: 279 [2024-11-19 10:11:31,055 INFO L226 Difference]: Without dead ends: 155 [2024-11-19 10:11:31,056 INFO L431 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 [2024-11-19 10:11:31,056 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 47 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:11:31,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 357 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:11:31,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-19 10:11:31,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 144. [2024-11-19 10:11:31,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 100 states have (on average 1.4) internal successors, (140), 114 states have internal predecessors, (140), 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) [2024-11-19 10:11:31,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 184 transitions. [2024-11-19 10:11:31,076 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 184 transitions. Word has length 28 [2024-11-19 10:11:31,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:31,076 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 184 transitions. [2024-11-19 10:11:31,077 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) [2024-11-19 10:11:31,077 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 184 transitions. [2024-11-19 10:11:31,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 10:11:31,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:31,077 INFO L215 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] [2024-11-19 10:11:31,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 10:11:31,078 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting binomialCoefficientErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:11:31,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:31,078 INFO L85 PathProgramCache]: Analyzing trace with hash -896192804, now seen corresponding path program 1 times [2024-11-19 10:11:31,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:31,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185539519] [2024-11-19 10:11:31,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:31,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 10:11:31,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2134367772] [2024-11-19 10:11:31,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:31,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:11:31,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:11:31,095 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) [2024-11-19 10:11:31,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 10:11:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:31,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:11:31,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:11:31,219 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 10:11:31,220 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:11:31,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:31,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185539519] [2024-11-19 10:11:31,221 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 10:11:31,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134367772] [2024-11-19 10:11:31,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134367772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:11:31,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:11:31,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:11:31,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4005515] [2024-11-19 10:11:31,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:11:31,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:11:31,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:31,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:11:31,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:11:31,222 INFO L87 Difference]: Start difference. First operand 144 states and 184 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) [2024-11-19 10:11:31,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:31,277 INFO L93 Difference]: Finished difference Result 196 states and 281 transitions. [2024-11-19 10:11:31,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:11:31,278 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 [2024-11-19 10:11:31,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:31,279 INFO L225 Difference]: With dead ends: 196 [2024-11-19 10:11:31,280 INFO L226 Difference]: Without dead ends: 195 [2024-11-19 10:11:31,280 INFO L431 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 [2024-11-19 10:11:31,280 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 12 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:11:31,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 162 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:11:31,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-19 10:11:31,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 166. [2024-11-19 10:11:31,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 118 states have (on average 1.3644067796610169) internal successors, (161), 129 states have internal predecessors, (161), 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) [2024-11-19 10:11:31,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 225 transitions. [2024-11-19 10:11:31,305 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 225 transitions. Word has length 30 [2024-11-19 10:11:31,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:31,305 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 225 transitions. [2024-11-19 10:11:31,305 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) [2024-11-19 10:11:31,305 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 225 transitions. [2024-11-19 10:11:31,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 10:11:31,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:31,306 INFO L215 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] [2024-11-19 10:11:31,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 10:11:31,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-19 10:11:31,513 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting binomialCoefficientErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:11:31,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:31,514 INFO L85 PathProgramCache]: Analyzing trace with hash -2012173088, now seen corresponding path program 1 times [2024-11-19 10:11:31,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:31,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861915296] [2024-11-19 10:11:31,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:31,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 10:11:31,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1062811119] [2024-11-19 10:11:31,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:31,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:11:31,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:11:31,524 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) [2024-11-19 10:11:31,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 10:11:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:31,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 10:11:31,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:11:31,630 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 10:11:31,630 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:11:31,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:31,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861915296] [2024-11-19 10:11:31,786 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 10:11:31,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062811119] [2024-11-19 10:11:31,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062811119] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:11:31,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:11:31,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2024-11-19 10:11:31,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508971511] [2024-11-19 10:11:31,787 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-19 10:11:31,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:11:31,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:31,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:11:31,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:11:31,788 INFO L87 Difference]: Start difference. First operand 166 states and 225 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) [2024-11-19 10:11:31,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:31,838 INFO L93 Difference]: Finished difference Result 196 states and 276 transitions. [2024-11-19 10:11:31,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:11:31,838 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 [2024-11-19 10:11:31,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:31,840 INFO L225 Difference]: With dead ends: 196 [2024-11-19 10:11:31,840 INFO L226 Difference]: Without dead ends: 195 [2024-11-19 10:11:31,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:11:31,841 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 10 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:11:31,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 213 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:11:31,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-19 10:11:31,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 170. [2024-11-19 10:11:31,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 122 states have (on average 1.3442622950819672) internal successors, (164), 133 states have internal predecessors, (164), 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) [2024-11-19 10:11:31,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 228 transitions. [2024-11-19 10:11:31,854 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 228 transitions. Word has length 31 [2024-11-19 10:11:31,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:31,854 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 228 transitions. [2024-11-19 10:11:31,854 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) [2024-11-19 10:11:31,855 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 228 transitions. [2024-11-19 10:11:31,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 10:11:31,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:31,855 INFO L215 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] [2024-11-19 10:11:31,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 10:11:32,059 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,SelfDestructingSolverStorable10 [2024-11-19 10:11:32,060 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting binomialCoefficientErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:11:32,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:32,060 INFO L85 PathProgramCache]: Analyzing trace with hash 2047143774, now seen corresponding path program 1 times [2024-11-19 10:11:32,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:32,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070799543] [2024-11-19 10:11:32,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:32,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 10:11:32,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [660061920] [2024-11-19 10:11:32,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:32,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:11:32,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:11:32,080 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) [2024-11-19 10:11:32,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 10:11:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:32,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 10:11:32,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:11:32,234 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 10:11:32,234 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:11:32,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:32,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070799543] [2024-11-19 10:11:32,235 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 10:11:32,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660061920] [2024-11-19 10:11:32,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660061920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:11:32,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:11:32,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 10:11:32,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695604002] [2024-11-19 10:11:32,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:11:32,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:11:32,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:32,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:11:32,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:11:32,237 INFO L87 Difference]: Start difference. First operand 170 states and 228 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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) [2024-11-19 10:11:32,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:32,319 INFO L93 Difference]: Finished difference Result 251 states and 355 transitions. [2024-11-19 10:11:32,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:11:32,320 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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 [2024-11-19 10:11:32,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:32,322 INFO L225 Difference]: With dead ends: 251 [2024-11-19 10:11:32,322 INFO L226 Difference]: Without dead ends: 249 [2024-11-19 10:11:32,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:11:32,323 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 20 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:11:32,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 269 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:11:32,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-19 10:11:32,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 205. [2024-11-19 10:11:32,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 151 states have (on average 1.2913907284768211) internal successors, (195), 159 states have internal predecessors, (195), 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) [2024-11-19 10:11:32,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 276 transitions. [2024-11-19 10:11:32,338 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 276 transitions. Word has length 32 [2024-11-19 10:11:32,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:32,338 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 276 transitions. [2024-11-19 10:11:32,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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) [2024-11-19 10:11:32,339 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 276 transitions. [2024-11-19 10:11:32,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-19 10:11:32,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:32,340 INFO L215 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] [2024-11-19 10:11:32,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 10:11:32,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:11:32,545 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:11:32,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:32,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1243028580, now seen corresponding path program 1 times [2024-11-19 10:11:32,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:32,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492976013] [2024-11-19 10:11:32,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:32,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:32,607 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 10:11:32,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:32,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492976013] [2024-11-19 10:11:32,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492976013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:11:32,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:11:32,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:11:32,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204844263] [2024-11-19 10:11:32,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:11:32,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:11:32,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:32,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:11:32,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:11:32,611 INFO L87 Difference]: Start difference. First operand 205 states and 276 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) [2024-11-19 10:11:32,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:32,639 INFO L93 Difference]: Finished difference Result 205 states and 276 transitions. [2024-11-19 10:11:32,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:11:32,641 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 [2024-11-19 10:11:32,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:32,643 INFO L225 Difference]: With dead ends: 205 [2024-11-19 10:11:32,643 INFO L226 Difference]: Without dead ends: 204 [2024-11-19 10:11:32,643 INFO L431 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 [2024-11-19 10:11:32,644 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 3 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:11:32,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 154 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:11:32,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-19 10:11:32,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-11-19 10:11:32,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 151 states have (on average 1.2781456953642385) internal successors, (193), 158 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) [2024-11-19 10:11:32,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 274 transitions. [2024-11-19 10:11:32,662 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 274 transitions. Word has length 38 [2024-11-19 10:11:32,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:32,662 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 274 transitions. [2024-11-19 10:11:32,662 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) [2024-11-19 10:11:32,663 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 274 transitions. [2024-11-19 10:11:32,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 10:11:32,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:32,663 INFO L215 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] [2024-11-19 10:11:32,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 10:11:32,664 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:11:32,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:32,664 INFO L85 PathProgramCache]: Analyzing trace with hash 120819793, now seen corresponding path program 1 times [2024-11-19 10:11:32,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:32,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74036921] [2024-11-19 10:11:32,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:32,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:32,725 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 10:11:32,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:32,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74036921] [2024-11-19 10:11:32,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74036921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:11:32,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:11:32,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:11:32,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228102401] [2024-11-19 10:11:32,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:11:32,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:11:32,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:32,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:11:32,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:11:32,728 INFO L87 Difference]: Start difference. First operand 204 states and 274 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) [2024-11-19 10:11:32,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:32,762 INFO L93 Difference]: Finished difference Result 215 states and 287 transitions. [2024-11-19 10:11:32,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:11:32,763 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 [2024-11-19 10:11:32,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:32,765 INFO L225 Difference]: With dead ends: 215 [2024-11-19 10:11:32,765 INFO L226 Difference]: Without dead ends: 214 [2024-11-19 10:11:32,765 INFO L431 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 [2024-11-19 10:11:32,765 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:11:32,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 171 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:11:32,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-19 10:11:32,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2024-11-19 10:11:32,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 160 states have (on average 1.2625) internal successors, (202), 165 states have internal predecessors, (202), 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) [2024-11-19 10:11:32,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 285 transitions. [2024-11-19 10:11:32,782 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 285 transitions. Word has length 39 [2024-11-19 10:11:32,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:32,783 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 285 transitions. [2024-11-19 10:11:32,783 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) [2024-11-19 10:11:32,783 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 285 transitions. [2024-11-19 10:11:32,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 10:11:32,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:32,786 INFO L215 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, 1] [2024-11-19 10:11:32,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 10:11:32,787 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:11:32,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:32,787 INFO L85 PathProgramCache]: Analyzing trace with hash 663521416, now seen corresponding path program 1 times [2024-11-19 10:11:32,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:32,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437978325] [2024-11-19 10:11:32,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:32,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:32,843 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-19 10:11:32,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:32,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437978325] [2024-11-19 10:11:32,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437978325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:11:32,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:11:32,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:11:32,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132288360] [2024-11-19 10:11:32,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:11:32,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:11:32,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:32,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:11:32,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:11:32,844 INFO L87 Difference]: Start difference. First operand 214 states and 285 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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) [2024-11-19 10:11:32,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:32,881 INFO L93 Difference]: Finished difference Result 214 states and 285 transitions. [2024-11-19 10:11:32,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:11:32,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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 43 [2024-11-19 10:11:32,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:32,883 INFO L225 Difference]: With dead ends: 214 [2024-11-19 10:11:32,883 INFO L226 Difference]: Without dead ends: 213 [2024-11-19 10:11:32,883 INFO L431 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 [2024-11-19 10:11:32,884 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 4 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 148 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 [2024-11-19 10:11:32,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 148 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:11:32,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-19 10:11:32,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2024-11-19 10:11:32,903 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) [2024-11-19 10:11:32,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2024-11-19 10:11:32,906 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 43 [2024-11-19 10:11:32,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:32,907 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2024-11-19 10:11:32,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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) [2024-11-19 10:11:32,908 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2024-11-19 10:11:32,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 10:11:32,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:32,909 INFO L215 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, 1, 1] [2024-11-19 10:11:32,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 10:11:32,909 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:11:32,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:32,910 INFO L85 PathProgramCache]: Analyzing trace with hash -905672465, now seen corresponding path program 1 times [2024-11-19 10:11:32,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:32,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334885170] [2024-11-19 10:11:32,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:32,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:32,971 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-19 10:11:32,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:32,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334885170] [2024-11-19 10:11:32,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334885170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:11:32,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:11:32,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:11:32,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675716970] [2024-11-19 10:11:32,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:11:32,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:11:32,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:32,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:11:32,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:11:32,973 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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) [2024-11-19 10:11:33,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:33,004 INFO L93 Difference]: Finished difference Result 219 states and 289 transitions. [2024-11-19 10:11:33,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:11:33,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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 44 [2024-11-19 10:11:33,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:33,006 INFO L225 Difference]: With dead ends: 219 [2024-11-19 10:11:33,006 INFO L226 Difference]: Without dead ends: 218 [2024-11-19 10:11:33,007 INFO L431 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 [2024-11-19 10:11:33,007 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 3 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 161 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 [2024-11-19 10:11:33,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 161 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:11:33,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-19 10:11:33,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2024-11-19 10:11:33,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 164 states have (on average 1.25) internal successors, (205), 168 states have internal predecessors, (205), 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) [2024-11-19 10:11:33,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 288 transitions. [2024-11-19 10:11:33,024 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 288 transitions. Word has length 44 [2024-11-19 10:11:33,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:33,025 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 288 transitions. [2024-11-19 10:11:33,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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) [2024-11-19 10:11:33,025 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2024-11-19 10:11:33,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 10:11:33,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:33,026 INFO L215 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] [2024-11-19 10:11:33,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 10:11:33,027 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:11:33,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:33,027 INFO L85 PathProgramCache]: Analyzing trace with hash 249516746, now seen corresponding path program 1 times [2024-11-19 10:11:33,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:33,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013344790] [2024-11-19 10:11:33,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:33,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:33,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:33,136 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 10:11:33,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:33,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013344790] [2024-11-19 10:11:33,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013344790] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:11:33,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122268166] [2024-11-19 10:11:33,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:33,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:11:33,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:11:33,140 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) [2024-11-19 10:11:33,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 10:11:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:33,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 10:11:33,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:11:33,234 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 10:11:33,235 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:11:33,374 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 10:11:33,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122268166] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:11:33,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:11:33,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-19 10:11:33,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480546658] [2024-11-19 10:11:33,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:11:33,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 10:11:33,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:33,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 10:11:33,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-19 10:11:33,377 INFO L87 Difference]: Start difference. First operand 217 states and 288 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) [2024-11-19 10:11:33,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:33,754 INFO L93 Difference]: Finished difference Result 304 states and 396 transitions. [2024-11-19 10:11:33,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 10:11:33,755 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 [2024-11-19 10:11:33,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:33,756 INFO L225 Difference]: With dead ends: 304 [2024-11-19 10:11:33,756 INFO L226 Difference]: Without dead ends: 303 [2024-11-19 10:11:33,757 INFO L431 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 [2024-11-19 10:11:33,758 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 110 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 10:11:33,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 594 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 10:11:33,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-19 10:11:33,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 280. [2024-11-19 10:11:33,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 212 states have (on average 1.2877358490566038) internal successors, (273), 218 states have internal predecessors, (273), 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) [2024-11-19 10:11:33,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 384 transitions. [2024-11-19 10:11:33,777 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 384 transitions. Word has length 48 [2024-11-19 10:11:33,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:33,777 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 384 transitions. [2024-11-19 10:11:33,777 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) [2024-11-19 10:11:33,777 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 384 transitions. [2024-11-19 10:11:33,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 10:11:33,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:33,779 INFO L215 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] [2024-11-19 10:11:33,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 10:11:33,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-19 10:11:33,980 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:11:33,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:33,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1302881257, now seen corresponding path program 1 times [2024-11-19 10:11:33,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:33,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252896671] [2024-11-19 10:11:33,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:33,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:34,059 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 10:11:34,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:34,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252896671] [2024-11-19 10:11:34,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252896671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:11:34,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:11:34,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 10:11:34,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369591314] [2024-11-19 10:11:34,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:11:34,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:11:34,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:34,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:11:34,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:11:34,061 INFO L87 Difference]: Start difference. First operand 280 states and 384 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) [2024-11-19 10:11:34,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:34,158 INFO L93 Difference]: Finished difference Result 511 states and 705 transitions. [2024-11-19 10:11:34,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 10:11:34,159 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 [2024-11-19 10:11:34,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:34,161 INFO L225 Difference]: With dead ends: 511 [2024-11-19 10:11:34,161 INFO L226 Difference]: Without dead ends: 265 [2024-11-19 10:11:34,162 INFO L431 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 [2024-11-19 10:11:34,163 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 15 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:11:34,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 239 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:11:34,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-19 10:11:34,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 264. [2024-11-19 10:11:34,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 202 states have (on average 1.2772277227722773) internal successors, (258), 209 states have internal predecessors, (258), 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) [2024-11-19 10:11:34,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 356 transitions. [2024-11-19 10:11:34,177 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 356 transitions. Word has length 54 [2024-11-19 10:11:34,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:34,178 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 356 transitions. [2024-11-19 10:11:34,178 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) [2024-11-19 10:11:34,178 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 356 transitions. [2024-11-19 10:11:34,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 10:11:34,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:34,179 INFO L215 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] [2024-11-19 10:11:34,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 10:11:34,180 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:11:34,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:34,180 INFO L85 PathProgramCache]: Analyzing trace with hash 383045525, now seen corresponding path program 2 times [2024-11-19 10:11:34,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:34,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062546686] [2024-11-19 10:11:34,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:11:34,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:34,193 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 10:11:34,193 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:11:34,276 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-19 10:11:34,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:34,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062546686] [2024-11-19 10:11:34,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062546686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:11:34,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:11:34,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 10:11:34,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892485372] [2024-11-19 10:11:34,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:11:34,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 10:11:34,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:34,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 10:11:34,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:11:34,278 INFO L87 Difference]: Start difference. First operand 264 states and 356 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) [2024-11-19 10:11:34,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:34,442 INFO L93 Difference]: Finished difference Result 541 states and 747 transitions. [2024-11-19 10:11:34,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 10:11:34,443 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 [2024-11-19 10:11:34,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:34,445 INFO L225 Difference]: With dead ends: 541 [2024-11-19 10:11:34,445 INFO L226 Difference]: Without dead ends: 315 [2024-11-19 10:11:34,446 INFO L431 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 [2024-11-19 10:11:34,447 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 42 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:11:34,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 351 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:11:34,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-11-19 10:11:34,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 308. [2024-11-19 10:11:34,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 236 states have (on average 1.305084745762712) internal successors, (308), 241 states have internal predecessors, (308), 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) [2024-11-19 10:11:34,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 428 transitions. [2024-11-19 10:11:34,465 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 428 transitions. Word has length 54 [2024-11-19 10:11:34,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:34,465 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 428 transitions. [2024-11-19 10:11:34,465 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) [2024-11-19 10:11:34,465 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 428 transitions. [2024-11-19 10:11:34,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-19 10:11:34,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:34,466 INFO L215 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] [2024-11-19 10:11:34,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 10:11:34,466 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:11:34,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:34,467 INFO L85 PathProgramCache]: Analyzing trace with hash -744620115, now seen corresponding path program 1 times [2024-11-19 10:11:34,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:34,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474503916] [2024-11-19 10:11:34,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:34,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 10:11:34,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [666220149] [2024-11-19 10:11:34,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:34,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:11:34,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:11:34,480 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) [2024-11-19 10:11:34,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 10:11:34,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:34,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:11:34,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:11:34,574 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 10:11:34,574 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:11:34,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:34,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474503916] [2024-11-19 10:11:34,574 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 10:11:34,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666220149] [2024-11-19 10:11:34,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666220149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:11:34,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:11:34,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 10:11:34,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790538819] [2024-11-19 10:11:34,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:11:34,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:11:34,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:34,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:11:34,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:11:34,576 INFO L87 Difference]: Start difference. First operand 308 states and 428 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) [2024-11-19 10:11:34,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:34,601 INFO L93 Difference]: Finished difference Result 308 states and 428 transitions. [2024-11-19 10:11:34,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:11:34,602 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 [2024-11-19 10:11:34,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:34,604 INFO L225 Difference]: With dead ends: 308 [2024-11-19 10:11:34,604 INFO L226 Difference]: Without dead ends: 307 [2024-11-19 10:11:34,604 INFO L431 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 [2024-11-19 10:11:34,605 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 2 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:11:34,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 153 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:11:34,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-19 10:11:34,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2024-11-19 10:11:34,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 236 states have (on average 1.2923728813559323) internal successors, (305), 240 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) [2024-11-19 10:11:34,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 425 transitions. [2024-11-19 10:11:34,620 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 425 transitions. Word has length 55 [2024-11-19 10:11:34,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:34,620 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 425 transitions. [2024-11-19 10:11:34,620 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) [2024-11-19 10:11:34,620 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 425 transitions. [2024-11-19 10:11:34,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 10:11:34,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:34,621 INFO L215 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, 1, 1] [2024-11-19 10:11:34,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 10:11:34,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:11:34,821 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:11:34,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:34,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1364436842, now seen corresponding path program 1 times [2024-11-19 10:11:34,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:34,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822587084] [2024-11-19 10:11:34,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:34,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:34,912 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 10:11:34,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:34,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822587084] [2024-11-19 10:11:34,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822587084] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:11:34,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909992398] [2024-11-19 10:11:34,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:34,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:11:34,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:11:34,914 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) [2024-11-19 10:11:34,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 10:11:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:34,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 10:11:34,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:11:35,109 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 10:11:35,109 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:11:35,192 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 10:11:35,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909992398] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:11:35,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:11:35,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2024-11-19 10:11:35,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517555286] [2024-11-19 10:11:35,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:11:35,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 10:11:35,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:35,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 10:11:35,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-19 10:11:35,194 INFO L87 Difference]: Start difference. First operand 307 states and 425 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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) [2024-11-19 10:11:35,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:35,314 INFO L93 Difference]: Finished difference Result 538 states and 742 transitions. [2024-11-19 10:11:35,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 10:11:35,315 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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 54 [2024-11-19 10:11:35,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:35,317 INFO L225 Difference]: With dead ends: 538 [2024-11-19 10:11:35,317 INFO L226 Difference]: Without dead ends: 318 [2024-11-19 10:11:35,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 95 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-19 10:11:35,318 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 22 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:11:35,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 401 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:11:35,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-19 10:11:35,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 311. [2024-11-19 10:11:35,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 240 states have (on average 1.2833333333333334) internal successors, (308), 244 states have internal predecessors, (308), 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) [2024-11-19 10:11:35,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 428 transitions. [2024-11-19 10:11:35,334 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 428 transitions. Word has length 54 [2024-11-19 10:11:35,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:35,334 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 428 transitions. [2024-11-19 10:11:35,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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) [2024-11-19 10:11:35,334 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 428 transitions. [2024-11-19 10:11:35,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-19 10:11:35,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:35,335 INFO L215 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] [2024-11-19 10:11:35,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 10:11:35,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:11:35,536 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting factErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:11:35,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:35,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1608387041, now seen corresponding path program 1 times [2024-11-19 10:11:35,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:35,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148491085] [2024-11-19 10:11:35,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:35,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 10:11:35,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [224034173] [2024-11-19 10:11:35,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:35,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:11:35,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:11:35,551 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) [2024-11-19 10:11:35,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 10:11:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:35,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 10:11:35,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:11:35,732 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 10:11:35,732 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:11:35,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:35,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148491085] [2024-11-19 10:11:35,971 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 10:11:35,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224034173] [2024-11-19 10:11:35,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224034173] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:11:35,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:11:35,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2024-11-19 10:11:35,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646956388] [2024-11-19 10:11:35,972 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-19 10:11:35,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 10:11:35,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:35,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 10:11:35,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-19 10:11:35,973 INFO L87 Difference]: Start difference. First operand 311 states and 428 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) [2024-11-19 10:11:36,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:36,358 INFO L93 Difference]: Finished difference Result 335 states and 448 transitions. [2024-11-19 10:11:36,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 10:11:36,359 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 [2024-11-19 10:11:36,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:36,361 INFO L225 Difference]: With dead ends: 335 [2024-11-19 10:11:36,361 INFO L226 Difference]: Without dead ends: 334 [2024-11-19 10:11:36,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2024-11-19 10:11:36,362 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 65 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 10:11:36,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 328 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 10:11:36,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-19 10:11:36,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 311. [2024-11-19 10:11:36,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 240 states have (on average 1.2791666666666666) internal successors, (307), 244 states have internal predecessors, (307), 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) [2024-11-19 10:11:36,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 427 transitions. [2024-11-19 10:11:36,379 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 427 transitions. Word has length 56 [2024-11-19 10:11:36,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:36,380 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 427 transitions. [2024-11-19 10:11:36,380 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) [2024-11-19 10:11:36,380 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 427 transitions. [2024-11-19 10:11:36,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-19 10:11:36,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:36,383 INFO L215 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] [2024-11-19 10:11:36,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-19 10:11:36,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:11:36,583 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:11:36,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:36,584 INFO L85 PathProgramCache]: Analyzing trace with hash 515976557, now seen corresponding path program 1 times [2024-11-19 10:11:36,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:36,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403078846] [2024-11-19 10:11:36,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:36,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:36,654 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-19 10:11:36,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:36,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403078846] [2024-11-19 10:11:36,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403078846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:11:36,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:11:36,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 10:11:36,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47110631] [2024-11-19 10:11:36,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:11:36,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 10:11:36,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:36,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 10:11:36,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:11:36,656 INFO L87 Difference]: Start difference. First operand 311 states and 427 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) [2024-11-19 10:11:36,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:36,783 INFO L93 Difference]: Finished difference Result 576 states and 786 transitions. [2024-11-19 10:11:36,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 10:11:36,784 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 [2024-11-19 10:11:36,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:36,786 INFO L225 Difference]: With dead ends: 576 [2024-11-19 10:11:36,786 INFO L226 Difference]: Without dead ends: 314 [2024-11-19 10:11:36,788 INFO L431 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 [2024-11-19 10:11:36,788 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 37 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 358 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 [2024-11-19 10:11:36,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 358 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:11:36,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-11-19 10:11:36,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 307. [2024-11-19 10:11:36,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 237 states have (on average 1.2658227848101267) internal successors, (300), 241 states have internal predecessors, (300), 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) [2024-11-19 10:11:36,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 412 transitions. [2024-11-19 10:11:36,812 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 412 transitions. Word has length 64 [2024-11-19 10:11:36,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:36,812 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 412 transitions. [2024-11-19 10:11:36,813 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) [2024-11-19 10:11:36,813 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 412 transitions. [2024-11-19 10:11:36,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 10:11:36,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:36,813 INFO L215 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] [2024-11-19 10:11:36,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 10:11:36,814 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting binomialCoefficientErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:11:36,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:36,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1931668771, now seen corresponding path program 1 times [2024-11-19 10:11:36,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:36,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945408532] [2024-11-19 10:11:36,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:36,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:36,907 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-19 10:11:36,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:36,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945408532] [2024-11-19 10:11:36,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945408532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:11:36,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:11:36,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 10:11:36,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263206314] [2024-11-19 10:11:36,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:11:36,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 10:11:36,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:36,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 10:11:36,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:11:36,910 INFO L87 Difference]: Start difference. First operand 307 states and 412 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) [2024-11-19 10:11:37,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:37,027 INFO L93 Difference]: Finished difference Result 313 states and 412 transitions. [2024-11-19 10:11:37,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 10:11:37,028 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 [2024-11-19 10:11:37,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:37,030 INFO L225 Difference]: With dead ends: 313 [2024-11-19 10:11:37,030 INFO L226 Difference]: Without dead ends: 312 [2024-11-19 10:11:37,030 INFO L431 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 [2024-11-19 10:11:37,030 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 42 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:11:37,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 384 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:11:37,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-19 10:11:37,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 306. [2024-11-19 10:11:37,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 237 states have (on average 1.2320675105485233) internal successors, (292), 240 states have internal predecessors, (292), 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) [2024-11-19 10:11:37,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 404 transitions. [2024-11-19 10:11:37,045 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 404 transitions. Word has length 66 [2024-11-19 10:11:37,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:37,045 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 404 transitions. [2024-11-19 10:11:37,045 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) [2024-11-19 10:11:37,045 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 404 transitions. [2024-11-19 10:11:37,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 10:11:37,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:37,046 INFO L215 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] [2024-11-19 10:11:37,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 10:11:37,046 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting binomialCoefficientErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:11:37,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:37,046 INFO L85 PathProgramCache]: Analyzing trace with hash -247810189, now seen corresponding path program 1 times [2024-11-19 10:11:37,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:37,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589661292] [2024-11-19 10:11:37,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:37,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:37,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:37,151 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-19 10:11:37,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:37,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589661292] [2024-11-19 10:11:37,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589661292] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:11:37,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986351186] [2024-11-19 10:11:37,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:37,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:11:37,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:11:37,153 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) [2024-11-19 10:11:37,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 10:11:37,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:37,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 10:11:37,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:11:37,326 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-19 10:11:37,326 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:11:37,465 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-19 10:11:37,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986351186] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:11:37,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:11:37,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2024-11-19 10:11:37,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796021150] [2024-11-19 10:11:37,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:11:37,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-19 10:11:37,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:37,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 10:11:37,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2024-11-19 10:11:37,467 INFO L87 Difference]: Start difference. First operand 306 states and 404 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) [2024-11-19 10:11:37,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:37,719 INFO L93 Difference]: Finished difference Result 434 states and 578 transitions. [2024-11-19 10:11:37,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 10:11:37,720 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 [2024-11-19 10:11:37,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:37,722 INFO L225 Difference]: With dead ends: 434 [2024-11-19 10:11:37,722 INFO L226 Difference]: Without dead ends: 433 [2024-11-19 10:11:37,723 INFO L431 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 [2024-11-19 10:11:37,723 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 129 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 10:11:37,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 467 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 10:11:37,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-11-19 10:11:37,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 414. [2024-11-19 10:11:37,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 321 states have (on average 1.2087227414330217) internal successors, (388), 320 states have internal predecessors, (388), 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) [2024-11-19 10:11:37,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 560 transitions. [2024-11-19 10:11:37,747 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 560 transitions. Word has length 67 [2024-11-19 10:11:37,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:37,747 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 560 transitions. [2024-11-19 10:11:37,748 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) [2024-11-19 10:11:37,750 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 560 transitions. [2024-11-19 10:11:37,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-19 10:11:37,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:37,751 INFO L215 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] [2024-11-19 10:11:37,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-19 10:11:37,952 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,SelfDestructingSolverStorable24 [2024-11-19 10:11:37,953 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:11:37,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:37,953 INFO L85 PathProgramCache]: Analyzing trace with hash -713206344, now seen corresponding path program 2 times [2024-11-19 10:11:37,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:37,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220520861] [2024-11-19 10:11:37,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:11:37,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:37,968 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 10:11:37,968 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:11:38,100 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-19 10:11:38,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:38,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220520861] [2024-11-19 10:11:38,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220520861] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:11:38,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973864333] [2024-11-19 10:11:38,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:11:38,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:11:38,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:11:38,102 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) [2024-11-19 10:11:38,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 10:11:38,151 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 10:11:38,151 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:11:38,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 10:11:38,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:11:38,306 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-19 10:11:38,306 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:11:38,494 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-19 10:11:38,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973864333] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:11:38,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:11:38,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2024-11-19 10:11:38,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947381359] [2024-11-19 10:11:38,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:11:38,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-19 10:11:38,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:38,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 10:11:38,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2024-11-19 10:11:38,497 INFO L87 Difference]: Start difference. First operand 414 states and 560 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) [2024-11-19 10:11:39,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:39,147 INFO L93 Difference]: Finished difference Result 505 states and 648 transitions. [2024-11-19 10:11:39,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-19 10:11:39,147 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 [2024-11-19 10:11:39,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:39,150 INFO L225 Difference]: With dead ends: 505 [2024-11-19 10:11:39,150 INFO L226 Difference]: Without dead ends: 504 [2024-11-19 10:11:39,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=1294, Unknown=0, NotChecked=0, Total=1482 [2024-11-19 10:11:39,151 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 222 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 10:11:39,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 793 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 10:11:39,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2024-11-19 10:11:39,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 484. [2024-11-19 10:11:39,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 374 states have (on average 1.2085561497326203) internal successors, (452), 378 states have internal predecessors, (452), 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) [2024-11-19 10:11:39,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 640 transitions. [2024-11-19 10:11:39,177 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 640 transitions. Word has length 72 [2024-11-19 10:11:39,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:39,177 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 640 transitions. [2024-11-19 10:11:39,177 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) [2024-11-19 10:11:39,177 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 640 transitions. [2024-11-19 10:11:39,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-19 10:11:39,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:39,178 INFO L215 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] [2024-11-19 10:11:39,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-19 10:11:39,378 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,SelfDestructingSolverStorable25 [2024-11-19 10:11:39,379 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting binomialCoefficientErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:11:39,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:39,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1724138098, now seen corresponding path program 1 times [2024-11-19 10:11:39,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:39,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181852520] [2024-11-19 10:11:39,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:39,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:39,511 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-19 10:11:39,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:39,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181852520] [2024-11-19 10:11:39,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181852520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:11:39,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:11:39,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 10:11:39,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890913305] [2024-11-19 10:11:39,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:11:39,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 10:11:39,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:39,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 10:11:39,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-19 10:11:39,513 INFO L87 Difference]: Start difference. First operand 484 states and 640 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) [2024-11-19 10:11:39,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:39,740 INFO L93 Difference]: Finished difference Result 881 states and 1188 transitions. [2024-11-19 10:11:39,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 10:11:39,740 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 [2024-11-19 10:11:39,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:39,743 INFO L225 Difference]: With dead ends: 881 [2024-11-19 10:11:39,743 INFO L226 Difference]: Without dead ends: 442 [2024-11-19 10:11:39,745 INFO L431 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 [2024-11-19 10:11:39,745 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 45 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 10:11:39,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 379 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 10:11:39,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-11-19 10:11:39,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 380. [2024-11-19 10:11:39,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 289 states have (on average 1.2491349480968859) internal successors, (361), 301 states have internal predecessors, (361), 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) [2024-11-19 10:11:39,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 492 transitions. [2024-11-19 10:11:39,766 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 492 transitions. Word has length 76 [2024-11-19 10:11:39,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:39,767 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 492 transitions. [2024-11-19 10:11:39,767 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) [2024-11-19 10:11:39,767 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 492 transitions. [2024-11-19 10:11:39,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-19 10:11:39,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:39,768 INFO L215 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] [2024-11-19 10:11:39,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 10:11:39,768 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting factErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:11:39,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:39,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1228745485, now seen corresponding path program 1 times [2024-11-19 10:11:39,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:39,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469532858] [2024-11-19 10:11:39,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:39,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 10:11:39,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [677055303] [2024-11-19 10:11:39,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:39,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:11:39,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:11:39,796 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) [2024-11-19 10:11:39,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-19 10:11:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:39,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 10:11:39,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:11:39,978 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-19 10:11:39,978 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:11:40,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:40,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469532858] [2024-11-19 10:11:40,189 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 10:11:40,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677055303] [2024-11-19 10:11:40,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677055303] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:11:40,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:11:40,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2024-11-19 10:11:40,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046224247] [2024-11-19 10:11:40,189 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-19 10:11:40,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 10:11:40,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:40,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 10:11:40,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-19 10:11:40,190 INFO L87 Difference]: Start difference. First operand 380 states and 492 transitions. Second operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 5 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-19 10:11:40,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:40,482 INFO L93 Difference]: Finished difference Result 391 states and 501 transitions. [2024-11-19 10:11:40,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 10:11:40,483 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 5 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 80 [2024-11-19 10:11:40,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:40,486 INFO L225 Difference]: With dead ends: 391 [2024-11-19 10:11:40,486 INFO L226 Difference]: Without dead ends: 390 [2024-11-19 10:11:40,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-19 10:11:40,487 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 35 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 10:11:40,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 661 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 10:11:40,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-19 10:11:40,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 380. [2024-11-19 10:11:40,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 289 states have (on average 1.2422145328719723) internal successors, (359), 301 states have internal predecessors, (359), 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) [2024-11-19 10:11:40,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 490 transitions. [2024-11-19 10:11:40,510 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 490 transitions. Word has length 80 [2024-11-19 10:11:40,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:40,510 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 490 transitions. [2024-11-19 10:11:40,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 5 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-19 10:11:40,510 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 490 transitions. [2024-11-19 10:11:40,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 10:11:40,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:40,512 INFO L215 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] [2024-11-19 10:11:40,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-19 10:11:40,713 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,SelfDestructingSolverStorable27 [2024-11-19 10:11:40,713 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting binomialCoefficientErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:11:40,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:40,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1048752312, now seen corresponding path program 1 times [2024-11-19 10:11:40,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:40,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468209600] [2024-11-19 10:11:40,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:40,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 10:11:40,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [672451678] [2024-11-19 10:11:40,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:40,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:11:40,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:11:40,734 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) [2024-11-19 10:11:40,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-19 10:11:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:40,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 10:11:40,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:11:40,866 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-19 10:11:40,866 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:11:40,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:40,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468209600] [2024-11-19 10:11:40,867 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 10:11:40,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672451678] [2024-11-19 10:11:40,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672451678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:11:40,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:11:40,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 10:11:40,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826088759] [2024-11-19 10:11:40,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:11:40,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 10:11:40,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:40,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 10:11:40,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:11:40,868 INFO L87 Difference]: Start difference. First operand 380 states and 490 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) [2024-11-19 10:11:40,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:40,926 INFO L93 Difference]: Finished difference Result 380 states and 490 transitions. [2024-11-19 10:11:40,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 10:11:40,927 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 [2024-11-19 10:11:40,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:40,929 INFO L225 Difference]: With dead ends: 380 [2024-11-19 10:11:40,930 INFO L226 Difference]: Without dead ends: 379 [2024-11-19 10:11:40,930 INFO L431 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 [2024-11-19 10:11:40,931 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 160 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 [2024-11-19 10:11:40,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 160 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:11:40,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-19 10:11:40,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2024-11-19 10:11:40,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 289 states have (on average 1.2110726643598615) internal successors, (350), 300 states have internal predecessors, (350), 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) [2024-11-19 10:11:40,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 481 transitions. [2024-11-19 10:11:40,950 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 481 transitions. Word has length 84 [2024-11-19 10:11:40,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:40,950 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 481 transitions. [2024-11-19 10:11:40,950 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) [2024-11-19 10:11:40,951 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 481 transitions. [2024-11-19 10:11:40,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-19 10:11:40,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:40,952 INFO L215 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] [2024-11-19 10:11:40,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-19 10:11:41,153 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,SelfDestructingSolverStorable28 [2024-11-19 10:11:41,153 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting binomialCoefficientErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:11:41,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:41,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1848416756, now seen corresponding path program 1 times [2024-11-19 10:11:41,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:41,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820264090] [2024-11-19 10:11:41,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:41,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 10:11:41,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1153235132] [2024-11-19 10:11:41,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:11:41,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:11:41,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:11:41,168 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) [2024-11-19 10:11:41,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-19 10:11:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:11:41,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 10:11:41,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:11:41,482 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 55 proven. 7 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-19 10:11:41,482 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:11:42,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:11:42,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820264090] [2024-11-19 10:11:42,013 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 10:11:42,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153235132] [2024-11-19 10:11:42,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153235132] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:11:42,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:11:42,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2024-11-19 10:11:42,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222938359] [2024-11-19 10:11:42,014 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-19 10:11:42,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 10:11:42,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:11:42,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 10:11:42,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-11-19 10:11:42,015 INFO L87 Difference]: Start difference. First operand 379 states and 481 transitions. Second operand has 15 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 6 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-19 10:11:42,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:11:42,436 INFO L93 Difference]: Finished difference Result 469 states and 623 transitions. [2024-11-19 10:11:42,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 10:11:42,437 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 6 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 85 [2024-11-19 10:11:42,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:11:42,440 INFO L225 Difference]: With dead ends: 469 [2024-11-19 10:11:42,440 INFO L226 Difference]: Without dead ends: 468 [2024-11-19 10:11:42,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2024-11-19 10:11:42,441 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 74 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 10:11:42,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 419 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 10:11:42,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-19 10:11:42,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 403. [2024-11-19 10:11:42,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 309 states have (on average 1.197411003236246) internal successors, (370), 318 states have internal predecessors, (370), 57 states have call successors, (57), 23 states have call predecessors, (57), 29 states have return successors, (85), 61 states have call predecessors, (85), 57 states have call successors, (85) [2024-11-19 10:11:42,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 512 transitions. [2024-11-19 10:11:42,470 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 512 transitions. Word has length 85 [2024-11-19 10:11:42,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:11:42,470 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 512 transitions. [2024-11-19 10:11:42,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 6 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-19 10:11:42,471 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 512 transitions. [2024-11-19 10:11:42,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 10:11:42,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:11:42,472 INFO L215 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] [2024-11-19 10:11:42,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-19 10:11:42,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:11:42,673 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting binomialCoefficientErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:11:42,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:11:42,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1466344650, now seen corresponding path program 2 times [2024-11-19 10:11:42,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:11:42,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846671033] [2024-11-19 10:11:42,674 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:11:42,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:11:42,697 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 10:11:42,698 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-19 10:11:42,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [695827999] [2024-11-19 10:11:42,699 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:11:42,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:11:42,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:11:42,701 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) [2024-11-19 10:11:42,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-19 10:11:42,766 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 10:11:42,766 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:11:42,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-19 10:11:42,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:11:42,998 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 54 proven. 7 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-19 10:11:42,998 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:12:03,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:12:03,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846671033] [2024-11-19 10:12:03,040 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 10:12:03,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695827999] [2024-11-19 10:12:03,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695827999] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:12:03,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:12:03,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2024-11-19 10:12:03,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660488648] [2024-11-19 10:12:03,041 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-19 10:12:03,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 10:12:03,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:12:03,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 10:12:03,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=319, Unknown=11, NotChecked=0, Total=380 [2024-11-19 10:12:03,043 INFO L87 Difference]: Start difference. First operand 403 states and 512 transitions. Second operand has 15 states, 13 states have (on average 4.0) internal successors, (52), 14 states have internal predecessors, (52), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-19 10:12:04,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:12:04,246 INFO L93 Difference]: Finished difference Result 457 states and 597 transitions. [2024-11-19 10:12:04,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 10:12:04,247 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 14 states have internal predecessors, (52), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 86 [2024-11-19 10:12:04,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:12:04,249 INFO L225 Difference]: With dead ends: 457 [2024-11-19 10:12:04,249 INFO L226 Difference]: Without dead ends: 456 [2024-11-19 10:12:04,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=81, Invalid=460, Unknown=11, NotChecked=0, Total=552 [2024-11-19 10:12:04,252 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 59 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 10:12:04,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 453 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 10:12:04,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-11-19 10:12:04,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 404. [2024-11-19 10:12:04,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 310 states have (on average 1.196774193548387) internal successors, (371), 319 states have internal predecessors, (371), 57 states have call successors, (57), 23 states have call predecessors, (57), 29 states have return successors, (85), 61 states have call predecessors, (85), 57 states have call successors, (85) [2024-11-19 10:12:04,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 513 transitions. [2024-11-19 10:12:04,278 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 513 transitions. Word has length 86 [2024-11-19 10:12:04,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:12:04,278 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 513 transitions. [2024-11-19 10:12:04,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 14 states have internal predecessors, (52), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-19 10:12:04,279 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 513 transitions. [2024-11-19 10:12:04,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-19 10:12:04,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:12:04,280 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:12:04,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-19 10:12:04,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-11-19 10:12:04,485 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting binomialCoefficientErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:12:04,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:12:04,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1787956042, now seen corresponding path program 1 times [2024-11-19 10:12:04,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:12:04,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543229492] [2024-11-19 10:12:04,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:12:04,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:12:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 10:12:04,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [777520168] [2024-11-19 10:12:04,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:12:04,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:12:04,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:12:04,505 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) [2024-11-19 10:12:04,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-19 10:12:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:12:04,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-19 10:12:04,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:12:05,861 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_fact_#t~ret0_40| Int) (v_fact_~n_144 Int)) (let ((.cse0 (* v_fact_~n_144 |v_fact_#t~ret0_40|))) (and (<= |c_fact_#res| .cse0) (<= .cse0 2147483647)))) is different from true [2024-11-19 10:12:07,589 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 57 proven. 7 refuted. 0 times theorem prover too weak. 63 trivial. 6 not checked. [2024-11-19 10:12:07,589 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:12:14,522 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (< 0 |c_fact_#in~n|))) (and (or (and (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse0 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (< .cse0 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse0) 2147483647) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse0) 0))) (< 2147483647 .cse0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse1 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse1) 2147483649) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse1) 0))) (< 2147483647 .cse1))))) .cse2) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse3 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (< .cse3 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse3) 2147483647) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse3) 0))) (< 2147483647 .cse3) (< (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|) 2147483648)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse5 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse4 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (< 2147483646 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse4)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse5) 2147483647) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse4) 0) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse5) 0)))) (< .cse5 0) (< 2147483647 .cse5)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse7 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse6 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (< 2147483646 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse6)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse7) 2147483649) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse6) 0) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse7) 0)))) (< 2147483647 .cse7)))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse9 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (let ((.cse8 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse9))) (or (< .cse8 2147483648) (= .cse8 2147483648) (< 2147483647 .cse9))))) .cse2) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse10 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|)) (.cse11 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (< 0 (+ .cse10 1)) (< .cse11 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse11) 2147483647) (< 2147483648 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse10)) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse10) 0) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse11) 0))) (< 2147483647 .cse11)))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse12 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse12) 0)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse12) 2147483648) (< 2147483647 .cse12)))) .cse2) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse13 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (< 2147483647 .cse13) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse14 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse14) 0)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse13) 2147483649) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse14)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse13) 0))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse16 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|)) (.cse15 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse15) 0)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse15) 2147483648) (< 2147483648 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse16)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse16) 0))) (< 0 (+ .cse16 1)) (< 2147483647 .cse15)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse17 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse18 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse17) 2147483647) (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse18) 0)) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse18)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse17) 0)))) (< .cse17 0) (< 2147483647 .cse17)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse20 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|)) (.cse19 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse19) 2147483648) (< 2147483648 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse20)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse20) 0))) (< 0 (+ .cse20 1)) (< .cse19 0) (< 2147483647 .cse19)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse21 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse21) 2147483649) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse21) 0))) (< 2147483647 .cse21) (< (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|) 2147483648)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse22 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 0) (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse22) 0)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse22) 2147483648) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))))) (< 2147483647 .cse22)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse24 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|)) (.cse23 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse23) 2147483649) (< 2147483648 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse24)) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse24) 0) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse23) 0))) (< 0 (+ .cse24 1)) (< 2147483647 .cse23)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse26 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|)) (.cse27 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse25 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse27))) (or (< .cse25 2147483648) (< 2147483648 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse26)) (= .cse25 2147483648) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse26) 0)))) (< 0 (+ .cse26 1)) (< 2147483647 .cse27)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse28 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse28) 0)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse28) 2147483648))) (< 2147483647 .cse28) (< (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|) 2147483648)))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse29 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse29) 2147483648) (< .cse29 0) (< 2147483647 .cse29)))) .cse2) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse32 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse31 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|)) (.cse30 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse32))) (or (< .cse30 2147483648) (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse31) 0)) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse31)) (= .cse30 2147483648)))) (< 2147483647 .cse32)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse34 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse33 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse34))) (or (< .cse33 2147483648) (= .cse33 2147483648)))) (< 2147483647 .cse34) (< (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|) 2147483648)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse35 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse36 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse35) 2147483648) (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse36) 0)) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse36))))) (< .cse35 0) (< 2147483647 .cse35)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse38 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse37 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse38))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 0) (< .cse37 2147483648) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (= .cse37 2147483648)))) (< 2147483647 .cse38)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse39 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse39) 2147483648)) (< .cse39 0) (< 2147483647 .cse39) (< (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|) 2147483648)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse41 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse40 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (< 2147483646 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse40)) (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse41) 0)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse41) 2147483648) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse40) 0)))) (< 2147483647 .cse41)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse42 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse43 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse42) 0)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse42) 2147483648) (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse43) 0)) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse43))))) (< 2147483647 .cse42)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse44 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 0) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse44) 2147483648) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))))) (< .cse44 0) (< 2147483647 .cse44)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse46 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse45 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (< 2147483646 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse45)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse46) 2147483648) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse45) 0)))) (< .cse46 0) (< 2147483647 .cse46)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse49 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse48 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse49)) (.cse47 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (< 2147483646 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse47)) (< .cse48 2147483648) (= .cse48 2147483648) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse47) 0)))) (< 2147483647 .cse49)))))) is different from true [2024-11-19 10:12:21,994 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (< 0 |c_fact_#in~n|))) (and (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse0 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) (.cse1 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (< 2147483647 .cse0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse0) 0) (< 2147483648 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse1)) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse1) 0) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse0) 2147483649))) (< 0 (+ .cse1 1))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse2 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< .cse2 0) (< 2147483647 .cse2) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse3 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (< 2147483646 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse3)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse2) 0) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse3) 0) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse2) 2147483647))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse4 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< .cse4 0) (< 2147483647 .cse4) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse4) 2147483648)) (< (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|) 2147483648)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse6 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|)) (.cse5 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< 2147483647 .cse5) (< 0 (+ .cse6 1)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse7 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse5))) (or (= .cse7 2147483648) (< 2147483648 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse6)) (< .cse7 2147483648) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse6) 0))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse8 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< 2147483647 .cse8) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse8) 0) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse8) 2147483649))) (< (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|) 2147483648)))) (or .cse9 (and (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse10 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< .cse10 0) (< 2147483647 .cse10) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse10) 0) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse10) 2147483647)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse11 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< 2147483647 .cse11) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse11) 0) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse11) 2147483649)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse13 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|)) (.cse12 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< .cse12 0) (< 2147483647 .cse12) (< 0 (+ .cse13 1)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse12) 0) (< 2147483648 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse13)) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse13) 0) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse12) 2147483647)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse14 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< 2147483647 .cse14) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse15 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse14)) (.cse16 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (= .cse15 2147483648) (< 2147483646 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse16)) (< .cse15 2147483648) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse16) 0))))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse18 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (let ((.cse17 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse18))) (or (= .cse17 2147483648) (< 2147483647 .cse18) (< .cse17 2147483648))))) .cse9) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse19 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< 2147483647 .cse19) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse20 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse19))) (or (= .cse20 2147483648) (< .cse20 2147483648)))) (< (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|) 2147483648)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse21 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< 2147483647 .cse21) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse22 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse21) 0) (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse22) 0)) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse22)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse21) 2147483649))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse23 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< .cse23 0) (< 2147483647 .cse23) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse23) 0) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse23) 2147483647))) (< (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|) 2147483648)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse24 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< .cse24 0) (< 2147483647 .cse24) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse25 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse25) 0)) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse25)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse24) 2147483648))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse26 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< 2147483647 .cse26) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse27 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse26) 0)) (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse27) 0)) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse27)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse26) 2147483648))))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse28 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< .cse28 0) (< 2147483647 .cse28) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse28) 2147483648)))) .cse9) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse29 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< 2147483647 .cse29) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse30 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse29))) (or (= .cse30 2147483648) (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 0) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (< .cse30 2147483648))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse31 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< 2147483647 .cse31) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse31) 0)) (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 0) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse31) 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse32 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< 2147483647 .cse32) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse34 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|)) (.cse33 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse32))) (or (= .cse33 2147483648) (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse34) 0)) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse34)) (< .cse33 2147483648))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse35 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< .cse35 0) (< 2147483647 .cse35) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse36 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (< 2147483646 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse36)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse35) 2147483648) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse36) 0))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse37 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< .cse37 0) (< 2147483647 .cse37) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 0) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse37) 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse38 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) (.cse39 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (< 2147483647 .cse38) (< 0 (+ .cse39 1)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse38) 0)) (< 2147483648 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse39)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse38) 2147483648) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse39) 0)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse40 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< 2147483647 .cse40) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse40) 0)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse40) 2147483648))) (< (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|) 2147483648)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse41 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) (.cse42 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (< .cse41 0) (< 2147483647 .cse41) (< 0 (+ .cse42 1)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (< 2147483648 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse42)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse41) 2147483648) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse42) 0)))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse43 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse43) 0)) (< 2147483647 .cse43) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse43) 2147483648)))) .cse9) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse44 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< 2147483647 .cse44) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse45 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse44) 0)) (< 2147483646 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse45)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse44) 2147483648) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse45) 0))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse46 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< .cse46 0) (< 2147483647 .cse46) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse47 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse46) 0) (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse47) 0)) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse47)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse46) 2147483647))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse48 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< 2147483647 .cse48) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse49 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (< 2147483646 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse49)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse48) 0) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse49) 0) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse48) 2147483649))))))))) is different from true