./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/McCarthy91_Recursion.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/McCarthy91_Recursion.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 b4d53423478efbe88c69a2c2de1bb984f61e7e586fd7bb6761452f26ace425f7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:57:44,139 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:57:44,194 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-13 12:57:44,197 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:57:44,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:57:44,222 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:57:44,222 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:57:44,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:57:44,223 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:57:44,224 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:57:44,224 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:57:44,224 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:57:44,225 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:57:44,226 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:57:44,227 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:57:44,227 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:57:44,227 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 12:57:44,227 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:57:44,227 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:57:44,228 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 12:57:44,228 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:57:44,230 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 12:57:44,231 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:57:44,231 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 12:57:44,231 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:57:44,231 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 12:57:44,231 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:57:44,232 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:57:44,232 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:57:44,232 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:57:44,232 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:57:44,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:57:44,232 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:57:44,233 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:57:44,233 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 12:57:44,233 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:57:44,233 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:57:44,233 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:57:44,233 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:57:44,234 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:57:44,234 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:57:44,235 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 -> b4d53423478efbe88c69a2c2de1bb984f61e7e586fd7bb6761452f26ace425f7 [2024-10-13 12:57:44,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:57:44,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:57:44,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:57:44,465 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:57:44,465 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:57:44,466 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/McCarthy91_Recursion.c [2024-10-13 12:57:45,812 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:57:45,942 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:57:45,942 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/McCarthy91_Recursion.c [2024-10-13 12:57:45,947 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/998ec2a96/4c39588d855d41c28c5d8a176bbbdc42/FLAGc10adf2c8 [2024-10-13 12:57:46,365 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/998ec2a96/4c39588d855d41c28c5d8a176bbbdc42 [2024-10-13 12:57:46,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:57:46,369 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:57:46,370 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:57:46,370 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:57:46,374 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:57:46,375 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:57:46" (1/1) ... [2024-10-13 12:57:46,376 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@519b6fe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:46, skipping insertion in model container [2024-10-13 12:57:46,376 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:57:46" (1/1) ... [2024-10-13 12:57:46,390 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:57:46,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:57:46,543 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:57:46,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:57:46,566 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:57:46,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:46 WrapperNode [2024-10-13 12:57:46,567 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:57:46,568 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:57:46,568 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:57:46,568 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:57:46,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:46" (1/1) ... [2024-10-13 12:57:46,578 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:46" (1/1) ... [2024-10-13 12:57:46,590 INFO L138 Inliner]: procedures = 5, calls = 5, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 9 [2024-10-13 12:57:46,591 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:57:46,592 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:57:46,592 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:57:46,592 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:57:46,600 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:46" (1/1) ... [2024-10-13 12:57:46,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:46" (1/1) ... [2024-10-13 12:57:46,601 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:46" (1/1) ... [2024-10-13 12:57:46,607 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-13 12:57:46,607 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:46" (1/1) ... [2024-10-13 12:57:46,607 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:46" (1/1) ... [2024-10-13 12:57:46,608 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:46" (1/1) ... [2024-10-13 12:57:46,609 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:46" (1/1) ... [2024-10-13 12:57:46,610 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:46" (1/1) ... [2024-10-13 12:57:46,610 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:46" (1/1) ... [2024-10-13 12:57:46,611 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:57:46,612 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:57:46,612 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:57:46,612 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:57:46,613 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:46" (1/1) ... [2024-10-13 12:57:46,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:57:46,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:57:46,677 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-10-13 12:57:46,679 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-10-13 12:57:46,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:57:46,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:57:46,714 INFO L130 BoogieDeclarations]: Found specification of procedure mc91 [2024-10-13 12:57:46,714 INFO L138 BoogieDeclarations]: Found implementation of procedure mc91 [2024-10-13 12:57:46,788 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:57:46,791 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:57:46,896 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-10-13 12:57:46,896 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:57:46,914 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:57:46,914 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 12:57:46,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:57:46 BoogieIcfgContainer [2024-10-13 12:57:46,915 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:57:46,917 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:57:46,917 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:57:46,920 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:57:46,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:57:46" (1/3) ... [2024-10-13 12:57:46,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef68598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:57:46, skipping insertion in model container [2024-10-13 12:57:46,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:46" (2/3) ... [2024-10-13 12:57:46,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef68598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:57:46, skipping insertion in model container [2024-10-13 12:57:46,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:57:46" (3/3) ... [2024-10-13 12:57:46,922 INFO L112 eAbstractionObserver]: Analyzing ICFG McCarthy91_Recursion.c [2024-10-13 12:57:46,933 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:57:46,934 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-13 12:57:46,982 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:57:46,988 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;@63af79fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:57:46,989 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-13 12:57:46,992 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 12:57:46,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 12:57:46,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:57:46,998 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 12:57:46,998 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 12:57:47,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:57:47,003 INFO L85 PathProgramCache]: Analyzing trace with hash 58964590, now seen corresponding path program 1 times [2024-10-13 12:57:47,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:57:47,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119096641] [2024-10-13 12:57:47,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:57:47,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:57:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:57:47,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:57:47,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:57:47,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119096641] [2024-10-13 12:57:47,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119096641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:57:47,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:57:47,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:57:47,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153313806] [2024-10-13 12:57:47,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:57:47,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:57:47,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:57:47,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:57:47,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:57:47,215 INFO L87 Difference]: Start difference. First operand has 20 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-10-13 12:57:47,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:57:47,321 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2024-10-13 12:57:47,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:57:47,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2024-10-13 12:57:47,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:57:47,333 INFO L225 Difference]: With dead ends: 38 [2024-10-13 12:57:47,333 INFO L226 Difference]: Without dead ends: 35 [2024-10-13 12:57:47,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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-10-13 12:57:47,339 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 21 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:57:47,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 33 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:57:47,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-13 12:57:47,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2024-10-13 12:57:47,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 23 states have internal predecessors, (28), 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-10-13 12:57:47,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-10-13 12:57:47,390 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 5 [2024-10-13 12:57:47,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:57:47,391 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-10-13 12:57:47,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-10-13 12:57:47,391 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-10-13 12:57:47,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 12:57:47,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:57:47,392 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 12:57:47,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 12:57:47,393 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 12:57:47,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:57:47,395 INFO L85 PathProgramCache]: Analyzing trace with hash 58964430, now seen corresponding path program 1 times [2024-10-13 12:57:47,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:57:47,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586593144] [2024-10-13 12:57:47,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:57:47,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:57:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:57:47,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:57:47,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:57:47,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586593144] [2024-10-13 12:57:47,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586593144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:57:47,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:57:47,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:57:47,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746432298] [2024-10-13 12:57:47,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:57:47,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:57:47,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:57:47,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:57:47,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:57:47,449 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-13 12:57:47,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:57:47,473 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2024-10-13 12:57:47,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:57:47,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2024-10-13 12:57:47,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:57:47,474 INFO L225 Difference]: With dead ends: 30 [2024-10-13 12:57:47,474 INFO L226 Difference]: Without dead ends: 29 [2024-10-13 12:57:47,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:57:47,475 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:57:47,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 23 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:57:47,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-13 12:57:47,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-13 12:57:47,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.368421052631579) internal successors, (26), 22 states have internal predecessors, (26), 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-10-13 12:57:47,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-10-13 12:57:47,487 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 5 [2024-10-13 12:57:47,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:57:47,488 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-10-13 12:57:47,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-13 12:57:47,488 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-10-13 12:57:47,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 12:57:47,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:57:47,489 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 12:57:47,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 12:57:47,489 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting mc91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 12:57:47,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:57:47,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1827902340, now seen corresponding path program 1 times [2024-10-13 12:57:47,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:57:47,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691924806] [2024-10-13 12:57:47,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:57:47,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:57:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:57:47,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:57:47,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:57:47,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691924806] [2024-10-13 12:57:47,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691924806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:57:47,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:57:47,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:57:47,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965921349] [2024-10-13 12:57:47,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:57:47,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:57:47,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:57:47,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:57:47,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:57:47,526 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. 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-10-13 12:57:47,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:57:47,552 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2024-10-13 12:57:47,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:57:47,552 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-10-13 12:57:47,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:57:47,553 INFO L225 Difference]: With dead ends: 33 [2024-10-13 12:57:47,553 INFO L226 Difference]: Without dead ends: 32 [2024-10-13 12:57:47,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:57:47,554 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:57:47,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 21 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:57:47,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-13 12:57:47,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-10-13 12:57:47,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 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-10-13 12:57:47,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2024-10-13 12:57:47,565 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 6 [2024-10-13 12:57:47,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:57:47,566 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-10-13 12:57:47,566 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-10-13 12:57:47,566 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2024-10-13 12:57:47,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 12:57:47,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:57:47,569 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 12:57:47,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 12:57:47,570 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 12:57:47,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:57:47,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1827897375, now seen corresponding path program 1 times [2024-10-13 12:57:47,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:57:47,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787224012] [2024-10-13 12:57:47,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:57:47,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:57:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:57:47,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:57:47,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:57:47,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787224012] [2024-10-13 12:57:47,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787224012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:57:47,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:57:47,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:57:47,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114080570] [2024-10-13 12:57:47,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:57:47,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:57:47,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:57:47,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:57:47,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:57:47,614 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 5 states, 3 states have (on average 1.6666666666666667) 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-10-13 12:57:47,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:57:47,670 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2024-10-13 12:57:47,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:57:47,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) 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-10-13 12:57:47,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:57:47,673 INFO L225 Difference]: With dead ends: 47 [2024-10-13 12:57:47,674 INFO L226 Difference]: Without dead ends: 39 [2024-10-13 12:57:47,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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-10-13 12:57:47,676 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 21 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:57:47,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 41 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:57:47,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-13 12:57:47,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2024-10-13 12:57:47,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 12:57:47,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-10-13 12:57:47,684 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 6 [2024-10-13 12:57:47,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:57:47,685 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-10-13 12:57:47,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.6666666666666667) 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-10-13 12:57:47,685 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-10-13 12:57:47,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 12:57:47,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:57:47,686 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:57:47,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 12:57:47,686 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 12:57:47,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:57:47,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1876113307, now seen corresponding path program 1 times [2024-10-13 12:57:47,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:57:47,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111425888] [2024-10-13 12:57:47,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:57:47,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:57:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:57:47,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:57:47,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:57:47,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111425888] [2024-10-13 12:57:47,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111425888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:57:47,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:57:47,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:57:47,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972066883] [2024-10-13 12:57:47,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:57:47,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:57:47,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:57:47,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:57:47,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:57:47,731 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:57:47,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:57:47,786 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2024-10-13 12:57:47,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:57:47,787 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-13 12:57:47,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:57:47,788 INFO L225 Difference]: With dead ends: 55 [2024-10-13 12:57:47,788 INFO L226 Difference]: Without dead ends: 54 [2024-10-13 12:57:47,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:57:47,789 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 17 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:57:47,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 34 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:57:47,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-13 12:57:47,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2024-10-13 12:57:47,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 12:57:47,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-10-13 12:57:47,799 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 11 [2024-10-13 12:57:47,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:57:47,799 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-10-13 12:57:47,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:57:47,800 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2024-10-13 12:57:47,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 12:57:47,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:57:47,800 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:57:47,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 12:57:47,800 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 12:57:47,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:57:47,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1209770879, now seen corresponding path program 1 times [2024-10-13 12:57:47,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:57:47,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208652834] [2024-10-13 12:57:47,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:57:47,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:57:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:57:47,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 12:57:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:57:47,919 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 12:57:47,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:57:47,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208652834] [2024-10-13 12:57:47,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208652834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:57:47,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:57:47,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:57:47,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353192712] [2024-10-13 12:57:47,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:57:47,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 12:57:47,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:57:47,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 12:57:47,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:57:47,923 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 12:57:48,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:57:48,032 INFO L93 Difference]: Finished difference Result 100 states and 129 transitions. [2024-10-13 12:57:48,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 12:57:48,032 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 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 18 [2024-10-13 12:57:48,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:57:48,034 INFO L225 Difference]: With dead ends: 100 [2024-10-13 12:57:48,034 INFO L226 Difference]: Without dead ends: 99 [2024-10-13 12:57:48,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-13 12:57:48,035 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:57:48,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 63 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:57:48,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-13 12:57:48,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2024-10-13 12:57:48,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.15) internal successors, (69), 65 states have internal predecessors, (69), 19 states have call successors, (19), 6 states have call predecessors, (19), 8 states have return successors, (22), 17 states have call predecessors, (22), 16 states have call successors, (22) [2024-10-13 12:57:48,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 110 transitions. [2024-10-13 12:57:48,049 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 110 transitions. Word has length 18 [2024-10-13 12:57:48,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:57:48,049 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 110 transitions. [2024-10-13 12:57:48,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 12:57:48,049 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 110 transitions. [2024-10-13 12:57:48,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 12:57:48,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:57:48,050 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:57:48,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 12:57:48,050 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 12:57:48,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:57:48,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1151803500, now seen corresponding path program 1 times [2024-10-13 12:57:48,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:57:48,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489673534] [2024-10-13 12:57:48,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:57:48,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:57:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:57:48,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 12:57:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:57:48,147 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 12:57:48,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:57:48,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489673534] [2024-10-13 12:57:48,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489673534] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:57:48,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218630055] [2024-10-13 12:57:48,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:57:48,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:57:48,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:57:48,157 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-10-13 12:57:48,158 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-10-13 12:57:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:57:48,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 12:57:48,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:57:48,347 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:57:48,348 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:57:48,502 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:57:48,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218630055] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:57:48,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:57:48,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 22 [2024-10-13 12:57:48,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821027042] [2024-10-13 12:57:48,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:57:48,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-13 12:57:48,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:57:48,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-13 12:57:48,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2024-10-13 12:57:48,504 INFO L87 Difference]: Start difference. First operand 89 states and 110 transitions. Second operand has 23 states, 20 states have (on average 2.2) internal successors, (44), 18 states have internal predecessors, (44), 9 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 12:57:48,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:57:48,750 INFO L93 Difference]: Finished difference Result 98 states and 127 transitions. [2024-10-13 12:57:48,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 12:57:48,751 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 2.2) internal successors, (44), 18 states have internal predecessors, (44), 9 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 19 [2024-10-13 12:57:48,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:57:48,752 INFO L225 Difference]: With dead ends: 98 [2024-10-13 12:57:48,752 INFO L226 Difference]: Without dead ends: 97 [2024-10-13 12:57:48,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=260, Invalid=862, Unknown=0, NotChecked=0, Total=1122 [2024-10-13 12:57:48,753 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 68 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:57:48,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 33 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:57:48,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-13 12:57:48,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2024-10-13 12:57:48,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 64 states have internal predecessors, (67), 19 states have call successors, (19), 6 states have call predecessors, (19), 8 states have return successors, (22), 17 states have call predecessors, (22), 16 states have call successors, (22) [2024-10-13 12:57:48,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2024-10-13 12:57:48,775 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 19 [2024-10-13 12:57:48,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:57:48,776 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2024-10-13 12:57:48,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 2.2) internal successors, (44), 18 states have internal predecessors, (44), 9 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 12:57:48,776 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2024-10-13 12:57:48,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-13 12:57:48,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:57:48,778 INFO L215 NwaCegarLoop]: trace histogram [7, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-13 12:57:48,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 12:57:48,982 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-10-13 12:57:48,983 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 12:57:48,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:57:48,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1198476196, now seen corresponding path program 1 times [2024-10-13 12:57:48,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:57:48,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418479597] [2024-10-13 12:57:48,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:57:48,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:57:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:57:49,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-13 12:57:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:57:49,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 12:57:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:57:49,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 12:57:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:57:49,103 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-10-13 12:57:49,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:57:49,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418479597] [2024-10-13 12:57:49,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418479597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:57:49,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:57:49,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 12:57:49,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737658540] [2024-10-13 12:57:49,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:57:49,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 12:57:49,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:57:49,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 12:57:49,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 12:57:49,105 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 12:57:49,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:57:49,202 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2024-10-13 12:57:49,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 12:57:49,202 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-10-13 12:57:49,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:57:49,203 INFO L225 Difference]: With dead ends: 92 [2024-10-13 12:57:49,203 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 12:57:49,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-10-13 12:57:49,204 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 15 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:57:49,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 59 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:57:49,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 12:57:49,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 12:57:49,205 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-10-13 12:57:49,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 12:57:49,205 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2024-10-13 12:57:49,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:57:49,205 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 12:57:49,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 12:57:49,205 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 12:57:49,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 12:57:49,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-13 12:57:49,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-13 12:57:49,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-13 12:57:49,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mc91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-13 12:57:49,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 12:57:49,213 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:57:49,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 12:57:49,534 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 12:57:49,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:57:49 BoogieIcfgContainer [2024-10-13 12:57:49,549 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 12:57:49,550 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 12:57:49,550 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 12:57:49,550 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 12:57:49,550 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:57:46" (3/4) ... [2024-10-13 12:57:49,552 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 12:57:49,554 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure mc91 [2024-10-13 12:57:49,556 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-10-13 12:57:49,556 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 12:57:49,557 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-13 12:57:49,607 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 12:57:49,608 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 12:57:49,608 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 12:57:49,608 INFO L158 Benchmark]: Toolchain (without parser) took 3239.68ms. Allocated memory was 153.1MB in the beginning and 232.8MB in the end (delta: 79.7MB). Free memory was 81.5MB in the beginning and 191.6MB in the end (delta: -110.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:57:49,608 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 153.1MB. Free memory is still 103.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:57:49,609 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.69ms. Allocated memory is still 153.1MB. Free memory was 81.3MB in the beginning and 70.5MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 12:57:49,609 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.54ms. Allocated memory is still 153.1MB. Free memory was 70.5MB in the beginning and 69.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:57:49,609 INFO L158 Benchmark]: Boogie Preprocessor took 19.38ms. Allocated memory is still 153.1MB. Free memory was 69.2MB in the beginning and 67.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:57:49,609 INFO L158 Benchmark]: RCFGBuilder took 303.16ms. Allocated memory was 153.1MB in the beginning and 232.8MB in the end (delta: 79.7MB). Free memory was 67.8MB in the beginning and 199.6MB in the end (delta: -131.9MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2024-10-13 12:57:49,609 INFO L158 Benchmark]: TraceAbstraction took 2632.44ms. Allocated memory is still 232.8MB. Free memory was 199.6MB in the beginning and 195.8MB in the end (delta: 3.9MB). Peak memory consumption was 132.8MB. Max. memory is 16.1GB. [2024-10-13 12:57:49,610 INFO L158 Benchmark]: Witness Printer took 57.95ms. Allocated memory is still 232.8MB. Free memory was 195.8MB in the beginning and 191.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 12:57:49,611 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.14ms. Allocated memory is still 153.1MB. Free memory is still 103.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.69ms. Allocated memory is still 153.1MB. Free memory was 81.3MB in the beginning and 70.5MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.54ms. Allocated memory is still 153.1MB. Free memory was 70.5MB in the beginning and 69.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.38ms. Allocated memory is still 153.1MB. Free memory was 69.2MB in the beginning and 67.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 303.16ms. Allocated memory was 153.1MB in the beginning and 232.8MB in the end (delta: 79.7MB). Free memory was 67.8MB in the beginning and 199.6MB in the end (delta: -131.9MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2632.44ms. Allocated memory is still 232.8MB. Free memory was 199.6MB in the beginning and 195.8MB in the end (delta: 3.9MB). Peak memory consumption was 132.8MB. Max. memory is 16.1GB. * Witness Printer took 57.95ms. Allocated memory is still 232.8MB. Free memory was 195.8MB in the beginning and 191.6MB 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: 10]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 10]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: 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 2 procedures, 20 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 8, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 178 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 168 mSDsluCounter, 307 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 196 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 501 IncrementalHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 111 mSDtfsCounter, 501 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=6, InterpolantAutomatonStates: 64, 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, 8 MinimizatonAttempts, 39 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 133 NumberOfCodeBlocks, 133 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 354 SizeOfPredicates, 3 NumberOfNonLiveVariables, 38 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 93/107 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 4 specifications checked. All of them hold - ProcedureContractResult [Line: 8]: Procedure Contract for mc91 Derived contract for procedure mc91. Requires: (((91 <= n) && (n <= 2147483648)) || ((n <= 111) && (0 <= (n + 2147483648)))) Ensures: (((((91 <= n) && (n <= 2147483648)) || ((n <= 111) && (0 <= (n + 2147483648)))) && (91 <= \result)) && ((((long) 9 + \result) < n) || ((n <= 100) && (\result <= 2147483657)))) RESULT: Ultimate proved your program to be correct! [2024-10-13 12:57:49,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE