./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_abp_1-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 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/psyco/psyco_abp_1-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 39adc6d5c92d5d4be7746cac0afbcc96f3b450588f18f3eb2d03a3ab1e20a3ef --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 20:18:29,524 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 20:18:29,572 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-14 20:18:29,576 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 20:18:29,577 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 20:18:29,604 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 20:18:29,604 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 20:18:29,605 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 20:18:29,605 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 20:18:29,605 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 20:18:29,606 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 20:18:29,606 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 20:18:29,606 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 20:18:29,606 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 20:18:29,607 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 20:18:29,607 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 20:18:29,608 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 20:18:29,609 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 20:18:29,609 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 20:18:29,609 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 20:18:29,609 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 20:18:29,610 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 20:18:29,610 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 20:18:29,610 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 20:18:29,611 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 20:18:29,611 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 20:18:29,611 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 20:18:29,611 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 20:18:29,611 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 20:18:29,612 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 20:18:29,612 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 20:18:29,612 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 20:18:29,612 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 20:18:29,613 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 20:18:29,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:18:29,613 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 20:18:29,613 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 20:18:29,613 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 20:18:29,613 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 20:18:29,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 20:18:29,614 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 20:18:29,614 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 20:18:29,614 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 20:18:29,614 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 20:18:29,615 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 39adc6d5c92d5d4be7746cac0afbcc96f3b450588f18f3eb2d03a3ab1e20a3ef [2024-10-14 20:18:29,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 20:18:29,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 20:18:29,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 20:18:29,827 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 20:18:29,827 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 20:18:29,828 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_abp_1-1.c [2024-10-14 20:18:30,308 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 20:18:31,835 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 20:18:31,839 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_abp_1-1.c [2024-10-14 20:18:31,852 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/189df0c31/656f5c0d1e744251a21c243a91e594c3/FLAG8b0703bf3 [2024-10-14 20:18:32,226 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/189df0c31/656f5c0d1e744251a21c243a91e594c3 [2024-10-14 20:18:32,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 20:18:32,229 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 20:18:32,230 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 20:18:32,230 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 20:18:32,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 20:18:32,234 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:18:32" (1/1) ... [2024-10-14 20:18:32,235 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63c95538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:18:32, skipping insertion in model container [2024-10-14 20:18:32,235 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:18:32" (1/1) ... [2024-10-14 20:18:32,259 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 20:18:32,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:18:32,508 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 20:18:32,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:18:32,568 INFO L204 MainTranslator]: Completed translation [2024-10-14 20:18:32,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:18:32 WrapperNode [2024-10-14 20:18:32,568 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 20:18:32,569 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 20:18:32,570 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 20:18:32,570 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 20:18:32,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:18:32" (1/1) ... [2024-10-14 20:18:32,582 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:18:32" (1/1) ... [2024-10-14 20:18:32,615 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 510 [2024-10-14 20:18:32,615 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 20:18:32,616 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 20:18:32,616 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 20:18:32,616 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 20:18:32,626 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:18:32" (1/1) ... [2024-10-14 20:18:32,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:18:32" (1/1) ... [2024-10-14 20:18:32,630 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:18:32" (1/1) ... [2024-10-14 20:18:32,649 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 20:18:32,650 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:18:32" (1/1) ... [2024-10-14 20:18:32,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:18:32" (1/1) ... [2024-10-14 20:18:32,665 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:18:32" (1/1) ... [2024-10-14 20:18:32,672 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:18:32" (1/1) ... [2024-10-14 20:18:32,676 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:18:32" (1/1) ... [2024-10-14 20:18:32,679 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:18:32" (1/1) ... [2024-10-14 20:18:32,684 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 20:18:32,685 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 20:18:32,685 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 20:18:32,685 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 20:18:32,686 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:18:32" (1/1) ... [2024-10-14 20:18:32,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:18:32,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:18:32,716 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-14 20:18:32,719 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-14 20:18:32,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 20:18:32,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 20:18:32,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 20:18:32,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 20:18:32,820 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 20:18:32,821 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 20:18:33,357 INFO L? ?]: Removed 327 outVars from TransFormulas that were not future-live. [2024-10-14 20:18:33,357 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 20:18:33,386 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 20:18:33,387 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 20:18:33,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:18:33 BoogieIcfgContainer [2024-10-14 20:18:33,387 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 20:18:33,389 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 20:18:33,389 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 20:18:33,391 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 20:18:33,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:18:32" (1/3) ... [2024-10-14 20:18:33,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29fd4a98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:18:33, skipping insertion in model container [2024-10-14 20:18:33,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:18:32" (2/3) ... [2024-10-14 20:18:33,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29fd4a98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:18:33, skipping insertion in model container [2024-10-14 20:18:33,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:18:33" (3/3) ... [2024-10-14 20:18:33,394 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-1.c [2024-10-14 20:18:33,406 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 20:18:33,406 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2024-10-14 20:18:33,467 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 20:18:33,472 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;@463a1743, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 20:18:33,472 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2024-10-14 20:18:33,475 INFO L276 IsEmpty]: Start isEmpty. Operand has 193 states, 150 states have (on average 1.9733333333333334) internal successors, (296), 192 states have internal predecessors, (296), 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-14 20:18:33,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 20:18:33,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:18:33,480 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:18:33,481 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-10-14 20:18:33,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:18:33,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1722318048, now seen corresponding path program 1 times [2024-10-14 20:18:33,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:18:33,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989825581] [2024-10-14 20:18:33,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:18:33,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:18:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:18:33,650 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-14 20:18:33,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:18:33,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989825581] [2024-10-14 20:18:33,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989825581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:18:33,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:18:33,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:18:33,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177146512] [2024-10-14 20:18:33,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:18:33,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:18:33,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:18:33,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:18:33,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:18:33,698 INFO L87 Difference]: Start difference. First operand has 193 states, 150 states have (on average 1.9733333333333334) internal successors, (296), 192 states have internal predecessors, (296), 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, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-14 20:18:33,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:18:33,774 INFO L93 Difference]: Finished difference Result 389 states and 599 transitions. [2024-10-14 20:18:33,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:18:33,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2024-10-14 20:18:33,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:18:33,785 INFO L225 Difference]: With dead ends: 389 [2024-10-14 20:18:33,785 INFO L226 Difference]: Without dead ends: 167 [2024-10-14 20:18:33,788 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-14 20:18:33,790 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 5 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:18:33,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 557 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:18:33,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-14 20:18:33,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2024-10-14 20:18:33,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 125 states have (on average 1.696) internal successors, (212), 166 states have internal predecessors, (212), 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-14 20:18:33,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 212 transitions. [2024-10-14 20:18:33,825 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 212 transitions. Word has length 10 [2024-10-14 20:18:33,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:18:33,826 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 212 transitions. [2024-10-14 20:18:33,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-14 20:18:33,826 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 212 transitions. [2024-10-14 20:18:33,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 20:18:33,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:18:33,827 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:18:33,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 20:18:33,828 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-10-14 20:18:33,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:18:33,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1195237581, now seen corresponding path program 1 times [2024-10-14 20:18:33,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:18:33,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596338148] [2024-10-14 20:18:33,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:18:33,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:18:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:18:33,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:18:33,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:18:33,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596338148] [2024-10-14 20:18:33,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596338148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:18:33,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:18:33,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:18:33,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211616744] [2024-10-14 20:18:33,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:18:33,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:18:33,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:18:33,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:18:33,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:18:33,932 INFO L87 Difference]: Start difference. First operand 167 states and 212 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-14 20:18:34,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:18:34,093 INFO L93 Difference]: Finished difference Result 455 states and 624 transitions. [2024-10-14 20:18:34,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:18:34,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2024-10-14 20:18:34,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:18:34,096 INFO L225 Difference]: With dead ends: 455 [2024-10-14 20:18:34,097 INFO L226 Difference]: Without dead ends: 264 [2024-10-14 20:18:34,097 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-14 20:18:34,098 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 151 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:18:34,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 324 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:18:34,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-14 20:18:34,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 258. [2024-10-14 20:18:34,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 216 states have (on average 1.6203703703703705) internal successors, (350), 257 states have internal predecessors, (350), 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-14 20:18:34,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 350 transitions. [2024-10-14 20:18:34,109 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 350 transitions. Word has length 16 [2024-10-14 20:18:34,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:18:34,109 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 350 transitions. [2024-10-14 20:18:34,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-14 20:18:34,110 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 350 transitions. [2024-10-14 20:18:34,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 20:18:34,110 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:18:34,110 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:18:34,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 20:18:34,111 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-10-14 20:18:34,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:18:34,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1245859663, now seen corresponding path program 1 times [2024-10-14 20:18:34,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:18:34,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534772462] [2024-10-14 20:18:34,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:18:34,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:18:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:18:34,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:18:34,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:18:34,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534772462] [2024-10-14 20:18:34,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534772462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:18:34,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:18:34,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:18:34,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540888080] [2024-10-14 20:18:34,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:18:34,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:18:34,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:18:34,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:18:34,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:18:34,191 INFO L87 Difference]: Start difference. First operand 258 states and 350 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-14 20:18:34,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:18:34,245 INFO L93 Difference]: Finished difference Result 363 states and 498 transitions. [2024-10-14 20:18:34,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:18:34,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2024-10-14 20:18:34,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:18:34,247 INFO L225 Difference]: With dead ends: 363 [2024-10-14 20:18:34,247 INFO L226 Difference]: Without dead ends: 355 [2024-10-14 20:18:34,247 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-14 20:18:34,248 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 123 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:18:34,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 383 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:18:34,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-10-14 20:18:34,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 349. [2024-10-14 20:18:34,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 307 states have (on average 1.5732899022801303) internal successors, (483), 348 states have internal predecessors, (483), 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-14 20:18:34,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 483 transitions. [2024-10-14 20:18:34,275 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 483 transitions. Word has length 18 [2024-10-14 20:18:34,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:18:34,275 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 483 transitions. [2024-10-14 20:18:34,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-14 20:18:34,275 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 483 transitions. [2024-10-14 20:18:34,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 20:18:34,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:18:34,280 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:18:34,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 20:18:34,280 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-10-14 20:18:34,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:18:34,281 INFO L85 PathProgramCache]: Analyzing trace with hash -382922728, now seen corresponding path program 1 times [2024-10-14 20:18:34,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:18:34,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717466254] [2024-10-14 20:18:34,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:18:34,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:18:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:18:34,351 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 20:18:34,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:18:34,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717466254] [2024-10-14 20:18:34,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717466254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:18:34,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:18:34,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:18:34,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110152866] [2024-10-14 20:18:34,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:18:34,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:18:34,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:18:34,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:18:34,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:18:34,353 INFO L87 Difference]: Start difference. First operand 349 states and 483 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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-14 20:18:34,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:18:34,381 INFO L93 Difference]: Finished difference Result 714 states and 995 transitions. [2024-10-14 20:18:34,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:18:34,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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) Word has length 27 [2024-10-14 20:18:34,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:18:34,382 INFO L225 Difference]: With dead ends: 714 [2024-10-14 20:18:34,382 INFO L226 Difference]: Without dead ends: 367 [2024-10-14 20:18:34,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-14 20:18:34,384 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 40 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:18:34,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 356 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:18:34,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-10-14 20:18:34,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2024-10-14 20:18:34,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 325 states have (on average 1.5446153846153847) internal successors, (502), 366 states have internal predecessors, (502), 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-14 20:18:34,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 502 transitions. [2024-10-14 20:18:34,392 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 502 transitions. Word has length 27 [2024-10-14 20:18:34,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:18:34,392 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 502 transitions. [2024-10-14 20:18:34,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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-14 20:18:34,392 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 502 transitions. [2024-10-14 20:18:34,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 20:18:34,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:18:34,393 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:18:34,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 20:18:34,393 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-10-14 20:18:34,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:18:34,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1476739149, now seen corresponding path program 1 times [2024-10-14 20:18:34,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:18:34,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558684574] [2024-10-14 20:18:34,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:18:34,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:18:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:18:34,470 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:18:34,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:18:34,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558684574] [2024-10-14 20:18:34,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558684574] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:18:34,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395361787] [2024-10-14 20:18:34,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:18:34,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:18:34,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:18:34,475 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-14 20:18:34,476 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-14 20:18:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:18:34,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 20:18:34,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:18:34,633 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:18:34,634 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:18:34,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395361787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:18:34,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:18:34,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-10-14 20:18:34,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542712410] [2024-10-14 20:18:34,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:18:34,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:18:34,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:18:34,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:18:34,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:18:34,639 INFO L87 Difference]: Start difference. First operand 367 states and 502 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 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-14 20:18:34,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:18:34,787 INFO L93 Difference]: Finished difference Result 527 states and 721 transitions. [2024-10-14 20:18:34,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:18:34,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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 30 [2024-10-14 20:18:34,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:18:34,790 INFO L225 Difference]: With dead ends: 527 [2024-10-14 20:18:34,790 INFO L226 Difference]: Without dead ends: 510 [2024-10-14 20:18:34,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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-14 20:18:34,793 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 278 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:18:34,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 574 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:18:34,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-10-14 20:18:34,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 477. [2024-10-14 20:18:34,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 435 states have (on average 1.5655172413793104) internal successors, (681), 476 states have internal predecessors, (681), 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-14 20:18:34,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 681 transitions. [2024-10-14 20:18:34,808 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 681 transitions. Word has length 30 [2024-10-14 20:18:34,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:18:34,809 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 681 transitions. [2024-10-14 20:18:34,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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-14 20:18:34,809 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 681 transitions. [2024-10-14 20:18:34,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 20:18:34,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:18:34,811 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:18:34,825 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-14 20:18:35,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:18:35,012 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-10-14 20:18:35,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:18:35,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1083712139, now seen corresponding path program 1 times [2024-10-14 20:18:35,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:18:35,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675796367] [2024-10-14 20:18:35,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:18:35,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:18:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:18:35,094 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:18:35,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:18:35,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675796367] [2024-10-14 20:18:35,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675796367] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:18:35,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329844191] [2024-10-14 20:18:35,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:18:35,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:18:35,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:18:35,099 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:18:35,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 20:18:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:18:35,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 20:18:35,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:18:35,186 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 20:18:35,189 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:18:35,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329844191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:18:35,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:18:35,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-14 20:18:35,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716740037] [2024-10-14 20:18:35,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:18:35,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:18:35,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:18:35,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:18:35,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:18:35,191 INFO L87 Difference]: Start difference. First operand 477 states and 681 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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-14 20:18:35,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:18:35,258 INFO L93 Difference]: Finished difference Result 477 states and 681 transitions. [2024-10-14 20:18:35,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:18:35,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2024-10-14 20:18:35,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:18:35,260 INFO L225 Difference]: With dead ends: 477 [2024-10-14 20:18:35,260 INFO L226 Difference]: Without dead ends: 460 [2024-10-14 20:18:35,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-14 20:18:35,261 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 158 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:18:35,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 145 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:18:35,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-10-14 20:18:35,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 350. [2024-10-14 20:18:35,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 325 states have (on average 1.4923076923076923) internal successors, (485), 349 states have internal predecessors, (485), 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-14 20:18:35,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 485 transitions. [2024-10-14 20:18:35,271 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 485 transitions. Word has length 30 [2024-10-14 20:18:35,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:18:35,271 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 485 transitions. [2024-10-14 20:18:35,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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-14 20:18:35,271 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 485 transitions. [2024-10-14 20:18:35,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 20:18:35,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:18:35,274 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:18:35,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 20:18:35,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 20:18:35,476 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-10-14 20:18:35,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:18:35,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1465725295, now seen corresponding path program 1 times [2024-10-14 20:18:35,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:18:35,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422033889] [2024-10-14 20:18:35,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:18:35,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:18:35,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:18:35,517 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 20:18:35,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:18:35,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422033889] [2024-10-14 20:18:35,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422033889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:18:35,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:18:35,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:18:35,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943992525] [2024-10-14 20:18:35,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:18:35,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:18:35,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:18:35,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:18:35,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:18:35,519 INFO L87 Difference]: Start difference. First operand 350 states and 485 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-14 20:18:35,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:18:35,530 INFO L93 Difference]: Finished difference Result 701 states and 971 transitions. [2024-10-14 20:18:35,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:18:35,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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) Word has length 31 [2024-10-14 20:18:35,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:18:35,532 INFO L225 Difference]: With dead ends: 701 [2024-10-14 20:18:35,532 INFO L226 Difference]: Without dead ends: 350 [2024-10-14 20:18:35,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-14 20:18:35,533 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 0 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:18:35,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 373 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:18:35,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-10-14 20:18:35,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2024-10-14 20:18:35,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 325 states have (on average 1.4830769230769232) internal successors, (482), 349 states have internal predecessors, (482), 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-14 20:18:35,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 482 transitions. [2024-10-14 20:18:35,541 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 482 transitions. Word has length 31 [2024-10-14 20:18:35,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:18:35,542 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 482 transitions. [2024-10-14 20:18:35,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-14 20:18:35,542 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 482 transitions. [2024-10-14 20:18:35,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 20:18:35,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:18:35,543 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:18:35,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 20:18:35,543 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-10-14 20:18:35,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:18:35,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1465726961, now seen corresponding path program 1 times [2024-10-14 20:18:35,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:18:35,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459255632] [2024-10-14 20:18:35,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:18:35,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:18:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:18:35,574 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 20:18:35,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:18:35,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459255632] [2024-10-14 20:18:35,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459255632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:18:35,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:18:35,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:18:35,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301923081] [2024-10-14 20:18:35,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:18:35,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:18:35,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:18:35,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:18:35,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:18:35,577 INFO L87 Difference]: Start difference. First operand 350 states and 482 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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-14 20:18:35,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:18:35,623 INFO L93 Difference]: Finished difference Result 685 states and 968 transitions. [2024-10-14 20:18:35,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:18:35,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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 31 [2024-10-14 20:18:35,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:18:35,625 INFO L225 Difference]: With dead ends: 685 [2024-10-14 20:18:35,625 INFO L226 Difference]: Without dead ends: 311 [2024-10-14 20:18:35,625 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-14 20:18:35,626 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 147 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:18:35,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 154 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:18:35,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-10-14 20:18:35,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 214. [2024-10-14 20:18:35,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 206 states have (on average 1.4514563106796117) internal successors, (299), 213 states have internal predecessors, (299), 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-14 20:18:35,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 299 transitions. [2024-10-14 20:18:35,632 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 299 transitions. Word has length 31 [2024-10-14 20:18:35,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:18:35,632 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 299 transitions. [2024-10-14 20:18:35,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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-14 20:18:35,632 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 299 transitions. [2024-10-14 20:18:35,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-14 20:18:35,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:18:35,635 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:18:35,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 20:18:35,636 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-10-14 20:18:35,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:18:35,636 INFO L85 PathProgramCache]: Analyzing trace with hash -185653005, now seen corresponding path program 1 times [2024-10-14 20:18:35,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:18:35,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129948145] [2024-10-14 20:18:35,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:18:35,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:18:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:18:35,683 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:18:35,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:18:35,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129948145] [2024-10-14 20:18:35,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129948145] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:18:35,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79815029] [2024-10-14 20:18:35,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:18:35,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:18:35,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:18:35,685 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:18:35,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 20:18:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:18:35,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 20:18:35,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:18:35,778 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:18:35,779 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:18:35,833 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:18:35,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79815029] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:18:35,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:18:35,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-14 20:18:35,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52246451] [2024-10-14 20:18:35,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:18:35,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 20:18:35,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:18:35,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 20:18:35,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:18:35,835 INFO L87 Difference]: Start difference. First operand 214 states and 299 transitions. Second operand has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 7 states have internal predecessors, (71), 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-14 20:18:35,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:18:35,928 INFO L93 Difference]: Finished difference Result 331 states and 465 transitions. [2024-10-14 20:18:35,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:18:35,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 7 states have internal predecessors, (71), 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 33 [2024-10-14 20:18:35,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:18:35,930 INFO L225 Difference]: With dead ends: 331 [2024-10-14 20:18:35,930 INFO L226 Difference]: Without dead ends: 323 [2024-10-14 20:18:35,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-14 20:18:35,931 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 846 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:18:35,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 734 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:18:35,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-10-14 20:18:35,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 214. [2024-10-14 20:18:35,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 210 states have (on average 1.4333333333333333) internal successors, (301), 213 states have internal predecessors, (301), 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-14 20:18:35,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 301 transitions. [2024-10-14 20:18:35,935 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 301 transitions. Word has length 33 [2024-10-14 20:18:35,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:18:35,935 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 301 transitions. [2024-10-14 20:18:35,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 7 states have internal predecessors, (71), 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-14 20:18:35,935 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 301 transitions. [2024-10-14 20:18:35,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 20:18:35,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:18:35,936 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:18:35,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 20:18:36,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:18:36,137 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-10-14 20:18:36,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:18:36,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1460275525, now seen corresponding path program 1 times [2024-10-14 20:18:36,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:18:36,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51238305] [2024-10-14 20:18:36,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:18:36,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:18:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:18:36,176 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:18:36,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:18:36,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51238305] [2024-10-14 20:18:36,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51238305] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:18:36,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384218239] [2024-10-14 20:18:36,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:18:36,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:18:36,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:18:36,178 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:18:36,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 20:18:36,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:18:36,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 20:18:36,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:18:36,270 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:18:36,271 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:18:36,307 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:18:36,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384218239] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:18:36,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:18:36,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-14 20:18:36,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725232538] [2024-10-14 20:18:36,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:18:36,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 20:18:36,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:18:36,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 20:18:36,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:18:36,308 INFO L87 Difference]: Start difference. First operand 214 states and 301 transitions. Second operand has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 7 states have internal predecessors, (73), 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-14 20:18:36,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:18:36,350 INFO L93 Difference]: Finished difference Result 317 states and 446 transitions. [2024-10-14 20:18:36,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:18:36,350 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 7 states have internal predecessors, (73), 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 34 [2024-10-14 20:18:36,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:18:36,351 INFO L225 Difference]: With dead ends: 317 [2024-10-14 20:18:36,351 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 20:18:36,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-14 20:18:36,352 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 466 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:18:36,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 253 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:18:36,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 20:18:36,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 20:18:36,352 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-14 20:18:36,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 20:18:36,353 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2024-10-14 20:18:36,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:18:36,353 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 20:18:36,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 7 states have internal predecessors, (73), 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-14 20:18:36,353 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 20:18:36,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 20:18:36,355 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 42 remaining) [2024-10-14 20:18:36,355 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 42 remaining) [2024-10-14 20:18:36,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 42 remaining) [2024-10-14 20:18:36,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 42 remaining) [2024-10-14 20:18:36,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 42 remaining) [2024-10-14 20:18:36,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 42 remaining) [2024-10-14 20:18:36,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 42 remaining) [2024-10-14 20:18:36,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 42 remaining) [2024-10-14 20:18:36,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 42 remaining) [2024-10-14 20:18:36,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 42 remaining) [2024-10-14 20:18:36,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 42 remaining) [2024-10-14 20:18:36,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 42 remaining) [2024-10-14 20:18:36,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 42 remaining) [2024-10-14 20:18:36,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 42 remaining) [2024-10-14 20:18:36,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 42 remaining) [2024-10-14 20:18:36,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 42 remaining) [2024-10-14 20:18:36,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 42 remaining) [2024-10-14 20:18:36,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 42 remaining) [2024-10-14 20:18:36,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 42 remaining) [2024-10-14 20:18:36,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 42 remaining) [2024-10-14 20:18:36,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 42 remaining) [2024-10-14 20:18:36,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 42 remaining) [2024-10-14 20:18:36,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 42 remaining) [2024-10-14 20:18:36,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 42 remaining) [2024-10-14 20:18:36,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 42 remaining) [2024-10-14 20:18:36,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 42 remaining) [2024-10-14 20:18:36,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 42 remaining) [2024-10-14 20:18:36,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 42 remaining) [2024-10-14 20:18:36,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 42 remaining) [2024-10-14 20:18:36,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 42 remaining) [2024-10-14 20:18:36,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 42 remaining) [2024-10-14 20:18:36,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 42 remaining) [2024-10-14 20:18:36,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 42 remaining) [2024-10-14 20:18:36,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 42 remaining) [2024-10-14 20:18:36,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 42 remaining) [2024-10-14 20:18:36,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 42 remaining) [2024-10-14 20:18:36,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 42 remaining) [2024-10-14 20:18:36,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 42 remaining) [2024-10-14 20:18:36,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 42 remaining) [2024-10-14 20:18:36,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 42 remaining) [2024-10-14 20:18:36,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 42 remaining) [2024-10-14 20:18:36,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 42 remaining) [2024-10-14 20:18:36,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-14 20:18:36,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:18:36,563 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:18:36,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 20:18:36,606 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 20:18:36,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:18:36 BoogieIcfgContainer [2024-10-14 20:18:36,617 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 20:18:36,617 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 20:18:36,618 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 20:18:36,618 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 20:18:36,618 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:18:33" (3/4) ... [2024-10-14 20:18:36,619 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 20:18:36,634 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-14 20:18:36,635 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-14 20:18:36,635 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 20:18:36,635 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 20:18:36,733 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 20:18:36,733 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 20:18:36,734 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 20:18:36,734 INFO L158 Benchmark]: Toolchain (without parser) took 4504.90ms. Allocated memory was 184.5MB in the beginning and 253.8MB in the end (delta: 69.2MB). Free memory was 106.1MB in the beginning and 142.1MB in the end (delta: -36.0MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. [2024-10-14 20:18:36,734 INFO L158 Benchmark]: CDTParser took 0.64ms. Allocated memory is still 184.5MB. Free memory is still 144.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:18:36,735 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.30ms. Allocated memory is still 184.5MB. Free memory was 105.9MB in the beginning and 140.4MB in the end (delta: -34.5MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2024-10-14 20:18:36,735 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.67ms. Allocated memory is still 184.5MB. Free memory was 140.4MB in the beginning and 135.5MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 20:18:36,735 INFO L158 Benchmark]: Boogie Preprocessor took 68.43ms. Allocated memory is still 184.5MB. Free memory was 135.5MB in the beginning and 131.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 20:18:36,735 INFO L158 Benchmark]: RCFGBuilder took 702.14ms. Allocated memory is still 184.5MB. Free memory was 131.3MB in the beginning and 74.7MB in the end (delta: 56.6MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-10-14 20:18:36,736 INFO L158 Benchmark]: TraceAbstraction took 3228.44ms. Allocated memory was 184.5MB in the beginning and 253.8MB in the end (delta: 69.2MB). Free memory was 73.9MB in the beginning and 152.5MB in the end (delta: -78.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:18:36,736 INFO L158 Benchmark]: Witness Printer took 116.24ms. Allocated memory is still 253.8MB. Free memory was 152.5MB in the beginning and 142.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 20:18:36,738 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.64ms. Allocated memory is still 184.5MB. Free memory is still 144.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 338.30ms. Allocated memory is still 184.5MB. Free memory was 105.9MB in the beginning and 140.4MB in the end (delta: -34.5MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.67ms. Allocated memory is still 184.5MB. Free memory was 140.4MB in the beginning and 135.5MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.43ms. Allocated memory is still 184.5MB. Free memory was 135.5MB in the beginning and 131.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 702.14ms. Allocated memory is still 184.5MB. Free memory was 131.3MB in the beginning and 74.7MB in the end (delta: 56.6MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3228.44ms. Allocated memory was 184.5MB in the beginning and 253.8MB in the end (delta: 69.2MB). Free memory was 73.9MB in the beginning and 152.5MB in the end (delta: -78.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 116.24ms. Allocated memory is still 253.8MB. Free memory was 152.5MB in the beginning and 142.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. 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: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 136]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 136]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 152]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 152]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 188]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 188]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 236]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 236]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 252]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 252]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 288]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 288]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 294]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 294]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 336]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 336]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 352]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 352]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 388]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 388]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 426]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 426]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 426]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 426]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 436]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 436]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 452]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 452]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 488]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 488]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 536]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 536]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 552]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 552]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 558]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 558]: 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, 193 locations, 42 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2214 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2214 mSDsluCounter, 3853 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1837 mSDsCounter, 171 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 582 IncrementalHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 171 mSolverCounterUnsat, 2016 mSDtfsCounter, 582 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 221 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=477occurred in iteration=5, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 361 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 387 NumberOfCodeBlocks, 387 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 438 ConstructedInterpolants, 0 QuantifiedInterpolants, 1026 SizeOfPredicates, 0 NumberOfNonLiveVariables, 631 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 107/137 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 42 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((((0 <= ((long long) 16 + this_expect)) && (this_expect <= 16)) && (this_buffer_empty == 1)) || (((this_buffer_empty == 0) && (0 <= ((long long) 16 + this_expect))) && (this_expect <= 16))) RESULT: Ultimate proved your program to be correct! [2024-10-14 20:18:36,762 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