./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_sub_10_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_sub_10_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 466b1dd1b80ff8cd3c26a58eb1e997be30c7c66222b7d013535c23a91ea010b8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 16:02:00,225 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 16:02:00,309 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-13 16:02:00,322 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 16:02:00,323 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 16:02:00,346 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 16:02:00,347 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 16:02:00,347 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 16:02:00,348 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 16:02:00,350 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 16:02:00,350 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 16:02:00,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 16:02:00,351 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 16:02:00,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 16:02:00,354 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 16:02:00,354 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 16:02:00,354 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 16:02:00,354 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 16:02:00,355 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 16:02:00,355 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 16:02:00,357 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 16:02:00,358 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 16:02:00,358 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 16:02:00,358 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 16:02:00,358 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 16:02:00,359 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 16:02:00,359 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 16:02:00,359 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 16:02:00,359 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 16:02:00,360 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 16:02:00,360 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 16:02:00,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 16:02:00,360 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 16:02:00,361 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 16:02:00,361 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 16:02:00,363 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 16:02:00,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 16:02:00,364 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 16:02:00,364 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 16:02:00,364 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 16:02:00,364 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 16:02:00,365 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 466b1dd1b80ff8cd3c26a58eb1e997be30c7c66222b7d013535c23a91ea010b8 [2024-10-13 16:02:00,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 16:02:00,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 16:02:00,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 16:02:00,655 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 16:02:00,655 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 16:02:00,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_sub_10_good.i [2024-10-13 16:02:02,082 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 16:02:02,389 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 16:02:02,390 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_sub_10_good.i [2024-10-13 16:02:02,415 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abed8be82/1d7632506a8344efa42bb89c58f2a9da/FLAG4c24336d6 [2024-10-13 16:02:02,431 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abed8be82/1d7632506a8344efa42bb89c58f2a9da [2024-10-13 16:02:02,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 16:02:02,436 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 16:02:02,438 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 16:02:02,439 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 16:02:02,444 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 16:02:02,445 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:02:02" (1/1) ... [2024-10-13 16:02:02,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bb3a2aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:02:02, skipping insertion in model container [2024-10-13 16:02:02,446 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:02:02" (1/1) ... [2024-10-13 16:02:02,504 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 16:02:03,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 16:02:03,257 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 16:02:03,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 16:02:03,518 INFO L204 MainTranslator]: Completed translation [2024-10-13 16:02:03,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:02:03 WrapperNode [2024-10-13 16:02:03,519 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 16:02:03,520 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 16:02:03,520 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 16:02:03,520 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 16:02:03,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:02:03" (1/1) ... [2024-10-13 16:02:03,560 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:02:03" (1/1) ... [2024-10-13 16:02:03,592 INFO L138 Inliner]: procedures = 501, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 89 [2024-10-13 16:02:03,594 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 16:02:03,595 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 16:02:03,595 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 16:02:03,596 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 16:02:03,606 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:02:03" (1/1) ... [2024-10-13 16:02:03,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:02:03" (1/1) ... [2024-10-13 16:02:03,609 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:02:03" (1/1) ... [2024-10-13 16:02:03,632 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-13 16:02:03,632 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:02:03" (1/1) ... [2024-10-13 16:02:03,632 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:02:03" (1/1) ... [2024-10-13 16:02:03,637 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:02:03" (1/1) ... [2024-10-13 16:02:03,642 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:02:03" (1/1) ... [2024-10-13 16:02:03,648 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:02:03" (1/1) ... [2024-10-13 16:02:03,649 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:02:03" (1/1) ... [2024-10-13 16:02:03,654 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 16:02:03,655 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 16:02:03,655 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 16:02:03,655 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 16:02:03,656 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:02:03" (1/1) ... [2024-10-13 16:02:03,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 16:02:03,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:02:03,690 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 16:02:03,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 16:02:03,742 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-13 16:02:03,743 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-13 16:02:03,743 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-13 16:02:03,744 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-13 16:02:03,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 16:02:03,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 16:02:03,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 16:02:03,880 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 16:02:03,882 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 16:02:04,055 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-10-13 16:02:04,056 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 16:02:04,095 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 16:02:04,096 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 16:02:04,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:02:04 BoogieIcfgContainer [2024-10-13 16:02:04,096 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 16:02:04,098 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 16:02:04,098 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 16:02:04,101 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 16:02:04,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:02:02" (1/3) ... [2024-10-13 16:02:04,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ac953c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:02:04, skipping insertion in model container [2024-10-13 16:02:04,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:02:03" (2/3) ... [2024-10-13 16:02:04,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ac953c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:02:04, skipping insertion in model container [2024-10-13 16:02:04,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:02:04" (3/3) ... [2024-10-13 16:02:04,103 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_min_sub_10_good.i [2024-10-13 16:02:04,117 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 16:02:04,117 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-13 16:02:04,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 16:02:04,184 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;@297ad03b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 16:02:04,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-13 16:02:04,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 45 states have internal predecessors, (56), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 16:02:04,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 16:02:04,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:02:04,203 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:02:04,203 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 16:02:04,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:02:04,210 INFO L85 PathProgramCache]: Analyzing trace with hash 592525310, now seen corresponding path program 1 times [2024-10-13 16:02:04,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:02:04,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705880531] [2024-10-13 16:02:04,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:02:04,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:02:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:04,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:02:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:04,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:02:04,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:02:04,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705880531] [2024-10-13 16:02:04,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705880531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:02:04,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:02:04,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 16:02:04,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115015596] [2024-10-13 16:02:04,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:02:04,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:02:04,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:02:04,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:02:04,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:02:04,559 INFO L87 Difference]: Start difference. First operand has 58 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 45 states have internal predecessors, (56), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 16:02:04,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:02:04,629 INFO L93 Difference]: Finished difference Result 111 states and 144 transitions. [2024-10-13 16:02:04,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:02:04,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-13 16:02:04,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:02:04,641 INFO L225 Difference]: With dead ends: 111 [2024-10-13 16:02:04,641 INFO L226 Difference]: Without dead ends: 57 [2024-10-13 16:02:04,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:02:04,650 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 2 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 16:02:04,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 135 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:02:04,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-13 16:02:04,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2024-10-13 16:02:04,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.5) internal successors, (54), 43 states have internal predecessors, (54), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 16:02:04,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2024-10-13 16:02:04,685 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 11 [2024-10-13 16:02:04,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:02:04,686 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2024-10-13 16:02:04,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 16:02:04,686 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2024-10-13 16:02:04,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 16:02:04,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:02:04,688 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:02:04,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 16:02:04,688 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 16:02:04,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:02:04,689 INFO L85 PathProgramCache]: Analyzing trace with hash 592584892, now seen corresponding path program 1 times [2024-10-13 16:02:04,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:02:04,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974155972] [2024-10-13 16:02:04,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:02:04,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:02:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:04,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:02:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:04,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:02:04,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:02:04,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974155972] [2024-10-13 16:02:04,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974155972] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:02:04,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:02:04,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 16:02:04,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085849156] [2024-10-13 16:02:04,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:02:04,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:02:04,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:02:04,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:02:04,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:02:04,817 INFO L87 Difference]: Start difference. First operand 54 states and 70 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 16:02:04,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:02:04,856 INFO L93 Difference]: Finished difference Result 94 states and 120 transitions. [2024-10-13 16:02:04,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:02:04,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-13 16:02:04,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:02:04,858 INFO L225 Difference]: With dead ends: 94 [2024-10-13 16:02:04,858 INFO L226 Difference]: Without dead ends: 46 [2024-10-13 16:02:04,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:02:04,860 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 16:02:04,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 46 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:02:04,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-13 16:02:04,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-13 16:02:04,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 36 states have internal predecessors, (40), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 16:02:04,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2024-10-13 16:02:04,868 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 11 [2024-10-13 16:02:04,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:02:04,868 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-10-13 16:02:04,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 16:02:04,869 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2024-10-13 16:02:04,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 16:02:04,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:02:04,870 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:02:04,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 16:02:04,870 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 16:02:04,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:02:04,871 INFO L85 PathProgramCache]: Analyzing trace with hash -859746870, now seen corresponding path program 1 times [2024-10-13 16:02:04,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:02:04,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089841247] [2024-10-13 16:02:04,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:02:04,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:02:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:04,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:02:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:04,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 16:02:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:04,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 16:02:04,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:02:04,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089841247] [2024-10-13 16:02:04,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089841247] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:02:04,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:02:04,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 16:02:04,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852302742] [2024-10-13 16:02:04,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:02:04,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:02:04,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:02:04,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:02:04,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:02:04,964 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 16:02:04,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:02:04,989 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2024-10-13 16:02:04,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:02:04,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-10-13 16:02:04,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:02:04,991 INFO L225 Difference]: With dead ends: 80 [2024-10-13 16:02:04,993 INFO L226 Difference]: Without dead ends: 42 [2024-10-13 16:02:04,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:02:04,995 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 16:02:04,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 42 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:02:04,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-13 16:02:05,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-13 16:02:05,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 34 states have internal predecessors, (36), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 16:02:05,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2024-10-13 16:02:05,011 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 20 [2024-10-13 16:02:05,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:02:05,012 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2024-10-13 16:02:05,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 16:02:05,012 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2024-10-13 16:02:05,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 16:02:05,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:02:05,013 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:02:05,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 16:02:05,013 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 16:02:05,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:02:05,014 INFO L85 PathProgramCache]: Analyzing trace with hash 155214931, now seen corresponding path program 1 times [2024-10-13 16:02:05,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:02:05,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565773643] [2024-10-13 16:02:05,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:02:05,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:02:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:05,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:02:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:05,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 16:02:05,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:05,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 16:02:05,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:02:05,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565773643] [2024-10-13 16:02:05,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565773643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:02:05,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:02:05,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 16:02:05,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689663167] [2024-10-13 16:02:05,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:02:05,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:02:05,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:02:05,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:02:05,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:02:05,089 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 16:02:05,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:02:05,106 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2024-10-13 16:02:05,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:02:05,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-10-13 16:02:05,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:02:05,108 INFO L225 Difference]: With dead ends: 60 [2024-10-13 16:02:05,108 INFO L226 Difference]: Without dead ends: 36 [2024-10-13 16:02:05,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:02:05,109 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 16:02:05,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:02:05,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-13 16:02:05,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-13 16:02:05,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 29 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 16:02:05,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2024-10-13 16:02:05,115 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 21 [2024-10-13 16:02:05,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:02:05,116 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2024-10-13 16:02:05,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 16:02:05,116 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2024-10-13 16:02:05,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-13 16:02:05,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:02:05,117 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:02:05,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 16:02:05,118 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 16:02:05,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:02:05,118 INFO L85 PathProgramCache]: Analyzing trace with hash 646908377, now seen corresponding path program 1 times [2024-10-13 16:02:05,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:02:05,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664097129] [2024-10-13 16:02:05,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:02:05,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:02:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:05,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:02:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:05,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 16:02:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:05,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 16:02:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:05,190 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 16:02:05,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:02:05,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664097129] [2024-10-13 16:02:05,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664097129] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:02:05,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:02:05,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 16:02:05,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817338940] [2024-10-13 16:02:05,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:02:05,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:02:05,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:02:05,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:02:05,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:02:05,196 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 16:02:05,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:02:05,212 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2024-10-13 16:02:05,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:02:05,213 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2024-10-13 16:02:05,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:02:05,213 INFO L225 Difference]: With dead ends: 36 [2024-10-13 16:02:05,213 INFO L226 Difference]: Without dead ends: 35 [2024-10-13 16:02:05,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:02:05,215 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 16:02:05,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:02:05,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-13 16:02:05,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-13 16:02:05,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 28 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 16:02:05,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2024-10-13 16:02:05,221 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 30 [2024-10-13 16:02:05,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:02:05,223 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2024-10-13 16:02:05,223 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 16:02:05,224 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2024-10-13 16:02:05,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 16:02:05,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:02:05,225 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:02:05,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 16:02:05,225 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 16:02:05,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:02:05,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1420676679, now seen corresponding path program 1 times [2024-10-13 16:02:05,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:02:05,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748872912] [2024-10-13 16:02:05,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:02:05,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:02:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:05,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:02:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:05,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 16:02:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:05,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 16:02:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:05,314 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 16:02:05,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:02:05,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748872912] [2024-10-13 16:02:05,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748872912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:02:05,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:02:05,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 16:02:05,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806455099] [2024-10-13 16:02:05,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:02:05,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:02:05,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:02:05,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:02:05,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:02:05,319 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 16:02:05,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:02:05,340 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2024-10-13 16:02:05,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:02:05,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2024-10-13 16:02:05,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:02:05,341 INFO L225 Difference]: With dead ends: 35 [2024-10-13 16:02:05,341 INFO L226 Difference]: Without dead ends: 34 [2024-10-13 16:02:05,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:02:05,343 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 16:02:05,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:02:05,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-13 16:02:05,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-13 16:02:05,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 27 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 16:02:05,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2024-10-13 16:02:05,355 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 31 [2024-10-13 16:02:05,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:02:05,355 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2024-10-13 16:02:05,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 16:02:05,355 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2024-10-13 16:02:05,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-13 16:02:05,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:02:05,356 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:02:05,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 16:02:05,356 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 16:02:05,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:02:05,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1776250326, now seen corresponding path program 1 times [2024-10-13 16:02:05,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:02:05,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753120382] [2024-10-13 16:02:05,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:02:05,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:02:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:05,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:02:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:05,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 16:02:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:05,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 16:02:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:05,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 16:02:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:05,440 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 16:02:05,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:02:05,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753120382] [2024-10-13 16:02:05,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753120382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:02:05,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:02:05,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 16:02:05,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274423558] [2024-10-13 16:02:05,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:02:05,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:02:05,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:02:05,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:02:05,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:02:05,442 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 16:02:05,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:02:05,456 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2024-10-13 16:02:05,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:02:05,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2024-10-13 16:02:05,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:02:05,458 INFO L225 Difference]: With dead ends: 34 [2024-10-13 16:02:05,459 INFO L226 Difference]: Without dead ends: 33 [2024-10-13 16:02:05,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:02:05,461 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 16:02:05,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 59 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:02:05,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-13 16:02:05,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-13 16:02:05,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 16:02:05,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2024-10-13 16:02:05,469 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 39 [2024-10-13 16:02:05,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:02:05,470 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2024-10-13 16:02:05,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 16:02:05,470 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2024-10-13 16:02:05,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-13 16:02:05,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:02:05,471 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:02:05,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 16:02:05,471 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 16:02:05,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:02:05,472 INFO L85 PathProgramCache]: Analyzing trace with hash -770814609, now seen corresponding path program 1 times [2024-10-13 16:02:05,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:02:05,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663191857] [2024-10-13 16:02:05,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:02:05,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:02:05,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:05,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:02:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:05,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 16:02:05,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:05,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 16:02:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:05,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 16:02:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:05,538 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 16:02:05,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:02:05,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663191857] [2024-10-13 16:02:05,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663191857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:02:05,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:02:05,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 16:02:05,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504175063] [2024-10-13 16:02:05,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:02:05,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:02:05,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:02:05,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:02:05,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:02:05,541 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 16:02:05,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:02:05,551 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2024-10-13 16:02:05,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:02:05,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2024-10-13 16:02:05,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:02:05,553 INFO L225 Difference]: With dead ends: 33 [2024-10-13 16:02:05,553 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 16:02:05,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:02:05,556 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 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-13 16:02:05,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:02:05,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 16:02:05,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 16:02:05,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:02:05,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 16:02:05,559 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2024-10-13 16:02:05,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:02:05,559 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 16:02:05,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 16:02:05,559 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 16:02:05,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 16:02:05,562 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-13 16:02:05,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-13 16:02:05,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-13 16:02:05,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-13 16:02:05,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-13 16:02:05,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-13 16:02:05,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-13 16:02:05,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-13 16:02:05,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 16:02:05,571 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:02:05,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 16:02:05,642 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 16:02:05,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:02:05 BoogieIcfgContainer [2024-10-13 16:02:05,657 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 16:02:05,658 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 16:02:05,658 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 16:02:05,658 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 16:02:05,659 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:02:04" (3/4) ... [2024-10-13 16:02:05,661 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 16:02:05,664 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-13 16:02:05,664 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-13 16:02:05,670 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-10-13 16:02:05,671 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-13 16:02:05,671 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 16:02:05,672 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 16:02:05,762 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 16:02:05,764 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 16:02:05,765 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 16:02:05,765 INFO L158 Benchmark]: Toolchain (without parser) took 3329.62ms. Allocated memory was 155.2MB in the beginning and 213.9MB in the end (delta: 58.7MB). Free memory was 104.6MB in the beginning and 126.3MB in the end (delta: -21.7MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. [2024-10-13 16:02:05,765 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 155.2MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 16:02:05,766 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1080.51ms. Allocated memory was 155.2MB in the beginning and 213.9MB in the end (delta: 58.7MB). Free memory was 104.6MB in the beginning and 167.4MB in the end (delta: -62.8MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. [2024-10-13 16:02:05,766 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.37ms. Allocated memory is still 213.9MB. Free memory was 167.4MB in the beginning and 164.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 16:02:05,766 INFO L158 Benchmark]: Boogie Preprocessor took 59.48ms. Allocated memory is still 213.9MB. Free memory was 164.2MB in the beginning and 162.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 16:02:05,766 INFO L158 Benchmark]: RCFGBuilder took 441.12ms. Allocated memory is still 213.9MB. Free memory was 162.1MB in the beginning and 145.4MB in the end (delta: 16.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 16:02:05,767 INFO L158 Benchmark]: TraceAbstraction took 1559.27ms. Allocated memory is still 213.9MB. Free memory was 144.3MB in the beginning and 131.3MB in the end (delta: 13.0MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-10-13 16:02:05,767 INFO L158 Benchmark]: Witness Printer took 106.65ms. Allocated memory is still 213.9MB. Free memory was 131.3MB in the beginning and 126.3MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 16:02:05,768 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.20ms. Allocated memory is still 155.2MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1080.51ms. Allocated memory was 155.2MB in the beginning and 213.9MB in the end (delta: 58.7MB). Free memory was 104.6MB in the beginning and 167.4MB in the end (delta: -62.8MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.37ms. Allocated memory is still 213.9MB. Free memory was 167.4MB in the beginning and 164.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.48ms. Allocated memory is still 213.9MB. Free memory was 164.2MB in the beginning and 162.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 441.12ms. Allocated memory is still 213.9MB. Free memory was 162.1MB in the beginning and 145.4MB in the end (delta: 16.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1559.27ms. Allocated memory is still 213.9MB. Free memory was 144.3MB in the beginning and 131.3MB in the end (delta: 13.0MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Witness Printer took 106.65ms. Allocated memory is still 213.9MB. Free memory was 131.3MB in the beginning and 126.3MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 58 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 98 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 97 mSDsluCounter, 527 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 206 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 70 IncrementalHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 321 mSDtfsCounter, 70 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=0, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 203 NumberOfCodeBlocks, 203 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 56/56 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-13 16:02:05,795 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