./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-restricted-15/AlternKonv.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-restricted-15/AlternKonv.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 9816d5cc9e8c1fba9291af90498afaa319416e5c56fa3cf3ce8da9d63d3e9939 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 13:03:05,597 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 13:03:05,648 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-13 13:03:05,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 13:03:05,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 13:03:05,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 13:03:05,672 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 13:03:05,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 13:03:05,673 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 13:03:05,674 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 13:03:05,675 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 13:03:05,675 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 13:03:05,675 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 13:03:05,676 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 13:03:05,676 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 13:03:05,677 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 13:03:05,678 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 13:03:05,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 13:03:05,680 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 13:03:05,680 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 13:03:05,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 13:03:05,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 13:03:05,680 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 13:03:05,680 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 13:03:05,681 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 13:03:05,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 13:03:05,681 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 13:03:05,681 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 13:03:05,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 13:03:05,681 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 13:03:05,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 13:03:05,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:03:05,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 13:03:05,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 13:03:05,682 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 13:03:05,682 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 13:03:05,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 13:03:05,684 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 13:03:05,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 13:03:05,684 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 13:03:05,685 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 13:03:05,685 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 -> 9816d5cc9e8c1fba9291af90498afaa319416e5c56fa3cf3ce8da9d63d3e9939 [2024-10-13 13:03:05,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 13:03:05,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 13:03:05,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 13:03:05,940 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 13:03:05,941 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 13:03:05,942 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/AlternKonv.c [2024-10-13 13:03:07,168 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 13:03:07,331 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 13:03:07,331 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/AlternKonv.c [2024-10-13 13:03:07,337 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abf0f7495/3845b18a5a3a47e8bafae95a29ec3faa/FLAG02363c8c4 [2024-10-13 13:03:07,348 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abf0f7495/3845b18a5a3a47e8bafae95a29ec3faa [2024-10-13 13:03:07,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 13:03:07,351 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 13:03:07,352 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 13:03:07,353 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 13:03:07,361 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 13:03:07,362 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:03:07" (1/1) ... [2024-10-13 13:03:07,365 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f962cb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:03:07, skipping insertion in model container [2024-10-13 13:03:07,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:03:07" (1/1) ... [2024-10-13 13:03:07,380 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 13:03:07,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:03:07,527 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 13:03:07,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:03:07,553 INFO L204 MainTranslator]: Completed translation [2024-10-13 13:03:07,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:03:07 WrapperNode [2024-10-13 13:03:07,554 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 13:03:07,555 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 13:03:07,555 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 13:03:07,555 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 13:03:07,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:03:07" (1/1) ... [2024-10-13 13:03:07,564 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:03:07" (1/1) ... [2024-10-13 13:03:07,577 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 31 [2024-10-13 13:03:07,578 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 13:03:07,578 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 13:03:07,578 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 13:03:07,578 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 13:03:07,586 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:03:07" (1/1) ... [2024-10-13 13:03:07,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:03:07" (1/1) ... [2024-10-13 13:03:07,587 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:03:07" (1/1) ... [2024-10-13 13:03:07,592 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-13 13:03:07,595 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:03:07" (1/1) ... [2024-10-13 13:03:07,595 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:03:07" (1/1) ... [2024-10-13 13:03:07,597 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:03:07" (1/1) ... [2024-10-13 13:03:07,600 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:03:07" (1/1) ... [2024-10-13 13:03:07,601 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:03:07" (1/1) ... [2024-10-13 13:03:07,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:03:07" (1/1) ... [2024-10-13 13:03:07,603 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 13:03:07,605 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 13:03:07,607 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 13:03:07,607 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 13:03:07,608 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:03:07" (1/1) ... [2024-10-13 13:03:07,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:03:07,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:03:07,637 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 13:03:07,640 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 13:03:07,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 13:03:07,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 13:03:07,753 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 13:03:07,755 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 13:03:07,842 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 13:03:07,842 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 13:03:07,866 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 13:03:07,867 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 13:03:07,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:03:07 BoogieIcfgContainer [2024-10-13 13:03:07,868 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 13:03:07,869 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 13:03:07,870 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 13:03:07,873 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 13:03:07,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:03:07" (1/3) ... [2024-10-13 13:03:07,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5649396f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:03:07, skipping insertion in model container [2024-10-13 13:03:07,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:03:07" (2/3) ... [2024-10-13 13:03:07,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5649396f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:03:07, skipping insertion in model container [2024-10-13 13:03:07,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:03:07" (3/3) ... [2024-10-13 13:03:07,876 INFO L112 eAbstractionObserver]: Analyzing ICFG AlternKonv.c [2024-10-13 13:03:07,891 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 13:03:07,892 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-13 13:03:07,944 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 13:03:07,950 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;@1fc59288, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 13:03:07,950 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-13 13:03:07,954 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 16 states have (on average 1.875) internal successors, (30), 24 states have internal predecessors, (30), 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 13:03:07,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 13:03:07,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:03:07,960 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 13:03:07,962 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 13:03:07,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:03:07,966 INFO L85 PathProgramCache]: Analyzing trace with hash 2633300, now seen corresponding path program 1 times [2024-10-13 13:03:07,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:03:07,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914383822] [2024-10-13 13:03:07,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:03:07,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:03:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:03:08,108 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 13:03:08,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:03:08,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914383822] [2024-10-13 13:03:08,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914383822] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:03:08,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:03:08,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:03:08,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380285954] [2024-10-13 13:03:08,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:03:08,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:03:08,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:03:08,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:03:08,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:03:08,144 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.875) internal successors, (30), 24 states have internal predecessors, (30), 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 13:03:08,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:03:08,213 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2024-10-13 13:03:08,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:03:08,217 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-13 13:03:08,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:03:08,223 INFO L225 Difference]: With dead ends: 49 [2024-10-13 13:03:08,224 INFO L226 Difference]: Without dead ends: 22 [2024-10-13 13:03:08,226 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 13:03:08,230 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:03:08,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 20 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:03:08,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-13 13:03:08,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-13 13:03:08,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.5625) internal successors, (25), 21 states have internal predecessors, (25), 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 13:03:08,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-10-13 13:03:08,261 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 4 [2024-10-13 13:03:08,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:03:08,261 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-10-13 13:03:08,261 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), 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 13:03:08,262 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-10-13 13:03:08,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 13:03:08,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:03:08,262 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 13:03:08,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 13:03:08,263 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 13:03:08,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:03:08,264 INFO L85 PathProgramCache]: Analyzing trace with hash 2632628, now seen corresponding path program 1 times [2024-10-13 13:03:08,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:03:08,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165946037] [2024-10-13 13:03:08,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:03:08,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:03:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:03:08,301 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 13:03:08,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:03:08,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165946037] [2024-10-13 13:03:08,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165946037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:03:08,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:03:08,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 13:03:08,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358586190] [2024-10-13 13:03:08,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:03:08,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:03:08,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:03:08,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:03:08,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:03:08,306 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 13:03:08,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:03:08,362 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2024-10-13 13:03:08,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:03:08,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-13 13:03:08,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:03:08,364 INFO L225 Difference]: With dead ends: 29 [2024-10-13 13:03:08,364 INFO L226 Difference]: Without dead ends: 28 [2024-10-13 13:03:08,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 13:03:08,365 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3 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 13:03:08,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:03:08,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-13 13:03:08,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2024-10-13 13:03:08,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 24 states have internal predecessors, (29), 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 13:03:08,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-10-13 13:03:08,372 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 4 [2024-10-13 13:03:08,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:03:08,372 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-10-13 13:03:08,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 13:03:08,372 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-10-13 13:03:08,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 13:03:08,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:03:08,373 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 13:03:08,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 13:03:08,374 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 13:03:08,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:03:08,375 INFO L85 PathProgramCache]: Analyzing trace with hash 81632369, now seen corresponding path program 1 times [2024-10-13 13:03:08,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:03:08,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569130453] [2024-10-13 13:03:08,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:03:08,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:03:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:03:08,408 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 13:03:08,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:03:08,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569130453] [2024-10-13 13:03:08,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569130453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:03:08,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:03:08,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 13:03:08,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525552840] [2024-10-13 13:03:08,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:03:08,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:03:08,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:03:08,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:03:08,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:03:08,410 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 13:03:08,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:03:08,459 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2024-10-13 13:03:08,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:03:08,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-13 13:03:08,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:03:08,461 INFO L225 Difference]: With dead ends: 25 [2024-10-13 13:03:08,461 INFO L226 Difference]: Without dead ends: 22 [2024-10-13 13:03:08,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 13:03:08,463 INFO L432 NwaCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:03:08,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:03:08,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-13 13:03:08,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-13 13:03:08,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 19 states have (on average 1.368421052631579) internal successors, (26), 21 states have internal predecessors, (26), 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 13:03:08,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-10-13 13:03:08,468 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 5 [2024-10-13 13:03:08,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:03:08,468 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-10-13 13:03:08,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 13:03:08,469 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-10-13 13:03:08,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 13:03:08,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:03:08,469 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 13:03:08,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 13:03:08,469 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 13:03:08,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:03:08,470 INFO L85 PathProgramCache]: Analyzing trace with hash 81611516, now seen corresponding path program 1 times [2024-10-13 13:03:08,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:03:08,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721454085] [2024-10-13 13:03:08,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:03:08,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:03:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:03:08,496 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 13:03:08,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:03:08,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721454085] [2024-10-13 13:03:08,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721454085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:03:08,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:03:08,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:03:08,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638350453] [2024-10-13 13:03:08,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:03:08,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:03:08,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:03:08,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:03:08,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:03:08,501 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 13:03:08,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:03:08,531 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2024-10-13 13:03:08,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:03:08,532 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-13 13:03:08,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:03:08,532 INFO L225 Difference]: With dead ends: 22 [2024-10-13 13:03:08,532 INFO L226 Difference]: Without dead ends: 21 [2024-10-13 13:03:08,533 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 13:03:08,534 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:03:08,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:03:08,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-13 13:03:08,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-13 13:03:08,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 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 13:03:08,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-10-13 13:03:08,542 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 5 [2024-10-13 13:03:08,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:03:08,543 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-10-13 13:03:08,543 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), 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 13:03:08,543 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-10-13 13:03:08,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 13:03:08,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:03:08,543 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:03:08,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 13:03:08,543 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 13:03:08,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:03:08,544 INFO L85 PathProgramCache]: Analyzing trace with hash -351530930, now seen corresponding path program 1 times [2024-10-13 13:03:08,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:03:08,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446963477] [2024-10-13 13:03:08,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:03:08,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:03:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:03:08,596 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 13:03:08,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:03:08,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446963477] [2024-10-13 13:03:08,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446963477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:03:08,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:03:08,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:03:08,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978181533] [2024-10-13 13:03:08,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:03:08,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:03:08,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:03:08,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:03:08,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:03:08,598 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:03:08,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:03:08,655 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-10-13 13:03:08,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:03:08,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-13 13:03:08,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:03:08,656 INFO L225 Difference]: With dead ends: 43 [2024-10-13 13:03:08,656 INFO L226 Difference]: Without dead ends: 26 [2024-10-13 13:03:08,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:03:08,658 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:03:08,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 12 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:03:08,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-13 13:03:08,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-13 13:03:08,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 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 13:03:08,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2024-10-13 13:03:08,667 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 9 [2024-10-13 13:03:08,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:03:08,667 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-10-13 13:03:08,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:03:08,668 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2024-10-13 13:03:08,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 13:03:08,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:03:08,668 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:03:08,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 13:03:08,669 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 13:03:08,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:03:08,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1864332643, now seen corresponding path program 1 times [2024-10-13 13:03:08,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:03:08,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711997295] [2024-10-13 13:03:08,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:03:08,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:03:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:03:08,698 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 13:03:08,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:03:08,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711997295] [2024-10-13 13:03:08,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711997295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:03:08,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:03:08,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:03:08,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577715634] [2024-10-13 13:03:08,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:03:08,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:03:08,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:03:08,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:03:08,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:03:08,700 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:03:08,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:03:08,725 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2024-10-13 13:03:08,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:03:08,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-13 13:03:08,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:03:08,726 INFO L225 Difference]: With dead ends: 26 [2024-10-13 13:03:08,726 INFO L226 Difference]: Without dead ends: 25 [2024-10-13 13:03:08,726 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 13:03:08,727 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 3 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:03:08,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 11 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:03:08,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-13 13:03:08,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-13 13:03:08,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 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 13:03:08,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-10-13 13:03:08,731 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 9 [2024-10-13 13:03:08,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:03:08,731 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-10-13 13:03:08,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:03:08,731 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2024-10-13 13:03:08,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 13:03:08,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:03:08,731 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:03:08,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 13:03:08,732 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 13:03:08,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:03:08,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1340843858, now seen corresponding path program 1 times [2024-10-13 13:03:08,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:03:08,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060074599] [2024-10-13 13:03:08,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:03:08,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:03:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:03:08,783 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 13:03:08,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:03:08,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060074599] [2024-10-13 13:03:08,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060074599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:03:08,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:03:08,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:03:08,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279384196] [2024-10-13 13:03:08,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:03:08,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:03:08,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:03:08,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:03:08,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:03:08,785 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 13:03:08,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:03:08,827 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2024-10-13 13:03:08,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:03:08,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-13 13:03:08,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:03:08,827 INFO L225 Difference]: With dead ends: 25 [2024-10-13 13:03:08,827 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 13:03:08,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 13:03:08,828 INFO L432 NwaCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:03:08,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:03:08,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 13:03:08,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 13:03:08,830 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 13:03:08,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 13:03:08,830 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2024-10-13 13:03:08,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:03:08,830 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 13:03:08,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 13:03:08,830 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 13:03:08,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 13:03:08,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-13 13:03:08,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-13 13:03:08,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-13 13:03:08,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-13 13:03:08,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-13 13:03:08,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-13 13:03:08,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-13 13:03:08,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-13 13:03:08,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 13:03:08,837 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:03:08,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 13:03:08,882 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 13:03:08,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:03:08 BoogieIcfgContainer [2024-10-13 13:03:08,901 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 13:03:08,902 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 13:03:08,902 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 13:03:08,902 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 13:03:08,902 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:03:07" (3/4) ... [2024-10-13 13:03:08,904 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 13:03:08,922 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-13 13:03:08,922 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 13:03:08,922 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-13 13:03:08,994 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 13:03:08,995 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 13:03:08,995 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 13:03:08,996 INFO L158 Benchmark]: Toolchain (without parser) took 1644.65ms. Allocated memory was 167.8MB in the beginning and 220.2MB in the end (delta: 52.4MB). Free memory was 96.5MB in the beginning and 185.2MB in the end (delta: -88.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 13:03:08,996 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 121.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 13:03:08,996 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.46ms. Allocated memory is still 167.8MB. Free memory was 96.4MB in the beginning and 85.4MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 13:03:08,996 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.99ms. Allocated memory is still 167.8MB. Free memory was 85.2MB in the beginning and 83.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 13:03:08,997 INFO L158 Benchmark]: Boogie Preprocessor took 25.89ms. Allocated memory is still 167.8MB. Free memory was 83.9MB in the beginning and 82.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 13:03:08,997 INFO L158 Benchmark]: RCFGBuilder took 263.11ms. Allocated memory is still 167.8MB. Free memory was 82.4MB in the beginning and 133.3MB in the end (delta: -50.9MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2024-10-13 13:03:08,997 INFO L158 Benchmark]: TraceAbstraction took 1031.88ms. Allocated memory was 167.8MB in the beginning and 220.2MB in the end (delta: 52.4MB). Free memory was 132.3MB in the beginning and 190.4MB in the end (delta: -58.1MB). Peak memory consumption was 61.4MB. Max. memory is 16.1GB. [2024-10-13 13:03:08,998 INFO L158 Benchmark]: Witness Printer took 93.60ms. Allocated memory is still 220.2MB. Free memory was 190.4MB in the beginning and 185.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 13:03:08,999 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.18ms. Allocated memory is still 167.8MB. Free memory is still 121.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.46ms. Allocated memory is still 167.8MB. Free memory was 96.4MB in the beginning and 85.4MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.99ms. Allocated memory is still 167.8MB. Free memory was 85.2MB in the beginning and 83.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.89ms. Allocated memory is still 167.8MB. Free memory was 83.9MB in the beginning and 82.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 263.11ms. Allocated memory is still 167.8MB. Free memory was 82.4MB in the beginning and 133.3MB in the end (delta: -50.9MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1031.88ms. Allocated memory was 167.8MB in the beginning and 220.2MB in the end (delta: 52.4MB). Free memory was 132.3MB in the beginning and 190.4MB in the end (delta: -58.1MB). Peak memory consumption was 61.4MB. Max. memory is 16.1GB. * Witness Printer took 93.60ms. Allocated memory is still 220.2MB. Free memory was 190.4MB in the beginning and 185.2MB in the end (delta: 5.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: 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 - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: 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 1 procedures, 25 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 52 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 52 mSDsluCounter, 57 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 200 IncrementalHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 56 mSDtfsCounter, 200 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=5, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 40 ConstructedInterpolants, 0 QuantifiedInterpolants, 112 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 4/4 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 8 specifications checked. All of them hold - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: ((i <= 2147483647) && (0 <= (i + 2147483648))) RESULT: Ultimate proved your program to be correct! [2024-10-13 13:03:09,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE