./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/MutualRecursion_1b.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted/MutualRecursion_1b.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ae72b099a35703f32ba85203e91200ae10b1da6ed5d35f42555b4b072fd32a75 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 16:45:16,279 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 16:45:16,339 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-12 16:45:16,344 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 16:45:16,346 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 16:45:16,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 16:45:16,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 16:45:16,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 16:45:16,372 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 16:45:16,375 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 16:45:16,375 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 16:45:16,376 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 16:45:16,376 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 16:45:16,376 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 16:45:16,377 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 16:45:16,378 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 16:45:16,378 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 16:45:16,378 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 16:45:16,378 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 16:45:16,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 16:45:16,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 16:45:16,379 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 16:45:16,379 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 16:45:16,380 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 16:45:16,380 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 16:45:16,380 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 16:45:16,380 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 16:45:16,380 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 16:45:16,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 16:45:16,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 16:45:16,381 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 16:45:16,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:45:16,381 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 16:45:16,381 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 16:45:16,381 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 16:45:16,381 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 16:45:16,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 16:45:16,382 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 16:45:16,382 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 16:45:16,382 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 16:45:16,382 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 16:45:16,385 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ae72b099a35703f32ba85203e91200ae10b1da6ed5d35f42555b4b072fd32a75 [2024-11-12 16:45:16,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 16:45:16,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 16:45:16,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 16:45:16,624 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 16:45:16,624 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 16:45:16,625 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/MutualRecursion_1b.c [2024-11-12 16:45:17,950 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 16:45:18,095 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 16:45:18,096 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/MutualRecursion_1b.c [2024-11-12 16:45:18,101 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dff5611e0/81df5bcaaac747c6a2576ee0a8b73d08/FLAGde71b3ac0 [2024-11-12 16:45:18,514 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dff5611e0/81df5bcaaac747c6a2576ee0a8b73d08 [2024-11-12 16:45:18,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 16:45:18,517 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 16:45:18,519 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 16:45:18,519 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 16:45:18,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 16:45:18,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:45:18" (1/1) ... [2024-11-12 16:45:18,530 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41ca861b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:18, skipping insertion in model container [2024-11-12 16:45:18,530 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:45:18" (1/1) ... [2024-11-12 16:45:18,543 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 16:45:18,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:45:18,692 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 16:45:18,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:45:18,717 INFO L204 MainTranslator]: Completed translation [2024-11-12 16:45:18,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:18 WrapperNode [2024-11-12 16:45:18,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 16:45:18,718 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 16:45:18,718 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 16:45:18,718 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 16:45:18,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:18" (1/1) ... [2024-11-12 16:45:18,727 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:18" (1/1) ... [2024-11-12 16:45:18,737 INFO L138 Inliner]: procedures = 6, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 9 [2024-11-12 16:45:18,738 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 16:45:18,738 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 16:45:18,738 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 16:45:18,739 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 16:45:18,745 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:18" (1/1) ... [2024-11-12 16:45:18,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:18" (1/1) ... [2024-11-12 16:45:18,747 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:18" (1/1) ... [2024-11-12 16:45:18,751 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-12 16:45:18,755 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:18" (1/1) ... [2024-11-12 16:45:18,755 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:18" (1/1) ... [2024-11-12 16:45:18,757 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:18" (1/1) ... [2024-11-12 16:45:18,758 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:18" (1/1) ... [2024-11-12 16:45:18,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:18" (1/1) ... [2024-11-12 16:45:18,758 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:18" (1/1) ... [2024-11-12 16:45:18,759 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 16:45:18,760 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 16:45:18,760 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 16:45:18,760 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 16:45:18,762 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:18" (1/1) ... [2024-11-12 16:45:18,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:45:18,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:45:18,796 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-12 16:45:18,803 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-12 16:45:18,855 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-12 16:45:18,856 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-12 16:45:18,856 INFO L130 BoogieDeclarations]: Found specification of procedure g [2024-11-12 16:45:18,856 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2024-11-12 16:45:18,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 16:45:18,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 16:45:18,934 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 16:45:18,936 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 16:45:19,073 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-12 16:45:19,073 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 16:45:19,085 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 16:45:19,085 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 16:45:19,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:45:19 BoogieIcfgContainer [2024-11-12 16:45:19,085 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 16:45:19,087 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 16:45:19,087 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 16:45:19,090 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 16:45:19,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:45:18" (1/3) ... [2024-11-12 16:45:19,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa8d527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:45:19, skipping insertion in model container [2024-11-12 16:45:19,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:18" (2/3) ... [2024-11-12 16:45:19,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa8d527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:45:19, skipping insertion in model container [2024-11-12 16:45:19,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:45:19" (3/3) ... [2024-11-12 16:45:19,092 INFO L112 eAbstractionObserver]: Analyzing ICFG MutualRecursion_1b.c [2024-11-12 16:45:19,105 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 16:45:19,105 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-11-12 16:45:19,146 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 16:45:19,151 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;@7fb91ee7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 16:45:19,152 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-11-12 16:45:19,155 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 25 states have (on average 1.48) internal successors, (37), 35 states have internal predecessors, (37), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-12 16:45:19,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 16:45:19,159 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:45:19,160 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 16:45:19,162 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-11-12 16:45:19,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:45:19,167 INFO L85 PathProgramCache]: Analyzing trace with hash 2073143902, now seen corresponding path program 1 times [2024-11-12 16:45:19,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:45:19,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035177090] [2024-11-12 16:45:19,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:45:19,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:45:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:19,345 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-12 16:45:19,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:45:19,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035177090] [2024-11-12 16:45:19,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035177090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:45:19,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:45:19,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:45:19,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076687807] [2024-11-12 16:45:19,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:45:19,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:45:19,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:45:19,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:45:19,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:45:19,391 INFO L87 Difference]: Start difference. First operand has 43 states, 25 states have (on average 1.48) internal successors, (37), 35 states have internal predecessors, (37), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-12 16:45:19,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:45:19,431 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2024-11-12 16:45:19,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:45:19,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2024-11-12 16:45:19,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:45:19,439 INFO L225 Difference]: With dead ends: 45 [2024-11-12 16:45:19,440 INFO L226 Difference]: Without dead ends: 39 [2024-11-12 16:45:19,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:45:19,445 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 11 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:45:19,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 74 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:45:19,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-12 16:45:19,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2024-11-12 16:45:19,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 30 states have internal predecessors, (32), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 16:45:19,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2024-11-12 16:45:19,477 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 6 [2024-11-12 16:45:19,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:45:19,477 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-11-12 16:45:19,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-12 16:45:19,478 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2024-11-12 16:45:19,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 16:45:19,478 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:45:19,479 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:45:19,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 16:45:19,479 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-11-12 16:45:19,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:45:19,480 INFO L85 PathProgramCache]: Analyzing trace with hash -157048422, now seen corresponding path program 1 times [2024-11-12 16:45:19,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:45:19,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502124296] [2024-11-12 16:45:19,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:45:19,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:45:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:19,557 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-12 16:45:19,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:45:19,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502124296] [2024-11-12 16:45:19,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502124296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:45:19,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:45:19,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:45:19,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330511027] [2024-11-12 16:45:19,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:45:19,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:45:19,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:45:19,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:45:19,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:45:19,565 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-12 16:45:19,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:45:19,645 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2024-11-12 16:45:19,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:45:19,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 7 [2024-11-12 16:45:19,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:45:19,646 INFO L225 Difference]: With dead ends: 57 [2024-11-12 16:45:19,646 INFO L226 Difference]: Without dead ends: 51 [2024-11-12 16:45:19,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:45:19,648 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 24 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:45:19,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 138 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:45:19,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-12 16:45:19,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2024-11-12 16:45:19,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.34375) internal successors, (43), 39 states have internal predecessors, (43), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 16:45:19,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2024-11-12 16:45:19,655 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 7 [2024-11-12 16:45:19,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:45:19,656 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2024-11-12 16:45:19,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-12 16:45:19,656 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2024-11-12 16:45:19,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-12 16:45:19,660 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:45:19,660 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:45:19,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 16:45:19,660 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-11-12 16:45:19,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:45:19,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1776336168, now seen corresponding path program 1 times [2024-11-12 16:45:19,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:45:19,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260230118] [2024-11-12 16:45:19,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:45:19,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:45:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:19,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:45:19,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:45:19,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260230118] [2024-11-12 16:45:19,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260230118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:45:19,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:45:19,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 16:45:19,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123530992] [2024-11-12 16:45:19,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:45:19,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 16:45:19,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:45:19,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 16:45:19,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-12 16:45:19,780 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:45:19,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:45:19,973 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2024-11-12 16:45:19,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 16:45:19,973 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-12 16:45:19,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:45:19,974 INFO L225 Difference]: With dead ends: 71 [2024-11-12 16:45:19,974 INFO L226 Difference]: Without dead ends: 68 [2024-11-12 16:45:19,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-12 16:45:19,976 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 69 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:45:19,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 179 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:45:19,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-12 16:45:19,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2024-11-12 16:45:19,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 43 states have (on average 1.255813953488372) internal successors, (54), 47 states have internal predecessors, (54), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 16:45:19,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2024-11-12 16:45:19,989 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 15 [2024-11-12 16:45:19,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:45:19,989 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2024-11-12 16:45:19,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:45:19,990 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2024-11-12 16:45:19,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 16:45:19,990 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:45:19,990 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:45:19,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 16:45:19,991 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-11-12 16:45:19,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:45:19,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1957494335, now seen corresponding path program 1 times [2024-11-12 16:45:19,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:45:19,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627624077] [2024-11-12 16:45:19,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:45:19,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:45:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:20,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 16:45:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:20,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 16:45:20,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:45:20,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627624077] [2024-11-12 16:45:20,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627624077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:45:20,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:45:20,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:45:20,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393368396] [2024-11-12 16:45:20,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:45:20,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:45:20,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:45:20,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:45:20,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:45:20,039 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 1 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-12 16:45:20,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:45:20,056 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2024-11-12 16:45:20,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:45:20,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 1 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 17 [2024-11-12 16:45:20,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:45:20,057 INFO L225 Difference]: With dead ends: 62 [2024-11-12 16:45:20,058 INFO L226 Difference]: Without dead ends: 61 [2024-11-12 16:45:20,058 INFO L434 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-12 16:45:20,059 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 8 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:45:20,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 64 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:45:20,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-12 16:45:20,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2024-11-12 16:45:20,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 46 states have internal predecessors, (53), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 16:45:20,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2024-11-12 16:45:20,067 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 17 [2024-11-12 16:45:20,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:45:20,067 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2024-11-12 16:45:20,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 1 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-12 16:45:20,068 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2024-11-12 16:45:20,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-12 16:45:20,068 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:45:20,069 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:45:20,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 16:45:20,069 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-11-12 16:45:20,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:45:20,069 INFO L85 PathProgramCache]: Analyzing trace with hash 2114816930, now seen corresponding path program 1 times [2024-11-12 16:45:20,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:45:20,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045761072] [2024-11-12 16:45:20,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:45:20,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:45:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:20,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-12 16:45:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:20,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 16:45:20,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:20,194 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 16:45:20,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:45:20,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045761072] [2024-11-12 16:45:20,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045761072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:45:20,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:45:20,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:45:20,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953567860] [2024-11-12 16:45:20,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:45:20,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:45:20,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:45:20,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:45:20,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:45:20,196 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 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-12 16:45:20,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:45:20,244 INFO L93 Difference]: Finished difference Result 92 states and 123 transitions. [2024-11-12 16:45:20,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:45:20,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 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 22 [2024-11-12 16:45:20,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:45:20,246 INFO L225 Difference]: With dead ends: 92 [2024-11-12 16:45:20,246 INFO L226 Difference]: Without dead ends: 91 [2024-11-12 16:45:20,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:45:20,247 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:45:20,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 123 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:45:20,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-12 16:45:20,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2024-11-12 16:45:20,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 60 states have internal predecessors, (69), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (20), 14 states have call predecessors, (20), 11 states have call successors, (20) [2024-11-12 16:45:20,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 101 transitions. [2024-11-12 16:45:20,257 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 101 transitions. Word has length 22 [2024-11-12 16:45:20,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:45:20,257 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 101 transitions. [2024-11-12 16:45:20,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 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-12 16:45:20,258 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 101 transitions. [2024-11-12 16:45:20,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-12 16:45:20,258 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:45:20,258 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:45:20,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 16:45:20,259 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-11-12 16:45:20,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:45:20,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1134815458, now seen corresponding path program 1 times [2024-11-12 16:45:20,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:45:20,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896903213] [2024-11-12 16:45:20,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:45:20,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:45:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:20,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-12 16:45:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:20,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 16:45:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:20,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 16:45:20,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:45:20,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896903213] [2024-11-12 16:45:20,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896903213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:45:20,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:45:20,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:45:20,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373563089] [2024-11-12 16:45:20,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:45:20,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:45:20,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:45:20,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:45:20,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:45:20,325 INFO L87 Difference]: Start difference. First operand 79 states and 101 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 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-12 16:45:20,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:45:20,359 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2024-11-12 16:45:20,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:45:20,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 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 23 [2024-11-12 16:45:20,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:45:20,360 INFO L225 Difference]: With dead ends: 92 [2024-11-12 16:45:20,361 INFO L226 Difference]: Without dead ends: 88 [2024-11-12 16:45:20,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:45:20,362 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:45:20,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 131 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:45:20,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-12 16:45:20,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2024-11-12 16:45:20,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 61 states have internal predecessors, (69), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (19), 13 states have call predecessors, (19), 11 states have call successors, (19) [2024-11-12 16:45:20,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2024-11-12 16:45:20,400 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 23 [2024-11-12 16:45:20,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:45:20,400 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2024-11-12 16:45:20,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 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-12 16:45:20,401 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2024-11-12 16:45:20,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-12 16:45:20,401 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:45:20,401 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:45:20,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 16:45:20,402 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-11-12 16:45:20,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:45:20,402 INFO L85 PathProgramCache]: Analyzing trace with hash -90939109, now seen corresponding path program 1 times [2024-11-12 16:45:20,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:45:20,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325528094] [2024-11-12 16:45:20,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:45:20,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:45:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:20,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-12 16:45:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:20,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-12 16:45:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:20,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 16:45:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:20,531 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 16:45:20,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:45:20,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325528094] [2024-11-12 16:45:20,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325528094] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:45:20,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605569581] [2024-11-12 16:45:20,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:45:20,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:45:20,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:45:20,535 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-12 16:45:20,539 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-12 16:45:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:20,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 16:45:20,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:45:20,656 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 16:45:20,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:45:20,773 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-12 16:45:20,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605569581] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:45:20,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:45:20,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 14 [2024-11-12 16:45:20,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798757060] [2024-11-12 16:45:20,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:45:20,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 16:45:20,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:45:20,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 16:45:20,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-12 16:45:20,775 INFO L87 Difference]: Start difference. First operand 79 states and 100 transitions. Second operand has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 5 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-12 16:45:20,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:45:20,923 INFO L93 Difference]: Finished difference Result 194 states and 256 transitions. [2024-11-12 16:45:20,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 16:45:20,924 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 5 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 33 [2024-11-12 16:45:20,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:45:20,925 INFO L225 Difference]: With dead ends: 194 [2024-11-12 16:45:20,925 INFO L226 Difference]: Without dead ends: 119 [2024-11-12 16:45:20,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2024-11-12 16:45:20,927 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 79 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:45:20,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 217 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:45:20,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-12 16:45:20,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 100. [2024-11-12 16:45:20,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 77 states have internal predecessors, (85), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (25), 16 states have call predecessors, (25), 13 states have call successors, (25) [2024-11-12 16:45:20,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 124 transitions. [2024-11-12 16:45:20,939 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 124 transitions. Word has length 33 [2024-11-12 16:45:20,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:45:20,939 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 124 transitions. [2024-11-12 16:45:20,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 5 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-12 16:45:20,939 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 124 transitions. [2024-11-12 16:45:20,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-12 16:45:20,941 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:45:20,941 INFO L218 NwaCegarLoop]: trace histogram [9, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-12 16:45:20,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 16:45:21,142 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-12 16:45:21,143 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-11-12 16:45:21,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:45:21,143 INFO L85 PathProgramCache]: Analyzing trace with hash 2010218574, now seen corresponding path program 1 times [2024-11-12 16:45:21,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:45:21,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245214300] [2024-11-12 16:45:21,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:45:21,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:45:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:21,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-12 16:45:21,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:21,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 16:45:21,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:21,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 16:45:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:21,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-12 16:45:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:21,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 16:45:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:21,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 16:45:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:21,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 16:45:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:21,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 16:45:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:21,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 16:45:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:21,346 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2024-11-12 16:45:21,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:45:21,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245214300] [2024-11-12 16:45:21,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245214300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:45:21,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:45:21,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 16:45:21,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563790566] [2024-11-12 16:45:21,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:45:21,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 16:45:21,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:45:21,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 16:45:21,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 16:45:21,349 INFO L87 Difference]: Start difference. First operand 100 states and 124 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-12 16:45:21,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:45:21,399 INFO L93 Difference]: Finished difference Result 100 states and 124 transitions. [2024-11-12 16:45:21,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 16:45:21,399 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 103 [2024-11-12 16:45:21,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:45:21,400 INFO L225 Difference]: With dead ends: 100 [2024-11-12 16:45:21,400 INFO L226 Difference]: Without dead ends: 98 [2024-11-12 16:45:21,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-12 16:45:21,401 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:45:21,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 153 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:45:21,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-12 16:45:21,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-12 16:45:21,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (25), 16 states have call predecessors, (25), 13 states have call successors, (25) [2024-11-12 16:45:21,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2024-11-12 16:45:21,410 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 103 [2024-11-12 16:45:21,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:45:21,411 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 119 transitions. [2024-11-12 16:45:21,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-12 16:45:21,411 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2024-11-12 16:45:21,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-12 16:45:21,416 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:45:21,416 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:45:21,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 16:45:21,416 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-11-12 16:45:21,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:45:21,421 INFO L85 PathProgramCache]: Analyzing trace with hash -973702848, now seen corresponding path program 1 times [2024-11-12 16:45:21,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:45:21,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806479232] [2024-11-12 16:45:21,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:45:21,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:45:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:21,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-12 16:45:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:21,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 16:45:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:21,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 16:45:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:21,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 16:45:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:21,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 16:45:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:21,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 16:45:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:45:21,581 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-12 16:45:21,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:45:21,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806479232] [2024-11-12 16:45:21,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806479232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:45:21,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:45:21,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 16:45:21,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930442324] [2024-11-12 16:45:21,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:45:21,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 16:45:21,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:45:21,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 16:45:21,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 16:45:21,584 INFO L87 Difference]: Start difference. First operand 98 states and 119 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 16:45:21,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:45:21,624 INFO L93 Difference]: Finished difference Result 98 states and 119 transitions. [2024-11-12 16:45:21,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 16:45:21,624 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 70 [2024-11-12 16:45:21,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:45:21,625 INFO L225 Difference]: With dead ends: 98 [2024-11-12 16:45:21,625 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 16:45:21,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-12 16:45:21,626 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:45:21,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 153 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:45:21,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 16:45:21,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 16:45:21,627 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-12 16:45:21,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 16:45:21,627 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2024-11-12 16:45:21,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:45:21,628 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 16:45:21,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 16:45:21,628 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 16:45:21,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 16:45:21,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2024-11-12 16:45:21,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2024-11-12 16:45:21,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2024-11-12 16:45:21,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2024-11-12 16:45:21,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2024-11-12 16:45:21,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2024-11-12 16:45:21,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2024-11-12 16:45:21,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2024-11-12 16:45:21,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2024-11-12 16:45:21,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2024-11-12 16:45:21,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 16:45:21,636 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:45:21,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-12 16:45:21,843 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 16:45:21,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:45:21 BoogieIcfgContainer [2024-11-12 16:45:21,863 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 16:45:21,863 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 16:45:21,863 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 16:45:21,863 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 16:45:21,864 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:45:19" (3/4) ... [2024-11-12 16:45:21,866 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 16:45:21,869 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2024-11-12 16:45:21,869 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2024-11-12 16:45:21,872 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-12 16:45:21,872 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 16:45:21,872 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-12 16:45:21,932 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 16:45:21,932 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 16:45:21,932 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 16:45:21,933 INFO L158 Benchmark]: Toolchain (without parser) took 3415.54ms. Allocated memory was 151.0MB in the beginning and 220.2MB in the end (delta: 69.2MB). Free memory was 77.7MB in the beginning and 121.9MB in the end (delta: -44.2MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2024-11-12 16:45:21,933 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 151.0MB. Free memory is still 101.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:45:21,933 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.19ms. Allocated memory is still 151.0MB. Free memory was 77.6MB in the beginning and 66.2MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-12 16:45:21,933 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.44ms. Allocated memory is still 151.0MB. Free memory was 66.2MB in the beginning and 65.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 16:45:21,934 INFO L158 Benchmark]: Boogie Preprocessor took 21.00ms. Allocated memory is still 151.0MB. Free memory was 65.0MB in the beginning and 63.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:45:21,934 INFO L158 Benchmark]: RCFGBuilder took 325.82ms. Allocated memory was 151.0MB in the beginning and 220.2MB in the end (delta: 69.2MB). Free memory was 63.4MB in the beginning and 185.7MB in the end (delta: -122.3MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2024-11-12 16:45:21,934 INFO L158 Benchmark]: TraceAbstraction took 2775.68ms. Allocated memory is still 220.2MB. Free memory was 185.7MB in the beginning and 126.1MB in the end (delta: 59.6MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. [2024-11-12 16:45:21,934 INFO L158 Benchmark]: Witness Printer took 69.07ms. Allocated memory is still 220.2MB. Free memory was 126.1MB in the beginning and 121.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 16:45:21,935 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.21ms. Allocated memory is still 151.0MB. Free memory is still 101.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 199.19ms. Allocated memory is still 151.0MB. Free memory was 77.6MB in the beginning and 66.2MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.44ms. Allocated memory is still 151.0MB. Free memory was 66.2MB in the beginning and 65.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.00ms. Allocated memory is still 151.0MB. Free memory was 65.0MB in the beginning and 63.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 325.82ms. Allocated memory was 151.0MB in the beginning and 220.2MB in the end (delta: 69.2MB). Free memory was 63.4MB in the beginning and 185.7MB in the end (delta: -122.3MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2775.68ms. Allocated memory is still 220.2MB. Free memory was 185.7MB in the beginning and 126.1MB in the end (delta: 59.6MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. * Witness Printer took 69.07ms. Allocated memory is still 220.2MB. Free memory was 126.1MB in the beginning and 121.9MB 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: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: 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 3 procedures, 43 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 9, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 226 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 209 mSDsluCounter, 1232 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 944 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 550 IncrementalHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 288 mSDtfsCounter, 550 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 186 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=7, InterpolantAutomatonStates: 59, 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, 9 MinimizatonAttempts, 54 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 329 NumberOfCodeBlocks, 329 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 351 ConstructedInterpolants, 0 QuantifiedInterpolants, 663 SizeOfPredicates, 1 NumberOfNonLiveVariables, 68 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 332/337 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 10 specifications checked. All of them hold - ProcedureContractResult [Line: 11]: Procedure Contract for f Derived contract for procedure f. Requires: (x <= 2147483645) Ensures: ((x <= 2147483645) && (\result == 0)) - ProcedureContractResult [Line: 17]: Procedure Contract for g Derived contract for procedure g. Requires: (x <= 2147483647) Ensures: ((x <= 2147483647) && ((x < 1) || (\result == 0))) RESULT: Ultimate proved your program to be correct! [2024-11-12 16:45:21,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE