./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive/gcd02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d 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/recursive/gcd02.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-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 32bit --witnessprinter.graph.data.programhash 5840bf8cb045a250261e3957017079dce43a53700f7c91e31c16b36d5b980e00 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 12:12:38,467 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 12:12:38,553 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 12:12:38,557 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 12:12:38,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 12:12:38,598 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 12:12:38,598 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 12:12:38,598 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 12:12:38,599 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 12:12:38,602 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 12:12:38,603 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 12:12:38,603 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 12:12:38,603 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 12:12:38,604 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 12:12:38,604 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 12:12:38,605 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 12:12:38,607 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 12:12:38,608 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 12:12:38,608 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 12:12:38,608 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 12:12:38,608 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 12:12:38,609 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 12:12:38,609 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 12:12:38,613 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 12:12:38,613 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 12:12:38,614 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 12:12:38,614 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 12:12:38,614 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 12:12:38,614 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 12:12:38,614 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 12:12:38,615 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 12:12:38,615 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 12:12:38,615 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 12:12:38,615 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 12:12:38,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 12:12:38,616 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 12:12:38,616 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 12:12:38,616 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 12:12:38,617 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 12:12:38,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 12:12:38,618 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 12:12:38,618 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 12:12:38,618 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 12:12:38,619 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 12:12:38,619 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5840bf8cb045a250261e3957017079dce43a53700f7c91e31c16b36d5b980e00 [2024-11-09 12:12:38,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 12:12:38,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 12:12:38,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 12:12:38,883 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 12:12:38,883 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 12:12:38,884 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/gcd02.c [2024-11-09 12:12:40,331 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 12:12:40,508 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 12:12:40,509 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/gcd02.c [2024-11-09 12:12:40,515 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88ae4ea94/68ccf4b67dd5457bb2eeb476648dae77/FLAGa11a2f30f [2024-11-09 12:12:40,900 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88ae4ea94/68ccf4b67dd5457bb2eeb476648dae77 [2024-11-09 12:12:40,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 12:12:40,904 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 12:12:40,905 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 12:12:40,905 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 12:12:40,911 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 12:12:40,911 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:12:40" (1/1) ... [2024-11-09 12:12:40,912 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33d13872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:12:40, skipping insertion in model container [2024-11-09 12:12:40,912 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:12:40" (1/1) ... [2024-11-09 12:12:40,942 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 12:12:41,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 12:12:41,158 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 12:12:41,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 12:12:41,202 INFO L204 MainTranslator]: Completed translation [2024-11-09 12:12:41,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:12:41 WrapperNode [2024-11-09 12:12:41,202 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 12:12:41,204 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 12:12:41,204 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 12:12:41,204 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 12:12:41,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:12:41" (1/1) ... [2024-11-09 12:12:41,216 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:12:41" (1/1) ... [2024-11-09 12:12:41,236 INFO L138 Inliner]: procedures = 14, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2024-11-09 12:12:41,236 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 12:12:41,237 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 12:12:41,237 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 12:12:41,237 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 12:12:41,248 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:12:41" (1/1) ... [2024-11-09 12:12:41,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:12:41" (1/1) ... [2024-11-09 12:12:41,253 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:12:41" (1/1) ... [2024-11-09 12:12:41,269 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-09 12:12:41,270 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:12:41" (1/1) ... [2024-11-09 12:12:41,270 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:12:41" (1/1) ... [2024-11-09 12:12:41,278 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:12:41" (1/1) ... [2024-11-09 12:12:41,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:12:41" (1/1) ... [2024-11-09 12:12:41,281 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:12:41" (1/1) ... [2024-11-09 12:12:41,282 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:12:41" (1/1) ... [2024-11-09 12:12:41,285 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 12:12:41,286 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 12:12:41,289 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 12:12:41,289 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 12:12:41,290 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:12:41" (1/1) ... [2024-11-09 12:12:41,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 12:12:41,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:12:41,329 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-09 12:12:41,333 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-09 12:12:41,382 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 12:12:41,383 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 12:12:41,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 12:12:41,383 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2024-11-09 12:12:41,383 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2024-11-09 12:12:41,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 12:12:41,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 12:12:41,384 INFO L130 BoogieDeclarations]: Found specification of procedure divides [2024-11-09 12:12:41,384 INFO L138 BoogieDeclarations]: Found implementation of procedure divides [2024-11-09 12:12:41,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 12:12:41,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 12:12:41,452 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 12:12:41,454 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 12:12:41,610 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-09 12:12:41,610 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 12:12:41,621 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 12:12:41,624 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 12:12:41,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:12:41 BoogieIcfgContainer [2024-11-09 12:12:41,624 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 12:12:41,628 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 12:12:41,628 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 12:12:41,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 12:12:41,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:12:40" (1/3) ... [2024-11-09 12:12:41,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b6a3086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:12:41, skipping insertion in model container [2024-11-09 12:12:41,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:12:41" (2/3) ... [2024-11-09 12:12:41,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b6a3086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:12:41, skipping insertion in model container [2024-11-09 12:12:41,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:12:41" (3/3) ... [2024-11-09 12:12:41,634 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd02.c [2024-11-09 12:12:41,649 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 12:12:41,650 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-09 12:12:41,705 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 12:12:41,712 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;@6b9601cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 12:12:41,713 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-09 12:12:41,716 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 39 states have internal predecessors, (48), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 12:12:41,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 12:12:41,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:12:41,722 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:12:41,723 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 12:12:41,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:12:41,728 INFO L85 PathProgramCache]: Analyzing trace with hash 961542548, now seen corresponding path program 1 times [2024-11-09 12:12:41,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:12:41,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756608460] [2024-11-09 12:12:41,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:12:41,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:12:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:12:41,992 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-09 12:12:41,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:12:41,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756608460] [2024-11-09 12:12:41,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756608460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:12:41,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:12:41,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:12:41,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860120226] [2024-11-09 12:12:41,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:12:42,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 12:12:42,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:12:42,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 12:12:42,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:12:42,033 INFO L87 Difference]: Start difference. First operand has 50 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 39 states have internal predecessors, (48), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:12:42,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:12:42,104 INFO L93 Difference]: Finished difference Result 90 states and 117 transitions. [2024-11-09 12:12:42,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 12:12:42,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 12:12:42,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:12:42,115 INFO L225 Difference]: With dead ends: 90 [2024-11-09 12:12:42,115 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 12:12:42,119 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-09 12:12:42,123 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 4 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:12:42,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 95 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:12:42,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 12:12:42,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-11-09 12:12:42,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 27 states have internal predecessors, (29), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 12:12:42,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-11-09 12:12:42,167 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 11 [2024-11-09 12:12:42,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:12:42,167 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-11-09 12:12:42,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:12:42,169 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-11-09 12:12:42,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 12:12:42,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:12:42,170 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:12:42,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 12:12:42,171 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 12:12:42,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:12:42,172 INFO L85 PathProgramCache]: Analyzing trace with hash 961542772, now seen corresponding path program 1 times [2024-11-09 12:12:42,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:12:42,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607935154] [2024-11-09 12:12:42,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:12:42,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:12:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:12:42,252 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-09 12:12:42,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:12:42,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607935154] [2024-11-09 12:12:42,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607935154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:12:42,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:12:42,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:12:42,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577693862] [2024-11-09 12:12:42,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:12:42,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 12:12:42,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:12:42,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 12:12:42,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:12:42,258 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:12:42,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:12:42,294 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2024-11-09 12:12:42,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 12:12:42,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 12:12:42,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:12:42,296 INFO L225 Difference]: With dead ends: 35 [2024-11-09 12:12:42,297 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 12:12:42,297 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-09 12:12:42,299 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:12:42,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 61 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:12:42,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 12:12:42,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-11-09 12:12:42,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 26 states have internal predecessors, (28), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 12:12:42,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-11-09 12:12:42,306 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 11 [2024-11-09 12:12:42,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:12:42,307 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-09 12:12:42,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:12:42,307 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-11-09 12:12:42,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 12:12:42,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:12:42,308 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:12:42,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 12:12:42,308 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 12:12:42,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:12:42,309 INFO L85 PathProgramCache]: Analyzing trace with hash -256952016, now seen corresponding path program 1 times [2024-11-09 12:12:42,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:12:42,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482221537] [2024-11-09 12:12:42,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:12:42,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:12:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:12:42,428 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-09 12:12:42,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:12:42,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482221537] [2024-11-09 12:12:42,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482221537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:12:42,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:12:42,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 12:12:42,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837279258] [2024-11-09 12:12:42,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:12:42,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:12:42,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:12:42,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:12:42,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 12:12:42,434 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:12:42,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:12:42,574 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2024-11-09 12:12:42,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:12:42,576 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 12:12:42,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:12:42,577 INFO L225 Difference]: With dead ends: 34 [2024-11-09 12:12:42,577 INFO L226 Difference]: Without dead ends: 33 [2024-11-09 12:12:42,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 12:12:42,579 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 33 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:12:42,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 78 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:12:42,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-09 12:12:42,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-11-09 12:12:42,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 25 states have internal predecessors, (27), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 12:12:42,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-11-09 12:12:42,601 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 12 [2024-11-09 12:12:42,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:12:42,601 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-11-09 12:12:42,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:12:42,602 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-11-09 12:12:42,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 12:12:42,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:12:42,603 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:12:42,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 12:12:42,603 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 12:12:42,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:12:42,604 INFO L85 PathProgramCache]: Analyzing trace with hash -256945065, now seen corresponding path program 1 times [2024-11-09 12:12:42,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:12:42,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7137494] [2024-11-09 12:12:42,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:12:42,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:12:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:12:42,723 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-09 12:12:42,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:12:42,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7137494] [2024-11-09 12:12:42,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7137494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:12:42,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:12:42,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 12:12:42,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192952079] [2024-11-09 12:12:42,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:12:42,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:12:42,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:12:42,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:12:42,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 12:12:42,727 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:12:42,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:12:42,827 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2024-11-09 12:12:42,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:12:42,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 12:12:42,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:12:42,828 INFO L225 Difference]: With dead ends: 33 [2024-11-09 12:12:42,828 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 12:12:42,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 12:12:42,830 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:12:42,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 78 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:12:42,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 12:12:42,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-11-09 12:12:42,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 12:12:42,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-11-09 12:12:42,838 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 12 [2024-11-09 12:12:42,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:12:42,838 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-11-09 12:12:42,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:12:42,839 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-11-09 12:12:42,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 12:12:42,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:12:42,840 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:12:42,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 12:12:42,840 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 12:12:42,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:12:42,841 INFO L85 PathProgramCache]: Analyzing trace with hash -758225056, now seen corresponding path program 1 times [2024-11-09 12:12:42,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:12:42,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943075495] [2024-11-09 12:12:42,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:12:42,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:12:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:12:42,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 12:12:42,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:12:42,904 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-09 12:12:42,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:12:42,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943075495] [2024-11-09 12:12:42,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943075495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:12:42,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:12:42,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:12:42,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088882418] [2024-11-09 12:12:42,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:12:42,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 12:12:42,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:12:42,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 12:12:42,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:12:42,909 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 12:12:42,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:12:42,923 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-11-09 12:12:42,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 12:12:42,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-09 12:12:42,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:12:42,926 INFO L225 Difference]: With dead ends: 30 [2024-11-09 12:12:42,926 INFO L226 Difference]: Without dead ends: 29 [2024-11-09 12:12:42,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-09 12:12:42,928 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:12:42,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 57 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:12:42,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-09 12:12:42,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-09 12:12:42,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 12:12:42,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-11-09 12:12:42,936 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 17 [2024-11-09 12:12:42,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:12:42,937 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-11-09 12:12:42,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 12:12:42,937 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-11-09 12:12:42,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 12:12:42,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:12:42,938 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:12:42,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 12:12:42,938 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 12:12:42,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:12:42,939 INFO L85 PathProgramCache]: Analyzing trace with hash -2030140212, now seen corresponding path program 1 times [2024-11-09 12:12:42,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:12:42,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186809361] [2024-11-09 12:12:42,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:12:42,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:12:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:12:43,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 12:12:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:12:43,142 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-09 12:12:43,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:12:43,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186809361] [2024-11-09 12:12:43,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186809361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:12:43,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:12:43,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 12:12:43,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590633327] [2024-11-09 12:12:43,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:12:43,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 12:12:43,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:12:43,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 12:12:43,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 12:12:43,147 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 8 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 12:12:43,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:12:43,295 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2024-11-09 12:12:43,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 12:12:43,297 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-09 12:12:43,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:12:43,301 INFO L225 Difference]: With dead ends: 40 [2024-11-09 12:12:43,301 INFO L226 Difference]: Without dead ends: 39 [2024-11-09 12:12:43,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 12:12:43,303 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 16 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:12:43,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 80 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:12:43,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-09 12:12:43,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2024-11-09 12:12:43,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 12:12:43,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-11-09 12:12:43,317 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 18 [2024-11-09 12:12:43,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:12:43,317 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-11-09 12:12:43,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 12:12:43,318 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-11-09 12:12:43,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 12:12:43,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:12:43,319 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:12:43,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 12:12:43,320 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 12:12:43,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:12:43,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1927224192, now seen corresponding path program 1 times [2024-11-09 12:12:43,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:12:43,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147565745] [2024-11-09 12:12:43,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:12:43,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:12:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:12:43,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 12:12:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:12:43,574 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:12:43,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:12:43,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147565745] [2024-11-09 12:12:43,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147565745] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:12:43,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232517197] [2024-11-09 12:12:43,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:12:43,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:12:43,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:12:43,578 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-09 12:12:43,579 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-09 12:12:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:12:43,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 12:12:43,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:12:43,915 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:12:43,915 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:12:43,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232517197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:12:43,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:12:43,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 19 [2024-11-09 12:12:43,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760998317] [2024-11-09 12:12:43,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:12:43,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 12:12:43,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:12:43,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 12:12:43,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2024-11-09 12:12:43,918 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 3 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-09 12:12:44,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:12:44,081 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2024-11-09 12:12:44,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 12:12:44,083 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 3 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 24 [2024-11-09 12:12:44,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:12:44,084 INFO L225 Difference]: With dead ends: 46 [2024-11-09 12:12:44,084 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 12:12:44,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2024-11-09 12:12:44,086 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 22 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:12:44,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 180 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:12:44,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 12:12:44,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-09 12:12:44,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 25 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 12:12:44,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2024-11-09 12:12:44,094 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 24 [2024-11-09 12:12:44,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:12:44,095 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-11-09 12:12:44,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 3 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-09 12:12:44,095 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2024-11-09 12:12:44,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 12:12:44,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:12:44,096 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, 1, 1, 1, 1, 1] [2024-11-09 12:12:44,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 12:12:44,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:12:44,301 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 12:12:44,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:12:44,301 INFO L85 PathProgramCache]: Analyzing trace with hash -488471538, now seen corresponding path program 1 times [2024-11-09 12:12:44,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:12:44,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066793916] [2024-11-09 12:12:44,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:12:44,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:12:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:12:44,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 12:12:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:12:44,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 12:12:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:12:44,613 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 12:12:44,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:12:44,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066793916] [2024-11-09 12:12:44,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066793916] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:12:44,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638896493] [2024-11-09 12:12:44,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:12:44,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:12:44,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:12:44,616 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-09 12:12:44,617 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-09 12:12:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:12:44,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 12:12:44,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:12:44,859 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:12:44,860 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:12:44,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638896493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:12:44,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:12:44,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2024-11-09 12:12:44,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759736969] [2024-11-09 12:12:44,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:12:44,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 12:12:44,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:12:44,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 12:12:44,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2024-11-09 12:12:44,862 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 12:12:45,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:12:45,006 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2024-11-09 12:12:45,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 12:12:45,007 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-11-09 12:12:45,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:12:45,008 INFO L225 Difference]: With dead ends: 43 [2024-11-09 12:12:45,008 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 12:12:45,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2024-11-09 12:12:45,009 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 19 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:12:45,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 147 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:12:45,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 12:12:45,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-11-09 12:12:45,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 12:12:45,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2024-11-09 12:12:45,022 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 28 [2024-11-09 12:12:45,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:12:45,022 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2024-11-09 12:12:45,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 12:12:45,022 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2024-11-09 12:12:45,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 12:12:45,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:12:45,023 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, 1, 1, 1, 1, 1] [2024-11-09 12:12:45,041 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-09 12:12:45,224 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,SelfDestructingSolverStorable7 [2024-11-09 12:12:45,224 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 12:12:45,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:12:45,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1306744242, now seen corresponding path program 1 times [2024-11-09 12:12:45,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:12:45,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858829226] [2024-11-09 12:12:45,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:12:45,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:12:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:12:45,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 12:12:45,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:12:45,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 12:12:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:12:45,401 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 12:12:45,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:12:45,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858829226] [2024-11-09 12:12:45,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858829226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:12:45,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:12:45,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 12:12:45,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642069629] [2024-11-09 12:12:45,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:12:45,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 12:12:45,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:12:45,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 12:12:45,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 12:12:45,407 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 12:12:45,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:12:45,562 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2024-11-09 12:12:45,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 12:12:45,562 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-11-09 12:12:45,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:12:45,563 INFO L225 Difference]: With dead ends: 46 [2024-11-09 12:12:45,563 INFO L226 Difference]: Without dead ends: 45 [2024-11-09 12:12:45,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-09 12:12:45,564 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:12:45,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 85 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:12:45,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-09 12:12:45,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2024-11-09 12:12:45,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (10), 6 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-09 12:12:45,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2024-11-09 12:12:45,574 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 28 [2024-11-09 12:12:45,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:12:45,574 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2024-11-09 12:12:45,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 12:12:45,575 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2024-11-09 12:12:45,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 12:12:45,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:12:45,576 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-09 12:12:45,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 12:12:45,576 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 12:12:45,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:12:45,577 INFO L85 PathProgramCache]: Analyzing trace with hash 660174604, now seen corresponding path program 1 times [2024-11-09 12:12:45,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:12:45,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630503755] [2024-11-09 12:12:45,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:12:45,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:12:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:12:45,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 12:12:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:12:45,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 12:12:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:12:45,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 12:12:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:12:45,994 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 12:12:45,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:12:45,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630503755] [2024-11-09 12:12:45,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630503755] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:12:45,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180366168] [2024-11-09 12:12:45,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:12:45,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:12:45,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:12:45,997 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-09 12:12:45,999 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-09 12:12:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:12:46,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 12:12:46,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:12:46,257 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 12:12:46,257 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:12:46,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180366168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:12:46,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:12:46,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 21 [2024-11-09 12:12:46,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305564456] [2024-11-09 12:12:46,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:12:46,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 12:12:46,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:12:46,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 12:12:46,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=418, Unknown=0, NotChecked=0, Total=462 [2024-11-09 12:12:46,259 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 12:12:46,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:12:46,387 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2024-11-09 12:12:46,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 12:12:46,388 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-11-09 12:12:46,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:12:46,388 INFO L225 Difference]: With dead ends: 44 [2024-11-09 12:12:46,388 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 12:12:46,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2024-11-09 12:12:46,391 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:12:46,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 114 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:12:46,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 12:12:46,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 12:12:46,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-09 12:12:46,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 12:12:46,394 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2024-11-09 12:12:46,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:12:46,394 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 12:12:46,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 12:12:46,394 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 12:12:46,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 12:12:46,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-09 12:12:46,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-09 12:12:46,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-09 12:12:46,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-09 12:12:46,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-09 12:12:46,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-09 12:12:46,416 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-09 12:12:46,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:12:46,607 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:12:46,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 12:12:46,975 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 12:12:46,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:12:46 BoogieIcfgContainer [2024-11-09 12:12:46,997 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 12:12:46,998 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 12:12:46,998 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 12:12:46,998 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 12:12:46,999 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:12:41" (3/4) ... [2024-11-09 12:12:47,001 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 12:12:47,005 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error [2024-11-09 12:12:47,005 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure divides [2024-11-09 12:12:47,005 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure gcd [2024-11-09 12:12:47,010 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-11-09 12:12:47,010 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-09 12:12:47,010 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 12:12:47,011 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 12:12:47,011 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 12:12:47,105 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 12:12:47,106 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 12:12:47,106 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 12:12:47,106 INFO L158 Benchmark]: Toolchain (without parser) took 6202.28ms. Allocated memory was 176.2MB in the beginning and 247.5MB in the end (delta: 71.3MB). Free memory was 120.1MB in the beginning and 97.3MB in the end (delta: 22.8MB). Peak memory consumption was 96.6MB. Max. memory is 16.1GB. [2024-11-09 12:12:47,106 INFO L158 Benchmark]: CDTParser took 0.88ms. Allocated memory is still 176.2MB. Free memory is still 139.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 12:12:47,107 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.61ms. Allocated memory is still 176.2MB. Free memory was 120.1MB in the beginning and 106.8MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 12:12:47,107 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.88ms. Allocated memory is still 176.2MB. Free memory was 106.8MB in the beginning and 105.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 12:12:47,107 INFO L158 Benchmark]: Boogie Preprocessor took 48.11ms. Allocated memory is still 176.2MB. Free memory was 105.4MB in the beginning and 103.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 12:12:47,107 INFO L158 Benchmark]: RCFGBuilder took 338.50ms. Allocated memory is still 176.2MB. Free memory was 103.4MB in the beginning and 90.1MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 12:12:47,108 INFO L158 Benchmark]: TraceAbstraction took 5369.51ms. Allocated memory was 176.2MB in the beginning and 247.5MB in the end (delta: 71.3MB). Free memory was 89.4MB in the beginning and 101.5MB in the end (delta: -12.1MB). Peak memory consumption was 60.9MB. Max. memory is 16.1GB. [2024-11-09 12:12:47,108 INFO L158 Benchmark]: Witness Printer took 108.19ms. Allocated memory is still 247.5MB. Free memory was 101.5MB in the beginning and 97.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 12:12:47,110 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.88ms. Allocated memory is still 176.2MB. Free memory is still 139.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 297.61ms. Allocated memory is still 176.2MB. Free memory was 120.1MB in the beginning and 106.8MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.88ms. Allocated memory is still 176.2MB. Free memory was 106.8MB in the beginning and 105.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.11ms. Allocated memory is still 176.2MB. Free memory was 105.4MB in the beginning and 103.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 338.50ms. Allocated memory is still 176.2MB. Free memory was 103.4MB in the beginning and 90.1MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5369.51ms. Allocated memory was 176.2MB in the beginning and 247.5MB in the end (delta: 71.3MB). Free memory was 89.4MB in the beginning and 101.5MB in the end (delta: -12.1MB). Peak memory consumption was 60.9MB. Max. memory is 16.1GB. * Witness Printer took 108.19ms. Allocated memory is still 247.5MB. Free memory was 101.5MB in the beginning and 97.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 50 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 186 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 162 mSDsluCounter, 975 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 724 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 990 IncrementalHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 251 mSDtfsCounter, 990 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=0, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 12 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 289 NumberOfCodeBlocks, 289 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 276 ConstructedInterpolants, 0 QuantifiedInterpolants, 938 SizeOfPredicates, 8 NumberOfNonLiveVariables, 335 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 44/57 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - ProcedureContractResult [Line: 3]: Procedure Contract for reach_error Derived contract for procedure reach_error. Ensures: 0 - ProcedureContractResult [Line: 32]: Procedure Contract for divides Derived contract for procedure divides. Requires: ((m <= 2147483647) && (1 <= n)) Ensures: ((m <= 2147483647) && (1 <= n)) - ProcedureContractResult [Line: 17]: Procedure Contract for gcd Derived contract for procedure gcd. Requires: ((y1 <= 2147483647) && (y2 <= 2147483647)) Ensures: (((y1 <= 2147483647) && (1 <= \result)) && (y2 <= 2147483647)) RESULT: Ultimate proved your program to be correct! [2024-11-09 12:12:47,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE