./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/hh2012-ex1b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/hh2012-ex1b.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7ce79fe11836d82ec064e02fff135ad9866417774e7d276b3384b4d4dde863b5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:28:06,977 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:28:07,050 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 20:28:07,057 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:28:07,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:28:07,088 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:28:07,089 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:28:07,089 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:28:07,090 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:28:07,090 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:28:07,090 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:28:07,091 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:28:07,091 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:28:07,092 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:28:07,092 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:28:07,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:28:07,093 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:28:07,094 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:28:07,094 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:28:07,094 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:28:07,095 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:28:07,098 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:28:07,098 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:28:07,098 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:28:07,099 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:28:07,099 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:28:07,099 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:28:07,100 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:28:07,100 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:28:07,100 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:28:07,101 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:28:07,101 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:28:07,101 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:28:07,101 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:28:07,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:28:07,102 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:28:07,102 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:28:07,103 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:28:07,103 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:28:07,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:28:07,104 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:28:07,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:28:07,104 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:28:07,105 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:28:07,105 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-clean/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-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7ce79fe11836d82ec064e02fff135ad9866417774e7d276b3384b4d4dde863b5 [2024-10-11 20:28:07,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:28:07,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:28:07,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:28:07,365 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:28:07,366 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:28:07,368 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/hh2012-ex1b.i [2024-10-11 20:28:08,859 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:28:09,039 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:28:09,040 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/hh2012-ex1b.i [2024-10-11 20:28:09,046 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/92c9d4256/241b01790f594630b1f20cdec062e81c/FLAG6ba245cab [2024-10-11 20:28:09,059 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/92c9d4256/241b01790f594630b1f20cdec062e81c [2024-10-11 20:28:09,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:28:09,063 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:28:09,064 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:28:09,065 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:28:09,069 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:28:09,070 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:28:09" (1/1) ... [2024-10-11 20:28:09,071 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5182bdb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:28:09, skipping insertion in model container [2024-10-11 20:28:09,071 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:28:09" (1/1) ... [2024-10-11 20:28:09,091 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:28:09,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:28:09,277 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:28:09,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:28:09,310 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:28:09,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:28:09 WrapperNode [2024-10-11 20:28:09,311 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:28:09,312 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:28:09,312 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:28:09,313 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:28:09,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:28:09" (1/1) ... [2024-10-11 20:28:09,326 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:28:09" (1/1) ... [2024-10-11 20:28:09,343 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 42 [2024-10-11 20:28:09,344 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:28:09,344 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:28:09,345 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:28:09,345 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:28:09,354 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:28:09" (1/1) ... [2024-10-11 20:28:09,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:28:09" (1/1) ... [2024-10-11 20:28:09,356 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:28:09" (1/1) ... [2024-10-11 20:28:09,370 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 20:28:09,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:28:09" (1/1) ... [2024-10-11 20:28:09,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:28:09" (1/1) ... [2024-10-11 20:28:09,374 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:28:09" (1/1) ... [2024-10-11 20:28:09,379 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:28:09" (1/1) ... [2024-10-11 20:28:09,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:28:09" (1/1) ... [2024-10-11 20:28:09,382 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:28:09" (1/1) ... [2024-10-11 20:28:09,383 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:28:09,388 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:28:09,388 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:28:09,389 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:28:09,390 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:28:09" (1/1) ... [2024-10-11 20:28:09,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:28:09,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:28:09,434 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:28:09,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:28:09,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:28:09,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:28:09,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:28:09,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:28:09,478 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 20:28:09,479 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 20:28:09,533 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:28:09,535 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:28:09,627 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 20:28:09,627 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:28:09,653 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:28:09,653 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 20:28:09,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:28:09 BoogieIcfgContainer [2024-10-11 20:28:09,654 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:28:09,657 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:28:09,657 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:28:09,660 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:28:09,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:28:09" (1/3) ... [2024-10-11 20:28:09,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c45eb06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:28:09, skipping insertion in model container [2024-10-11 20:28:09,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:28:09" (2/3) ... [2024-10-11 20:28:09,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c45eb06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:28:09, skipping insertion in model container [2024-10-11 20:28:09,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:28:09" (3/3) ... [2024-10-11 20:28:09,663 INFO L112 eAbstractionObserver]: Analyzing ICFG hh2012-ex1b.i [2024-10-11 20:28:09,679 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:28:09,679 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-11 20:28:09,739 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:28:09,746 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;@35617a01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:28:09,747 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 20:28:09,750 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 20 states have internal predecessors, (25), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:28:09,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 20:28:09,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:28:09,758 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 20:28:09,759 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:28:09,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:28:09,764 INFO L85 PathProgramCache]: Analyzing trace with hash 3049894, now seen corresponding path program 1 times [2024-10-11 20:28:09,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:28:09,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010057162] [2024-10-11 20:28:09,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:28:09,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:28:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:10,006 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-11 20:28:10,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:28:10,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010057162] [2024-10-11 20:28:10,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010057162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:28:10,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:28:10,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:28:10,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774577532] [2024-10-11 20:28:10,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:28:10,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:28:10,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:28:10,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:28:10,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:28:10,076 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 20 states have internal predecessors, (25), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:28:10,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:28:10,144 INFO L93 Difference]: Finished difference Result 51 states and 75 transitions. [2024-10-11 20:28:10,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:28:10,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 20:28:10,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:28:10,153 INFO L225 Difference]: With dead ends: 51 [2024-10-11 20:28:10,153 INFO L226 Difference]: Without dead ends: 23 [2024-10-11 20:28:10,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:28:10,162 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:28:10,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 61 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:28:10,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-11 20:28:10,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-11 20:28:10,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 20:28:10,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-10-11 20:28:10,205 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 4 [2024-10-11 20:28:10,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:28:10,207 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-10-11 20:28:10,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:28:10,207 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2024-10-11 20:28:10,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 20:28:10,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:28:10,209 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:28:10,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:28:10,210 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:28:10,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:28:10,211 INFO L85 PathProgramCache]: Analyzing trace with hash 658418078, now seen corresponding path program 1 times [2024-10-11 20:28:10,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:28:10,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246899107] [2024-10-11 20:28:10,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:28:10,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:28:10,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:10,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 20:28:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:10,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:28:10,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:28:10,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246899107] [2024-10-11 20:28:10,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246899107] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:28:10,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693409266] [2024-10-11 20:28:10,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:28:10,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:28:10,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:28:10,382 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:28:10,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:28:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:10,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:28:10,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:28:10,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:28:10,531 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:28:10,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693409266] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:28:10,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:28:10,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-11 20:28:10,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188798314] [2024-10-11 20:28:10,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:28:10,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:28:10,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:28:10,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:28:10,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:28:10,538 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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-11 20:28:10,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:28:10,587 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2024-10-11 20:28:10,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:28:10,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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 12 [2024-10-11 20:28:10,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:28:10,593 INFO L225 Difference]: With dead ends: 23 [2024-10-11 20:28:10,593 INFO L226 Difference]: Without dead ends: 22 [2024-10-11 20:28:10,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:28:10,594 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:28:10,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 44 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:28:10,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-11 20:28:10,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-11 20:28:10,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 20:28:10,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-10-11 20:28:10,600 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 12 [2024-10-11 20:28:10,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:28:10,601 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-10-11 20:28:10,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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-11 20:28:10,602 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-10-11 20:28:10,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 20:28:10,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:28:10,603 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:28:10,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 20:28:10,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:28:10,804 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:28:10,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:28:10,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1063876008, now seen corresponding path program 1 times [2024-10-11 20:28:10,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:28:10,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602943243] [2024-10-11 20:28:10,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:28:10,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:28:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:10,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 20:28:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:10,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:28:10,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:28:10,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602943243] [2024-10-11 20:28:10,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602943243] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:28:10,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:28:10,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:28:10,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977206039] [2024-10-11 20:28:10,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:28:10,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:28:10,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:28:10,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:28:10,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:28:10,882 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-11 20:28:10,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:28:10,893 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2024-10-11 20:28:10,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:28:10,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2024-10-11 20:28:10,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:28:10,895 INFO L225 Difference]: With dead ends: 22 [2024-10-11 20:28:10,895 INFO L226 Difference]: Without dead ends: 21 [2024-10-11 20:28:10,896 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-11 20:28:10,897 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:28:10,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:28:10,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-11 20:28:10,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2024-10-11 20:28:10,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 20:28:10,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-10-11 20:28:10,907 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2024-10-11 20:28:10,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:28:10,907 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-10-11 20:28:10,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-11 20:28:10,907 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2024-10-11 20:28:10,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 20:28:10,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:28:10,908 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:28:10,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:28:10,908 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:28:10,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:28:10,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1191462494, now seen corresponding path program 1 times [2024-10-11 20:28:10,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:28:10,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763455435] [2024-10-11 20:28:10,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:28:10,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:28:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:11,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 20:28:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:11,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 20:28:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:11,027 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:28:11,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:28:11,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763455435] [2024-10-11 20:28:11,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763455435] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:28:11,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230296485] [2024-10-11 20:28:11,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:28:11,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:28:11,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:28:11,033 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:28:11,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:28:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:11,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:28:11,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:28:11,117 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:28:11,117 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:28:11,178 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:28:11,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230296485] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:28:11,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:28:11,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-11 20:28:11,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757446757] [2024-10-11 20:28:11,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:28:11,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 20:28:11,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:28:11,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 20:28:11,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:28:11,181 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 20:28:11,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:28:11,237 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2024-10-11 20:28:11,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:28:11,238 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 18 [2024-10-11 20:28:11,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:28:11,239 INFO L225 Difference]: With dead ends: 45 [2024-10-11 20:28:11,240 INFO L226 Difference]: Without dead ends: 27 [2024-10-11 20:28:11,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:28:11,242 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:28:11,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:28:11,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-11 20:28:11,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-11 20:28:11,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:28:11,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-10-11 20:28:11,250 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 18 [2024-10-11 20:28:11,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:28:11,251 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-10-11 20:28:11,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 20:28:11,251 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-10-11 20:28:11,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 20:28:11,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:28:11,252 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:28:11,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 20:28:11,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:28:11,453 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:28:11,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:28:11,453 INFO L85 PathProgramCache]: Analyzing trace with hash -852727218, now seen corresponding path program 2 times [2024-10-11 20:28:11,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:28:11,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845046530] [2024-10-11 20:28:11,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:28:11,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:28:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:11,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 20:28:11,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:11,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 20:28:11,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:11,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 20:28:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:11,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:28:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:11,549 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-11 20:28:11,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:28:11,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845046530] [2024-10-11 20:28:11,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845046530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:28:11,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:28:11,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:28:11,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899112300] [2024-10-11 20:28:11,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:28:11,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:28:11,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:28:11,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:28:11,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:28:11,552 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-11 20:28:11,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:28:11,579 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2024-10-11 20:28:11,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:28:11,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 34 [2024-10-11 20:28:11,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:28:11,581 INFO L225 Difference]: With dead ends: 47 [2024-10-11 20:28:11,581 INFO L226 Difference]: Without dead ends: 45 [2024-10-11 20:28:11,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:28:11,582 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:28:11,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 46 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:28:11,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-11 20:28:11,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-11 20:28:11,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 20:28:11,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2024-10-11 20:28:11,595 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 34 [2024-10-11 20:28:11,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:28:11,596 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2024-10-11 20:28:11,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-11 20:28:11,596 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2024-10-11 20:28:11,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 20:28:11,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:28:11,602 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:28:11,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:28:11,602 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:28:11,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:28:11,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1734661421, now seen corresponding path program 1 times [2024-10-11 20:28:11,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:28:11,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117973122] [2024-10-11 20:28:11,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:28:11,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:28:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:11,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 20:28:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:11,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 20:28:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:11,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 20:28:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:11,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:28:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:11,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 20:28:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:11,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 20:28:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:11,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 20:28:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:11,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 20:28:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:11,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 20:28:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:11,917 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 44 proven. 15 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-10-11 20:28:11,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:28:11,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117973122] [2024-10-11 20:28:11,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117973122] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:28:11,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901262253] [2024-10-11 20:28:11,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:28:11,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:28:11,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:28:11,922 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:28:11,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:28:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:11,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 20:28:11,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:28:12,053 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 116 proven. 15 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-11 20:28:12,054 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:28:12,226 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 44 proven. 15 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-10-11 20:28:12,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901262253] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:28:12,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:28:12,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-10-11 20:28:12,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003004618] [2024-10-11 20:28:12,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:28:12,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 20:28:12,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:28:12,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 20:28:12,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-10-11 20:28:12,231 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2024-10-11 20:28:12,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:28:12,305 INFO L93 Difference]: Finished difference Result 107 states and 139 transitions. [2024-10-11 20:28:12,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 20:28:12,306 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) Word has length 74 [2024-10-11 20:28:12,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:28:12,308 INFO L225 Difference]: With dead ends: 107 [2024-10-11 20:28:12,308 INFO L226 Difference]: Without dead ends: 77 [2024-10-11 20:28:12,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-10-11 20:28:12,310 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:28:12,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:28:12,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-11 20:28:12,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-11 20:28:12,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 58 states have internal predecessors, (61), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 20:28:12,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 95 transitions. [2024-10-11 20:28:12,327 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 95 transitions. Word has length 74 [2024-10-11 20:28:12,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:28:12,328 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 95 transitions. [2024-10-11 20:28:12,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2024-10-11 20:28:12,328 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 95 transitions. [2024-10-11 20:28:12,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 20:28:12,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:28:12,331 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 14, 14, 14, 14, 14, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:28:12,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 20:28:12,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:28:12,532 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:28:12,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:28:12,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1433909613, now seen corresponding path program 2 times [2024-10-11 20:28:12,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:28:12,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582883791] [2024-10-11 20:28:12,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:28:12,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:28:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:12,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 20:28:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:12,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 20:28:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:12,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 20:28:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:12,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 20:28:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:12,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:28:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:12,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 20:28:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:12,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 20:28:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:12,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 20:28:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:12,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 20:28:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:12,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 20:28:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:12,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 20:28:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:12,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 20:28:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:12,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 20:28:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:12,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 20:28:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:13,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 20:28:13,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:13,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 20:28:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:13,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 20:28:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:13,017 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 212 proven. 91 refuted. 0 times theorem prover too weak. 638 trivial. 0 not checked. [2024-10-11 20:28:13,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:28:13,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582883791] [2024-10-11 20:28:13,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582883791] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:28:13,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068364232] [2024-10-11 20:28:13,020 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:28:13,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:28:13,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:28:13,021 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:28:13,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:28:13,105 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:28:13,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:28:13,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 20:28:13,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:28:13,209 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 492 proven. 91 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2024-10-11 20:28:13,210 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:28:13,612 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 212 proven. 91 refuted. 0 times theorem prover too weak. 638 trivial. 0 not checked. [2024-10-11 20:28:13,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068364232] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:28:13,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:28:13,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2024-10-11 20:28:13,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790864488] [2024-10-11 20:28:13,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:28:13,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-11 20:28:13,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:28:13,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-11 20:28:13,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 20:28:13,619 INFO L87 Difference]: Start difference. First operand 77 states and 95 transitions. Second operand has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 15 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 15 states have call predecessors, (20), 15 states have call successors, (20) [2024-10-11 20:28:13,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:28:13,740 INFO L93 Difference]: Finished difference Result 187 states and 247 transitions. [2024-10-11 20:28:13,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 20:28:13,740 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 15 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 15 states have call predecessors, (20), 15 states have call successors, (20) Word has length 138 [2024-10-11 20:28:13,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:28:13,742 INFO L225 Difference]: With dead ends: 187 [2024-10-11 20:28:13,742 INFO L226 Difference]: Without dead ends: 141 [2024-10-11 20:28:13,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 20:28:13,744 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:28:13,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:28:13,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-11 20:28:13,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-10-11 20:28:13,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 105 states have (on average 1.0380952380952382) internal successors, (109), 106 states have internal predecessors, (109), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 20:28:13,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 175 transitions. [2024-10-11 20:28:13,761 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 175 transitions. Word has length 138 [2024-10-11 20:28:13,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:28:13,762 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 175 transitions. [2024-10-11 20:28:13,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 15 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 15 states have call predecessors, (20), 15 states have call successors, (20) [2024-10-11 20:28:13,762 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 175 transitions. [2024-10-11 20:28:13,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-10-11 20:28:13,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:28:13,770 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:28:13,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 20:28:13,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-11 20:28:13,975 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:28:13,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:28:13,975 INFO L85 PathProgramCache]: Analyzing trace with hash -877101549, now seen corresponding path program 3 times [2024-10-11 20:28:13,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:28:13,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125997739] [2024-10-11 20:28:13,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:28:13,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:28:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 20:28:15,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 20:28:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 20:28:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 20:28:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:28:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 20:28:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 20:28:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 20:28:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 20:28:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 20:28:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 20:28:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 20:28:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 20:28:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 20:28:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 20:28:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 20:28:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 20:28:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 20:28:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 20:28:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 20:28:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-11 20:28:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 20:28:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 20:28:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-11 20:28:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 20:28:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 20:28:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-11 20:28:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-10-11 20:28:15,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-10-11 20:28:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-11 20:28:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-10-11 20:28:15,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-11 20:28:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-10-11 20:28:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3917 backedges. 932 proven. 435 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2024-10-11 20:28:15,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:28:15,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125997739] [2024-10-11 20:28:15,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125997739] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:28:15,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671719552] [2024-10-11 20:28:15,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 20:28:15,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:28:15,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:28:15,105 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:28:15,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:28:15,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-11 20:28:15,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:28:15,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:28:15,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:28:15,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3917 backedges. 935 proven. 0 refuted. 0 times theorem prover too weak. 2982 trivial. 0 not checked. [2024-10-11 20:28:15,387 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:28:15,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671719552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:28:15,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:28:15,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [33] total 36 [2024-10-11 20:28:15,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367718830] [2024-10-11 20:28:15,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:28:15,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:28:15,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:28:15,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:28:15,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=965, Unknown=0, NotChecked=0, Total=1260 [2024-10-11 20:28:15,390 INFO L87 Difference]: Start difference. First operand 141 states and 175 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:28:15,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:28:15,433 INFO L93 Difference]: Finished difference Result 141 states and 175 transitions. [2024-10-11 20:28:15,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:28:15,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 266 [2024-10-11 20:28:15,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:28:15,438 INFO L225 Difference]: With dead ends: 141 [2024-10-11 20:28:15,438 INFO L226 Difference]: Without dead ends: 140 [2024-10-11 20:28:15,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=295, Invalid=965, Unknown=0, NotChecked=0, Total=1260 [2024-10-11 20:28:15,442 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:28:15,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:28:15,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-11 20:28:15,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-10-11 20:28:15,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 105 states have (on average 1.0285714285714285) internal successors, (108), 105 states have internal predecessors, (108), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 20:28:15,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 174 transitions. [2024-10-11 20:28:15,478 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 174 transitions. Word has length 266 [2024-10-11 20:28:15,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:28:15,482 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 174 transitions. [2024-10-11 20:28:15,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:28:15,482 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 174 transitions. [2024-10-11 20:28:15,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-10-11 20:28:15,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:28:15,489 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 20:28:15,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 20:28:15,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:28:15,693 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:28:15,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:28:15,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1420344179, now seen corresponding path program 1 times [2024-10-11 20:28:15,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:28:15,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084816831] [2024-10-11 20:28:15,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:28:15,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:28:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 20:28:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 20:28:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 20:28:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 20:28:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:28:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 20:28:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 20:28:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 20:28:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 20:28:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 20:28:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 20:28:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 20:28:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 20:28:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 20:28:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 20:28:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 20:28:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 20:28:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 20:28:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 20:28:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 20:28:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-11 20:28:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 20:28:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 20:28:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-11 20:28:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 20:28:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 20:28:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-11 20:28:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-10-11 20:28:15,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-10-11 20:28:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-11 20:28:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-10-11 20:28:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-11 20:28:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-10-11 20:28:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:15,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3918 backedges. 935 proven. 0 refuted. 0 times theorem prover too weak. 2983 trivial. 0 not checked. [2024-10-11 20:28:15,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:28:15,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084816831] [2024-10-11 20:28:15,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084816831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:28:15,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:28:15,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:28:15,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408593912] [2024-10-11 20:28:15,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:28:15,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:28:15,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:28:15,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:28:15,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:28:15,916 INFO L87 Difference]: Start difference. First operand 140 states and 174 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:28:15,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:28:15,934 INFO L93 Difference]: Finished difference Result 140 states and 174 transitions. [2024-10-11 20:28:15,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:28:15,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 267 [2024-10-11 20:28:15,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:28:15,936 INFO L225 Difference]: With dead ends: 140 [2024-10-11 20:28:15,936 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:28:15,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:28:15,938 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:28:15,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:28:15,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:28:15,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:28:15,939 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-11 20:28:15,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:28:15,939 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 267 [2024-10-11 20:28:15,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:28:15,940 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:28:15,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:28:15,940 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:28:15,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:28:15,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-11 20:28:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-11 20:28:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-11 20:28:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-11 20:28:15,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 20:28:15,946 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2024-10-11 20:28:15,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:28:16,410 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:28:16,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:28:16 BoogieIcfgContainer [2024-10-11 20:28:16,428 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:28:16,428 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:28:16,428 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:28:16,429 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:28:16,429 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:28:09" (3/4) ... [2024-10-11 20:28:16,431 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:28:16,434 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-11 20:28:16,437 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-11 20:28:16,437 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 20:28:16,438 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 20:28:16,438 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:28:16,530 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:28:16,530 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:28:16,530 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:28:16,531 INFO L158 Benchmark]: Toolchain (without parser) took 7468.49ms. Allocated memory was 159.4MB in the beginning and 262.1MB in the end (delta: 102.8MB). Free memory was 105.1MB in the beginning and 204.4MB in the end (delta: -99.2MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2024-10-11 20:28:16,531 INFO L158 Benchmark]: CDTParser took 0.93ms. Allocated memory is still 159.4MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:28:16,532 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.19ms. Allocated memory is still 159.4MB. Free memory was 105.1MB in the beginning and 93.5MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 20:28:16,532 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.68ms. Allocated memory is still 159.4MB. Free memory was 93.5MB in the beginning and 92.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:28:16,532 INFO L158 Benchmark]: Boogie Preprocessor took 42.62ms. Allocated memory is still 159.4MB. Free memory was 92.1MB in the beginning and 90.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:28:16,533 INFO L158 Benchmark]: RCFGBuilder took 266.04ms. Allocated memory is still 159.4MB. Free memory was 90.0MB in the beginning and 79.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 20:28:16,533 INFO L158 Benchmark]: TraceAbstraction took 6770.99ms. Allocated memory was 159.4MB in the beginning and 262.1MB in the end (delta: 102.8MB). Free memory was 78.6MB in the beginning and 208.6MB in the end (delta: -130.0MB). Peak memory consumption was 105.7MB. Max. memory is 16.1GB. [2024-10-11 20:28:16,533 INFO L158 Benchmark]: Witness Printer took 102.30ms. Allocated memory is still 262.1MB. Free memory was 208.6MB in the beginning and 204.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 20:28:16,535 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.93ms. Allocated memory is still 159.4MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.19ms. Allocated memory is still 159.4MB. Free memory was 105.1MB in the beginning and 93.5MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.68ms. Allocated memory is still 159.4MB. Free memory was 93.5MB in the beginning and 92.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.62ms. Allocated memory is still 159.4MB. Free memory was 92.1MB in the beginning and 90.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 266.04ms. Allocated memory is still 159.4MB. Free memory was 90.0MB in the beginning and 79.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6770.99ms. Allocated memory was 159.4MB in the beginning and 262.1MB in the end (delta: 102.8MB). Free memory was 78.6MB in the beginning and 208.6MB in the end (delta: -130.0MB). Peak memory consumption was 105.7MB. Max. memory is 16.1GB. * Witness Printer took 102.30ms. Allocated memory is still 262.1MB. Free memory was 208.6MB in the beginning and 204.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 9, TraceHistogramMax: 33, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 564 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 413 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 271 IncrementalHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 151 mSDtfsCounter, 271 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1009 GetRequests, 906 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=7, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1334 NumberOfCodeBlocks, 1118 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1547 ConstructedInterpolants, 0 QuantifiedInterpolants, 2419 SizeOfPredicates, 0 NumberOfNonLiveVariables, 653 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 17 InterpolantComputations, 6 PerfectInterpolantSequences, 14541/15299 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: (0 < (2147483649 + i)) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((((0 <= (i + 2147483648)) && (1 <= j)) && (i <= 99)) || (((0 <= (i + 2147483648)) && (i <= 99)) && (j == 0))) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:28:16,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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