./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array08_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-15/array08_alloca.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash ea846d0aba06317f1556d20887ae97ba4fe62b0d875c0f978e04ead015c46479 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:25:31,645 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:25:31,724 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 20:25:31,730 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:25:31,730 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:25:31,752 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:25:31,754 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:25:31,754 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:25:31,755 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:25:31,757 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:25:31,758 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:25:31,758 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:25:31,758 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:25:31,759 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:25:31,759 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:25:31,759 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:25:31,759 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:25:31,759 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:25:31,759 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:25:31,760 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:25:31,760 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:25:31,761 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:25:31,761 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:25:31,761 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:25:31,761 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:25:31,762 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:25:31,762 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:25:31,762 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:25:31,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:25:31,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:25:31,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:25:31,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:25:31,763 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:25:31,763 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:25:31,763 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:25:31,763 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:25:31,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:25:31,763 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:25:31,763 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:25:31,764 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:25:31,764 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:25:31,765 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ea846d0aba06317f1556d20887ae97ba4fe62b0d875c0f978e04ead015c46479 [2024-10-11 20:25:32,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:25:32,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:25:32,030 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:25:32,031 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:25:32,031 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:25:32,032 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array08_alloca.i [2024-10-11 20:25:33,351 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:25:33,584 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:25:33,584 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array08_alloca.i [2024-10-11 20:25:33,602 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0548c8027/b9430510382742728df73dbf00fe3df0/FLAG498b9ff99 [2024-10-11 20:25:33,912 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0548c8027/b9430510382742728df73dbf00fe3df0 [2024-10-11 20:25:33,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:25:33,916 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:25:33,917 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:25:33,917 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:25:33,921 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:25:33,922 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:25:33" (1/1) ... [2024-10-11 20:25:33,923 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b917334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:33, skipping insertion in model container [2024-10-11 20:25:33,923 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:25:33" (1/1) ... [2024-10-11 20:25:33,949 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:25:34,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:25:34,196 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:25:34,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:25:34,259 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:25:34,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:34 WrapperNode [2024-10-11 20:25:34,260 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:25:34,260 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:25:34,261 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:25:34,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:25:34,266 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:25:34" (1/1) ... [2024-10-11 20:25:34,275 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:25:34" (1/1) ... [2024-10-11 20:25:34,292 INFO L138 Inliner]: procedures = 151, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2024-10-11 20:25:34,294 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:25:34,295 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:25:34,295 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:25:34,295 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:25:34,303 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:34" (1/1) ... [2024-10-11 20:25:34,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:34" (1/1) ... [2024-10-11 20:25:34,305 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:34" (1/1) ... [2024-10-11 20:25:34,317 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2024-10-11 20:25:34,318 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:34" (1/1) ... [2024-10-11 20:25:34,318 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:34" (1/1) ... [2024-10-11 20:25:34,321 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:34" (1/1) ... [2024-10-11 20:25:34,323 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:34" (1/1) ... [2024-10-11 20:25:34,324 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:34" (1/1) ... [2024-10-11 20:25:34,325 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:34" (1/1) ... [2024-10-11 20:25:34,326 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:25:34,327 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:25:34,327 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:25:34,327 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:25:34,328 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:34" (1/1) ... [2024-10-11 20:25:34,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:25:34,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:25:34,362 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:25:34,366 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:25:34,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 20:25:34,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 20:25:34,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 20:25:34,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 20:25:34,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:25:34,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:25:34,485 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:25:34,487 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:25:34,606 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-11 20:25:34,606 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:25:34,624 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:25:34,624 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 20:25:34,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:25:34 BoogieIcfgContainer [2024-10-11 20:25:34,624 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:25:34,626 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:25:34,626 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:25:34,628 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:25:34,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:25:33" (1/3) ... [2024-10-11 20:25:34,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758ef895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:25:34, skipping insertion in model container [2024-10-11 20:25:34,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:34" (2/3) ... [2024-10-11 20:25:34,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758ef895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:25:34, skipping insertion in model container [2024-10-11 20:25:34,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:25:34" (3/3) ... [2024-10-11 20:25:34,631 INFO L112 eAbstractionObserver]: Analyzing ICFG array08_alloca.i [2024-10-11 20:25:34,644 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:25:34,644 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-11 20:25:34,694 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:25:34,699 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;@2b1576bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:25:34,699 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 20:25:34,703 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:34,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 20:25:34,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:34,708 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:34,709 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:25:34,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:34,712 INFO L85 PathProgramCache]: Analyzing trace with hash 905519636, now seen corresponding path program 1 times [2024-10-11 20:25:34,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:34,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802722741] [2024-10-11 20:25:34,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:34,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:34,837 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:25:34,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:34,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802722741] [2024-10-11 20:25:34,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802722741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:25:34,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:25:34,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:25:34,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28380759] [2024-10-11 20:25:34,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:25:34,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 20:25:34,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:34,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 20:25:34,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:25:34,864 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:25:34,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:34,881 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2024-10-11 20:25:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 20:25:34,883 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2024-10-11 20:25:34,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:34,890 INFO L225 Difference]: With dead ends: 29 [2024-10-11 20:25:34,890 INFO L226 Difference]: Without dead ends: 17 [2024-10-11 20:25:34,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:25:34,895 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:34,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:25:34,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-10-11 20:25:34,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-10-11 20:25:34,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 16 states have internal predecessors, (20), 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:25:34,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2024-10-11 20:25:34,934 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 8 [2024-10-11 20:25:34,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:34,935 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-10-11 20:25:34,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:25:34,935 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2024-10-11 20:25:34,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 20:25:34,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:34,936 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:34,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:25:34,936 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:25:34,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:34,937 INFO L85 PathProgramCache]: Analyzing trace with hash 905072771, now seen corresponding path program 1 times [2024-10-11 20:25:34,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:34,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417763318] [2024-10-11 20:25:34,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:34,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:35,087 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:25:35,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:35,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417763318] [2024-10-11 20:25:35,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417763318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:25:35,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:25:35,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:25:35,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217461954] [2024-10-11 20:25:35,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:25:35,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:25:35,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:35,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:25:35,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:25:35,090 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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:25:35,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:35,130 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2024-10-11 20:25:35,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:25:35,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2024-10-11 20:25:35,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:35,131 INFO L225 Difference]: With dead ends: 26 [2024-10-11 20:25:35,131 INFO L226 Difference]: Without dead ends: 20 [2024-10-11 20:25:35,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:25:35,133 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 22 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 22 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:25:35,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 22 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:25:35,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-11 20:25:35,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2024-10-11 20:25:35,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.5) internal successors, (21), 17 states have internal predecessors, (21), 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:25:35,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-10-11 20:25:35,137 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 8 [2024-10-11 20:25:35,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:35,137 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-10-11 20:25:35,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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:25:35,138 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2024-10-11 20:25:35,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 20:25:35,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:35,138 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:35,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:25:35,139 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:25:35,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:35,139 INFO L85 PathProgramCache]: Analyzing trace with hash 905120277, now seen corresponding path program 1 times [2024-10-11 20:25:35,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:35,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149805802] [2024-10-11 20:25:35,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:35,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:35,238 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:25:35,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:35,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149805802] [2024-10-11 20:25:35,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149805802] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:25:35,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:25:35,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:25:35,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338931508] [2024-10-11 20:25:35,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:25:35,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:25:35,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:35,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:25:35,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:25:35,242 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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:25:35,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:35,266 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2024-10-11 20:25:35,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:25:35,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2024-10-11 20:25:35,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:35,268 INFO L225 Difference]: With dead ends: 24 [2024-10-11 20:25:35,268 INFO L226 Difference]: Without dead ends: 22 [2024-10-11 20:25:35,268 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:25:35,269 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:35,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 38 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:25:35,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-11 20:25:35,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-11 20:25:35,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:35,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-10-11 20:25:35,273 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 8 [2024-10-11 20:25:35,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:35,273 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-10-11 20:25:35,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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:25:35,273 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-10-11 20:25:35,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 20:25:35,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:35,274 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:35,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:25:35,274 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:25:35,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:35,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1043823779, now seen corresponding path program 1 times [2024-10-11 20:25:35,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:35,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267451489] [2024-10-11 20:25:35,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:35,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:35,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:35,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:35,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267451489] [2024-10-11 20:25:35,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267451489] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:25:35,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537059589] [2024-10-11 20:25:35,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:35,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:35,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:25:35,618 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:25:35,619 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:25:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:35,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 20:25:35,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:25:35,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 20:25:35,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:35,782 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:25:35,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2024-10-11 20:25:35,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2024-10-11 20:25:35,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:35,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537059589] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:25:35,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:25:35,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 14 [2024-10-11 20:25:35,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866168371] [2024-10-11 20:25:35,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:25:35,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 20:25:35,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:35,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 20:25:35,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-10-11 20:25:35,869 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 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:25:36,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:36,070 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-10-11 20:25:36,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 20:25:36,070 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 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 13 [2024-10-11 20:25:36,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:36,071 INFO L225 Difference]: With dead ends: 40 [2024-10-11 20:25:36,071 INFO L226 Difference]: Without dead ends: 38 [2024-10-11 20:25:36,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2024-10-11 20:25:36,073 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 68 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:36,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 74 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:25:36,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-11 20:25:36,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2024-10-11 20:25:36,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 31 states have internal predecessors, (37), 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:25:36,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2024-10-11 20:25:36,079 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 13 [2024-10-11 20:25:36,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:36,079 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2024-10-11 20:25:36,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 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:25:36,079 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2024-10-11 20:25:36,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 20:25:36,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:36,080 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:36,092 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:25:36,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:36,281 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:25:36,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:36,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1043776273, now seen corresponding path program 1 times [2024-10-11 20:25:36,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:36,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960445882] [2024-10-11 20:25:36,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:36,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:36,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:36,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:36,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960445882] [2024-10-11 20:25:36,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960445882] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:25:36,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85467746] [2024-10-11 20:25:36,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:36,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:36,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:25:36,433 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:25:36,435 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:25:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:36,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:25:36,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:25:36,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:36,551 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:25:36,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85467746] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:25:36,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:25:36,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 10 [2024-10-11 20:25:36,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172793273] [2024-10-11 20:25:36,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:25:36,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:25:36,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:36,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:25:36,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:25:36,554 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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:25:36,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:36,600 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2024-10-11 20:25:36,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:25:36,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 13 [2024-10-11 20:25:36,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:36,601 INFO L225 Difference]: With dead ends: 71 [2024-10-11 20:25:36,601 INFO L226 Difference]: Without dead ends: 56 [2024-10-11 20:25:36,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:25:36,602 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 8 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:36,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 47 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:25:36,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-11 20:25:36,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 44. [2024-10-11 20:25:36,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.25) internal successors, (50), 43 states have internal predecessors, (50), 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:25:36,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2024-10-11 20:25:36,609 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 13 [2024-10-11 20:25:36,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:36,610 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2024-10-11 20:25:36,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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:25:36,610 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2024-10-11 20:25:36,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 20:25:36,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:36,611 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:36,631 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:25:36,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:36,812 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:25:36,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:36,812 INFO L85 PathProgramCache]: Analyzing trace with hash -785610835, now seen corresponding path program 1 times [2024-10-11 20:25:36,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:36,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797685635] [2024-10-11 20:25:36,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:36,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:36,878 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:36,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:36,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797685635] [2024-10-11 20:25:36,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797685635] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:25:36,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001820278] [2024-10-11 20:25:36,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:36,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:36,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:25:36,882 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:25:36,883 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:25:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:36,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:25:36,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:25:36,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:36,953 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:25:36,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001820278] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:25:36,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:25:36,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-11 20:25:36,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715863623] [2024-10-11 20:25:36,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:25:36,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:25:36,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:36,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:25:36,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:25:36,955 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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:25:36,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:36,992 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2024-10-11 20:25:36,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:25:36,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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 13 [2024-10-11 20:25:36,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:36,993 INFO L225 Difference]: With dead ends: 44 [2024-10-11 20:25:36,993 INFO L226 Difference]: Without dead ends: 43 [2024-10-11 20:25:36,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:25:36,994 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:36,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 34 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:25:36,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-11 20:25:36,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-11 20:25:36,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 40 states have (on average 1.225) internal successors, (49), 42 states have internal predecessors, (49), 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:25:36,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2024-10-11 20:25:36,999 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 13 [2024-10-11 20:25:36,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:36,999 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-10-11 20:25:36,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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:25:37,000 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2024-10-11 20:25:37,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 20:25:37,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:37,000 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:37,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 20:25:37,201 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:25:37,201 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:25:37,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:37,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1613707627, now seen corresponding path program 1 times [2024-10-11 20:25:37,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:37,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373454387] [2024-10-11 20:25:37,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:37,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:37,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:37,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:37,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373454387] [2024-10-11 20:25:37,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373454387] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:25:37,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565481759] [2024-10-11 20:25:37,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:37,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:37,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:25:37,365 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:25:37,367 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:25:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:37,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 20:25:37,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:25:37,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 20:25:37,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 20:25:37,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:37,457 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:25:37,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-10-11 20:25:37,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-10-11 20:25:37,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:37,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565481759] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:25:37,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:25:37,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2024-10-11 20:25:37,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361787368] [2024-10-11 20:25:37,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:25:37,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 20:25:37,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:37,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 20:25:37,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-10-11 20:25:37,530 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:37,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:37,603 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2024-10-11 20:25:37,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:25:37,604 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 20:25:37,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:37,605 INFO L225 Difference]: With dead ends: 45 [2024-10-11 20:25:37,605 INFO L226 Difference]: Without dead ends: 44 [2024-10-11 20:25:37,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-10-11 20:25:37,606 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:37,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 63 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:25:37,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-11 20:25:37,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2024-10-11 20:25:37,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 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:25:37,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2024-10-11 20:25:37,611 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 14 [2024-10-11 20:25:37,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:37,611 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2024-10-11 20:25:37,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:37,613 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2024-10-11 20:25:37,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 20:25:37,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:37,613 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:37,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 20:25:37,814 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:25:37,815 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:25:37,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:37,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1415867954, now seen corresponding path program 1 times [2024-10-11 20:25:37,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:37,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692222059] [2024-10-11 20:25:37,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:37,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:37,878 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:37,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:37,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692222059] [2024-10-11 20:25:37,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692222059] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:25:37,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802853389] [2024-10-11 20:25:37,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:37,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:37,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:25:37,883 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:25:37,885 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:25:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:37,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:25:37,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:25:37,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:37,954 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:25:37,991 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:37,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802853389] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:25:37,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:25:37,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-11 20:25:37,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005800650] [2024-10-11 20:25:37,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:25:37,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:25:37,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:37,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:25:37,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:25:37,994 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:38,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:38,038 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2024-10-11 20:25:38,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:25:38,039 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 20:25:38,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:38,040 INFO L225 Difference]: With dead ends: 48 [2024-10-11 20:25:38,040 INFO L226 Difference]: Without dead ends: 47 [2024-10-11 20:25:38,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:25:38,041 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:38,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 59 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:25:38,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-11 20:25:38,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-11 20:25:38,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 46 states have internal predecessors, (58), 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:25:38,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2024-10-11 20:25:38,047 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 14 [2024-10-11 20:25:38,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:38,047 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2024-10-11 20:25:38,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:38,048 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2024-10-11 20:25:38,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 20:25:38,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:38,048 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:38,061 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:25:38,252 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:25:38,253 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:25:38,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:38,253 INFO L85 PathProgramCache]: Analyzing trace with hash -990897835, now seen corresponding path program 1 times [2024-10-11 20:25:38,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:38,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45437133] [2024-10-11 20:25:38,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:38,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:38,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:38,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:38,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45437133] [2024-10-11 20:25:38,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45437133] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:25:38,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790059157] [2024-10-11 20:25:38,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:38,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:38,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:25:38,472 INFO L229 MonitoredProcess]: Starting monitored process 7 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:25:38,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 20:25:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:38,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 20:25:38,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:25:38,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 20:25:38,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:38,610 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:25:38,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2024-10-11 20:25:38,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-10-11 20:25:38,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:38,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790059157] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:25:38,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:25:38,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 19 [2024-10-11 20:25:38,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705381719] [2024-10-11 20:25:38,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:25:38,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 20:25:38,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:38,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 20:25:38,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2024-10-11 20:25:38,695 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 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:25:38,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:38,787 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2024-10-11 20:25:38,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:25:38,788 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 20:25:38,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:38,788 INFO L225 Difference]: With dead ends: 70 [2024-10-11 20:25:38,788 INFO L226 Difference]: Without dead ends: 56 [2024-10-11 20:25:38,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2024-10-11 20:25:38,789 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 33 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:38,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 54 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:25:38,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-11 20:25:38,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2024-10-11 20:25:38,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 46 states have internal predecessors, (57), 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:25:38,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2024-10-11 20:25:38,795 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 16 [2024-10-11 20:25:38,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:38,795 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2024-10-11 20:25:38,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 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:25:38,796 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2024-10-11 20:25:38,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 20:25:38,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:38,796 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:38,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 20:25:38,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-11 20:25:38,997 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:25:38,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:38,997 INFO L85 PathProgramCache]: Analyzing trace with hash -289833257, now seen corresponding path program 1 times [2024-10-11 20:25:38,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:38,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177883057] [2024-10-11 20:25:38,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:38,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:39,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:25:39,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:39,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177883057] [2024-10-11 20:25:39,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177883057] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:25:39,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816420654] [2024-10-11 20:25:39,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:39,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:39,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:25:39,146 INFO L229 MonitoredProcess]: Starting monitored process 8 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:25:39,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 20:25:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:39,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 20:25:39,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:25:39,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 20:25:39,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 20:25:39,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:39,308 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:25:39,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2024-10-11 20:25:39,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-10-11 20:25:39,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:39,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816420654] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:25:39,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:25:39,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 19 [2024-10-11 20:25:39,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521243203] [2024-10-11 20:25:39,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:25:39,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 20:25:39,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:39,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 20:25:39,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-10-11 20:25:39,405 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 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:25:39,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:39,586 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2024-10-11 20:25:39,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 20:25:39,587 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 20:25:39,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:39,587 INFO L225 Difference]: With dead ends: 57 [2024-10-11 20:25:39,587 INFO L226 Difference]: Without dead ends: 39 [2024-10-11 20:25:39,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2024-10-11 20:25:39,588 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:39,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 87 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:25:39,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-11 20:25:39,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-11 20:25:39,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 38 states have internal predecessors, (48), 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:25:39,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2024-10-11 20:25:39,592 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 16 [2024-10-11 20:25:39,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:39,592 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2024-10-11 20:25:39,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 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:25:39,592 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2024-10-11 20:25:39,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 20:25:39,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:39,593 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:39,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 20:25:39,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:39,797 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:25:39,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:39,798 INFO L85 PathProgramCache]: Analyzing trace with hash 2024205783, now seen corresponding path program 1 times [2024-10-11 20:25:39,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:39,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716928114] [2024-10-11 20:25:39,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:39,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:40,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:40,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:40,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716928114] [2024-10-11 20:25:40,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716928114] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:25:40,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978034670] [2024-10-11 20:25:40,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:40,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:40,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:25:40,013 INFO L229 MonitoredProcess]: Starting monitored process 9 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:25:40,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 20:25:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:40,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 20:25:40,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:25:40,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 20:25:40,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:40,178 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:25:40,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-10-11 20:25:40,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-10-11 20:25:40,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:40,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978034670] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:25:40,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:25:40,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2024-10-11 20:25:40,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595491626] [2024-10-11 20:25:40,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:25:40,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 20:25:40,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:40,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 20:25:40,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2024-10-11 20:25:40,298 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 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:25:40,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:40,627 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2024-10-11 20:25:40,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 20:25:40,627 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 20:25:40,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:40,628 INFO L225 Difference]: With dead ends: 61 [2024-10-11 20:25:40,628 INFO L226 Difference]: Without dead ends: 43 [2024-10-11 20:25:40,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=1164, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 20:25:40,629 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 40 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:40,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 82 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:25:40,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-11 20:25:40,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2024-10-11 20:25:40,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 38 states have internal predecessors, (47), 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:25:40,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2024-10-11 20:25:40,633 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 16 [2024-10-11 20:25:40,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:40,633 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2024-10-11 20:25:40,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 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:25:40,633 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2024-10-11 20:25:40,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 20:25:40,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:40,634 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:40,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 20:25:40,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 20:25:40,835 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:25:40,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:40,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1979810067, now seen corresponding path program 2 times [2024-10-11 20:25:40,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:40,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571586352] [2024-10-11 20:25:40,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:40,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:41,172 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:41,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:41,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571586352] [2024-10-11 20:25:41,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571586352] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:25:41,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465388172] [2024-10-11 20:25:41,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:25:41,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:41,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:25:41,174 INFO L229 MonitoredProcess]: Starting monitored process 10 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:25:41,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 20:25:41,216 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:25:41,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:25:41,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 20:25:41,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:25:41,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 20:25:41,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 20:25:41,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-11 20:25:41,353 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:41,353 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:25:41,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 61 [2024-10-11 20:25:41,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 20:25:41,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 438 treesize of output 424 [2024-10-11 20:25:41,673 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:41,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465388172] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:25:41,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:25:41,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 24 [2024-10-11 20:25:41,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982717543] [2024-10-11 20:25:41,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:25:41,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 20:25:41,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:41,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 20:25:41,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2024-10-11 20:25:41,675 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 25 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 25 states have internal predecessors, (47), 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:25:42,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:42,182 INFO L93 Difference]: Finished difference Result 84 states and 99 transitions. [2024-10-11 20:25:42,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-11 20:25:42,182 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 25 states have internal predecessors, (47), 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 21 [2024-10-11 20:25:42,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:42,183 INFO L225 Difference]: With dead ends: 84 [2024-10-11 20:25:42,183 INFO L226 Difference]: Without dead ends: 82 [2024-10-11 20:25:42,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=269, Invalid=1213, Unknown=0, NotChecked=0, Total=1482 [2024-10-11 20:25:42,184 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 61 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:42,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 130 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:25:42,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-11 20:25:42,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 67. [2024-10-11 20:25:42,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 64 states have (on average 1.25) internal successors, (80), 66 states have internal predecessors, (80), 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:25:42,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2024-10-11 20:25:42,197 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 21 [2024-10-11 20:25:42,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:42,197 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2024-10-11 20:25:42,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 25 states have internal predecessors, (47), 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:25:42,198 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2024-10-11 20:25:42,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 20:25:42,199 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:42,199 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:42,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 20:25:42,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:42,400 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:25:42,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:42,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1294088875, now seen corresponding path program 1 times [2024-10-11 20:25:42,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:42,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125355307] [2024-10-11 20:25:42,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:42,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:42,952 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:42,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:42,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125355307] [2024-10-11 20:25:42,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125355307] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:25:42,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440482540] [2024-10-11 20:25:42,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:42,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:42,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:25:42,954 INFO L229 MonitoredProcess]: Starting monitored process 11 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:25:42,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 20:25:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:43,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 20:25:43,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:25:43,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 20:25:43,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-11 20:25:43,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-11 20:25:43,285 INFO L349 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2024-10-11 20:25:43,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 16 [2024-10-11 20:25:43,300 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:43,300 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:25:43,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2024-10-11 20:25:43,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 20:25:43,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 117 [2024-10-11 20:25:43,950 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:43,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440482540] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:25:43,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:25:43,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 42 [2024-10-11 20:25:43,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113162446] [2024-10-11 20:25:43,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:25:43,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-11 20:25:43,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:43,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-11 20:25:43,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1640, Unknown=0, NotChecked=0, Total=1806 [2024-10-11 20:25:43,953 INFO L87 Difference]: Start difference. First operand 67 states and 80 transitions. Second operand has 43 states, 42 states have (on average 1.380952380952381) internal successors, (58), 43 states have internal predecessors, (58), 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:25:45,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:45,467 INFO L93 Difference]: Finished difference Result 116 states and 140 transitions. [2024-10-11 20:25:45,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-11 20:25:45,468 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.380952380952381) internal successors, (58), 43 states have internal predecessors, (58), 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 21 [2024-10-11 20:25:45,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:45,468 INFO L225 Difference]: With dead ends: 116 [2024-10-11 20:25:45,469 INFO L226 Difference]: Without dead ends: 115 [2024-10-11 20:25:45,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1422 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=466, Invalid=4504, Unknown=0, NotChecked=0, Total=4970 [2024-10-11 20:25:45,470 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 93 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:45,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 76 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 20:25:45,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-11 20:25:45,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 87. [2024-10-11 20:25:45,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 84 states have (on average 1.2619047619047619) internal successors, (106), 86 states have internal predecessors, (106), 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:25:45,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2024-10-11 20:25:45,478 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 21 [2024-10-11 20:25:45,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:45,478 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2024-10-11 20:25:45,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.380952380952381) internal successors, (58), 43 states have internal predecessors, (58), 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:25:45,478 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2024-10-11 20:25:45,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 20:25:45,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:45,479 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:45,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-11 20:25:45,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 20:25:45,680 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:25:45,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:45,680 INFO L85 PathProgramCache]: Analyzing trace with hash -986404415, now seen corresponding path program 1 times [2024-10-11 20:25:45,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:45,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712462292] [2024-10-11 20:25:45,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:45,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 20:25:45,690 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 20:25:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 20:25:45,710 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 20:25:45,711 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 20:25:45,711 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-11 20:25:45,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-11 20:25:45,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-11 20:25:45,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-11 20:25:45,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 20:25:45,716 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:45,734 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:25:45,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:25:45 BoogieIcfgContainer [2024-10-11 20:25:45,736 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:25:45,737 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:25:45,737 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:25:45,737 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:25:45,737 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:25:34" (3/4) ... [2024-10-11 20:25:45,738 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 20:25:45,768 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:25:45,768 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:25:45,768 INFO L158 Benchmark]: Toolchain (without parser) took 11852.63ms. Allocated memory was 159.4MB in the beginning and 249.6MB in the end (delta: 90.2MB). Free memory was 91.9MB in the beginning and 150.0MB in the end (delta: -58.1MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. [2024-10-11 20:25:45,769 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 98.6MB. Free memory is still 61.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:25:45,769 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.75ms. Allocated memory is still 159.4MB. Free memory was 91.7MB in the beginning and 121.7MB in the end (delta: -30.0MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-10-11 20:25:45,769 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.57ms. Allocated memory is still 159.4MB. Free memory was 121.7MB in the beginning and 119.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:25:45,769 INFO L158 Benchmark]: Boogie Preprocessor took 31.66ms. Allocated memory is still 159.4MB. Free memory was 119.7MB in the beginning and 117.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:25:45,769 INFO L158 Benchmark]: RCFGBuilder took 297.28ms. Allocated memory is still 159.4MB. Free memory was 117.7MB in the beginning and 105.8MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 20:25:45,769 INFO L158 Benchmark]: TraceAbstraction took 11110.69ms. Allocated memory was 159.4MB in the beginning and 249.6MB in the end (delta: 90.2MB). Free memory was 105.2MB in the beginning and 152.1MB in the end (delta: -47.0MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. [2024-10-11 20:25:45,770 INFO L158 Benchmark]: Witness Printer took 31.40ms. Allocated memory is still 249.6MB. Free memory was 152.1MB in the beginning and 150.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:25:45,771 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.15ms. Allocated memory is still 98.6MB. Free memory is still 61.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.75ms. Allocated memory is still 159.4MB. Free memory was 91.7MB in the beginning and 121.7MB in the end (delta: -30.0MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.57ms. Allocated memory is still 159.4MB. Free memory was 121.7MB in the beginning and 119.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.66ms. Allocated memory is still 159.4MB. Free memory was 119.7MB in the beginning and 117.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 297.28ms. Allocated memory is still 159.4MB. Free memory was 117.7MB in the beginning and 105.8MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11110.69ms. Allocated memory was 159.4MB in the beginning and 249.6MB in the end (delta: 90.2MB). Free memory was 105.2MB in the beginning and 152.1MB in the end (delta: -47.0MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. * Witness Printer took 31.40ms. Allocated memory is still 249.6MB. Free memory was 152.1MB in the beginning and 150.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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 - CounterExampleResult [Line: 378]: integer overflow possible integer overflow possible We found a FailurePath: [L365] int i, j; [L366] int length = __VERIFIER_nondet_int(); [L367] COND FALSE !(length < 1) VAL [length=2] [L368] int *arr = __builtin_alloca(length*sizeof(int)); VAL [arr={2:0}, length=2] [L369] COND FALSE !(!arr) [L370] i=0 VAL [arr={2:0}, i=0, length=2] [L370] COND TRUE i