./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-memory-alloca/insertionsort-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash de7da20d4eaaa585438f85709f7fd309a77ec10ab7307dad72c7fb2392cc347c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 20:22:02,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 20:22:02,648 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-14 20:22:02,659 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 20:22:02,659 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 20:22:02,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 20:22:02,691 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 20:22:02,692 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 20:22:02,694 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 20:22:02,695 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 20:22:02,696 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 20:22:02,696 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 20:22:02,697 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 20:22:02,697 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 20:22:02,697 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 20:22:02,698 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 20:22:02,698 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 20:22:02,702 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 20:22:02,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 20:22:02,703 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 20:22:02,703 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 20:22:02,704 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 20:22:02,704 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 20:22:02,704 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 20:22:02,704 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 20:22:02,705 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 20:22:02,705 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 20:22:02,705 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 20:22:02,705 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 20:22:02,706 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 20:22:02,706 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 20:22:02,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:22:02,706 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 20:22:02,706 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 20:22:02,707 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 20:22:02,707 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 20:22:02,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 20:22:02,710 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 20:22:02,710 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 20:22:02,711 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 20:22:02,711 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 20:22:02,712 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de7da20d4eaaa585438f85709f7fd309a77ec10ab7307dad72c7fb2392cc347c [2024-10-14 20:22:02,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 20:22:02,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 20:22:02,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 20:22:02,996 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 20:22:02,998 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 20:22:02,999 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i [2024-10-14 20:22:04,479 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 20:22:04,712 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 20:22:04,713 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i [2024-10-14 20:22:04,729 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5045f11ba/e18274010d1a4ff09cb63020c96305d4/FLAG8e8a6751c [2024-10-14 20:22:05,068 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5045f11ba/e18274010d1a4ff09cb63020c96305d4 [2024-10-14 20:22:05,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 20:22:05,071 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 20:22:05,073 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 20:22:05,073 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 20:22:05,079 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 20:22:05,080 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:22:05" (1/1) ... [2024-10-14 20:22:05,081 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2908bb5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:22:05, skipping insertion in model container [2024-10-14 20:22:05,081 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:22:05" (1/1) ... [2024-10-14 20:22:05,126 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 20:22:05,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:22:05,454 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 20:22:05,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:22:05,571 INFO L204 MainTranslator]: Completed translation [2024-10-14 20:22:05,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:22:05 WrapperNode [2024-10-14 20:22:05,572 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 20:22:05,573 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 20:22:05,573 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 20:22:05,573 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 20:22:05,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:22:05" (1/1) ... [2024-10-14 20:22:05,596 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:22:05" (1/1) ... [2024-10-14 20:22:05,633 INFO L138 Inliner]: procedures = 111, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2024-10-14 20:22:05,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 20:22:05,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 20:22:05,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 20:22:05,635 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 20:22:05,645 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:22:05" (1/1) ... [2024-10-14 20:22:05,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:22:05" (1/1) ... [2024-10-14 20:22:05,648 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:22:05" (1/1) ... [2024-10-14 20:22:05,669 INFO L175 MemorySlicer]: Split 5 memory accesses to 1 slices as follows [5]. 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-14 20:22:05,669 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:22:05" (1/1) ... [2024-10-14 20:22:05,670 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:22:05" (1/1) ... [2024-10-14 20:22:05,680 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:22:05" (1/1) ... [2024-10-14 20:22:05,683 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:22:05" (1/1) ... [2024-10-14 20:22:05,687 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:22:05" (1/1) ... [2024-10-14 20:22:05,688 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:22:05" (1/1) ... [2024-10-14 20:22:05,693 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 20:22:05,694 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 20:22:05,697 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 20:22:05,697 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 20:22:05,698 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:22:05" (1/1) ... [2024-10-14 20:22:05,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:22:05,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:22:05,731 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 20:22:05,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 20:22:05,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 20:22:05,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 20:22:05,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 20:22:05,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 20:22:05,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 20:22:05,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 20:22:05,888 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 20:22:05,890 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 20:22:06,015 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-14 20:22:06,016 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 20:22:06,038 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 20:22:06,039 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 20:22:06,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:22:06 BoogieIcfgContainer [2024-10-14 20:22:06,039 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 20:22:06,041 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 20:22:06,041 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 20:22:06,045 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 20:22:06,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:22:05" (1/3) ... [2024-10-14 20:22:06,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b234c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:22:06, skipping insertion in model container [2024-10-14 20:22:06,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:22:05" (2/3) ... [2024-10-14 20:22:06,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b234c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:22:06, skipping insertion in model container [2024-10-14 20:22:06,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:22:06" (3/3) ... [2024-10-14 20:22:06,048 INFO L112 eAbstractionObserver]: Analyzing ICFG insertionsort-alloca-2.i [2024-10-14 20:22:06,070 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 20:22:06,070 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-14 20:22:06,116 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 20:22:06,123 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;@1622028c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 20:22:06,124 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-14 20:22:06,128 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:06,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 20:22:06,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:22:06,135 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:22:06,136 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:22:06,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:22:06,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1434484604, now seen corresponding path program 1 times [2024-10-14 20:22:06,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:22:06,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112395929] [2024-10-14 20:22:06,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:22:06,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:22:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:22:06,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:22:06,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:22:06,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112395929] [2024-10-14 20:22:06,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112395929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:22:06,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:22:06,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:22:06,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462869432] [2024-10-14 20:22:06,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:22:06,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 20:22:06,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:22:06,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 20:22:06,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 20:22:06,402 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:06,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:22:06,427 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2024-10-14 20:22:06,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 20:22:06,432 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2024-10-14 20:22:06,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:22:06,439 INFO L225 Difference]: With dead ends: 49 [2024-10-14 20:22:06,439 INFO L226 Difference]: Without dead ends: 24 [2024-10-14 20:22:06,442 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-14 20:22:06,447 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:22:06,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:22:06,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-14 20:22:06,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-14 20:22:06,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.6875) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:06,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-10-14 20:22:06,512 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 7 [2024-10-14 20:22:06,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:22:06,512 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-10-14 20:22:06,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:06,513 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-10-14 20:22:06,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 20:22:06,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:22:06,513 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:22:06,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 20:22:06,514 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:22:06,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:22:06,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1434511384, now seen corresponding path program 1 times [2024-10-14 20:22:06,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:22:06,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642304206] [2024-10-14 20:22:06,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:22:06,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:22:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:22:06,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:22:06,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:22:06,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642304206] [2024-10-14 20:22:06,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642304206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:22:06,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:22:06,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:22:06,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339594318] [2024-10-14 20:22:06,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:22:06,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:22:06,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:22:06,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:22:06,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:22:06,730 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:06,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:22:06,791 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2024-10-14 20:22:06,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:22:06,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2024-10-14 20:22:06,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:22:06,796 INFO L225 Difference]: With dead ends: 26 [2024-10-14 20:22:06,796 INFO L226 Difference]: Without dead ends: 24 [2024-10-14 20:22:06,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:22:06,799 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:22:06,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 34 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:22:06,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-14 20:22:06,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-10-14 20:22:06,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.5625) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:06,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-10-14 20:22:06,805 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 7 [2024-10-14 20:22:06,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:22:06,806 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-10-14 20:22:06,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:06,807 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-10-14 20:22:06,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 20:22:06,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:22:06,808 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:22:06,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 20:22:06,808 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:22:06,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:22:06,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1520179886, now seen corresponding path program 1 times [2024-10-14 20:22:06,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:22:06,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357687846] [2024-10-14 20:22:06,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:22:06,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:22:06,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:22:06,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:22:06,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:22:06,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357687846] [2024-10-14 20:22:06,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357687846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:22:06,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:22:06,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:22:06,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987122785] [2024-10-14 20:22:06,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:22:06,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:22:06,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:22:06,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:22:06,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:22:06,933 INFO L87 Difference]: Start difference. First operand 22 states and 25 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-14 20:22:07,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:22:07,014 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2024-10-14 20:22:07,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:22:07,015 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-14 20:22:07,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:22:07,016 INFO L225 Difference]: With dead ends: 51 [2024-10-14 20:22:07,016 INFO L226 Difference]: Without dead ends: 47 [2024-10-14 20:22:07,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:22:07,017 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 33 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:22:07,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 49 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:22:07,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-14 20:22:07,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2024-10-14 20:22:07,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 41 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:07,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2024-10-14 20:22:07,025 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 8 [2024-10-14 20:22:07,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:22:07,026 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-10-14 20:22:07,026 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-14 20:22:07,026 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2024-10-14 20:22:07,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 20:22:07,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:22:07,027 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:22:07,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 20:22:07,027 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:22:07,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:22:07,028 INFO L85 PathProgramCache]: Analyzing trace with hash -598138110, now seen corresponding path program 1 times [2024-10-14 20:22:07,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:22:07,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45416567] [2024-10-14 20:22:07,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:22:07,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:22:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:22:07,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:22:07,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:22:07,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45416567] [2024-10-14 20:22:07,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45416567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:22:07,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:22:07,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 20:22:07,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928567578] [2024-10-14 20:22:07,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:22:07,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:22:07,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:22:07,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:22:07,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:22:07,124 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:07,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:22:07,202 INFO L93 Difference]: Finished difference Result 84 states and 109 transitions. [2024-10-14 20:22:07,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:22:07,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-14 20:22:07,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:22:07,203 INFO L225 Difference]: With dead ends: 84 [2024-10-14 20:22:07,203 INFO L226 Difference]: Without dead ends: 50 [2024-10-14 20:22:07,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:22:07,205 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 35 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:22:07,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 29 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:22:07,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-14 20:22:07,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2024-10-14 20:22:07,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.394736842105263) internal successors, (53), 42 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:07,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2024-10-14 20:22:07,212 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 10 [2024-10-14 20:22:07,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:22:07,212 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2024-10-14 20:22:07,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:07,213 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2024-10-14 20:22:07,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 20:22:07,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:22:07,213 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:22:07,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 20:22:07,214 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:22:07,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:22:07,214 INFO L85 PathProgramCache]: Analyzing trace with hash -611584002, now seen corresponding path program 1 times [2024-10-14 20:22:07,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:22:07,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131259120] [2024-10-14 20:22:07,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:22:07,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:22:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:22:07,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:22:07,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:22:07,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131259120] [2024-10-14 20:22:07,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131259120] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:22:07,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:22:07,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:22:07,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050490156] [2024-10-14 20:22:07,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:22:07,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:22:07,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:22:07,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:22:07,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:22:07,339 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:07,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:22:07,422 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2024-10-14 20:22:07,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:22:07,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2024-10-14 20:22:07,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:22:07,423 INFO L225 Difference]: With dead ends: 52 [2024-10-14 20:22:07,423 INFO L226 Difference]: Without dead ends: 50 [2024-10-14 20:22:07,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:22:07,424 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 31 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:22:07,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 50 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:22:07,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-14 20:22:07,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2024-10-14 20:22:07,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.375) internal successors, (55), 44 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:07,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2024-10-14 20:22:07,435 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 12 [2024-10-14 20:22:07,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:22:07,435 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2024-10-14 20:22:07,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:07,436 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2024-10-14 20:22:07,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 20:22:07,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:22:07,436 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:22:07,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 20:22:07,437 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:22:07,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:22:07,437 INFO L85 PathProgramCache]: Analyzing trace with hash -309513968, now seen corresponding path program 1 times [2024-10-14 20:22:07,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:22:07,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228566581] [2024-10-14 20:22:07,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:22:07,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:22:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:22:07,507 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-14 20:22:07,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:22:07,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228566581] [2024-10-14 20:22:07,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228566581] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:22:07,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668335181] [2024-10-14 20:22:07,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:22:07,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:22:07,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:22:07,510 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:22:07,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 20:22:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:22:07,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 20:22:07,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:22:07,643 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:22:07,643 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:22:07,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668335181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:22:07,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:22:07,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-10-14 20:22:07,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918329677] [2024-10-14 20:22:07,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:22:07,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:22:07,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:22:07,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:22:07,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:22:07,647 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:07,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:22:07,672 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2024-10-14 20:22:07,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:22:07,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 17 [2024-10-14 20:22:07,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:22:07,676 INFO L225 Difference]: With dead ends: 88 [2024-10-14 20:22:07,676 INFO L226 Difference]: Without dead ends: 45 [2024-10-14 20:22:07,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:22:07,677 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:22:07,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:22:07,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-14 20:22:07,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-14 20:22:07,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.35) internal successors, (54), 44 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:07,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2024-10-14 20:22:07,684 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 17 [2024-10-14 20:22:07,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:22:07,685 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2024-10-14 20:22:07,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:07,685 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2024-10-14 20:22:07,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 20:22:07,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:22:07,687 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:22:07,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 20:22:07,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 20:22:07,888 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:22:07,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:22:07,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1330582322, now seen corresponding path program 1 times [2024-10-14 20:22:07,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:22:07,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741452175] [2024-10-14 20:22:07,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:22:07,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:22:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:22:07,972 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-14 20:22:07,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:22:07,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741452175] [2024-10-14 20:22:07,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741452175] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:22:07,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252696745] [2024-10-14 20:22:07,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:22:07,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:22:07,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:22:07,975 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:22:07,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 20:22:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:22:08,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 20:22:08,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:22:08,056 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-14 20:22:08,056 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:22:08,113 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-14 20:22:08,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252696745] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:22:08,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:22:08,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-14 20:22:08,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250409459] [2024-10-14 20:22:08,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:22:08,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 20:22:08,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:22:08,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 20:22:08,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 20:22:08,116 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 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-14 20:22:08,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:22:08,239 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2024-10-14 20:22:08,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 20:22:08,240 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 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 17 [2024-10-14 20:22:08,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:22:08,241 INFO L225 Difference]: With dead ends: 72 [2024-10-14 20:22:08,241 INFO L226 Difference]: Without dead ends: 69 [2024-10-14 20:22:08,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2024-10-14 20:22:08,242 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 85 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:22:08,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 37 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:22:08,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-14 20:22:08,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2024-10-14 20:22:08,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 57 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:08,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2024-10-14 20:22:08,256 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 17 [2024-10-14 20:22:08,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:22:08,256 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2024-10-14 20:22:08,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 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-14 20:22:08,256 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2024-10-14 20:22:08,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 20:22:08,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:22:08,257 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:22:08,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 20:22:08,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-14 20:22:08,458 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:22:08,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:22:08,458 INFO L85 PathProgramCache]: Analyzing trace with hash 230408033, now seen corresponding path program 1 times [2024-10-14 20:22:08,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:22:08,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432370791] [2024-10-14 20:22:08,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:22:08,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:22:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:22:08,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 20:22:08,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:22:08,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432370791] [2024-10-14 20:22:08,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432370791] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:22:08,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:22:08,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:22:08,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297361537] [2024-10-14 20:22:08,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:22:08,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:22:08,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:22:08,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:22:08,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:22:08,503 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:08,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:22:08,520 INFO L93 Difference]: Finished difference Result 106 states and 130 transitions. [2024-10-14 20:22:08,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:22:08,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-14 20:22:08,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:22:08,522 INFO L225 Difference]: With dead ends: 106 [2024-10-14 20:22:08,522 INFO L226 Difference]: Without dead ends: 61 [2024-10-14 20:22:08,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:22:08,523 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:22:08,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:22:08,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-14 20:22:08,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-14 20:22:08,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 60 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:08,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2024-10-14 20:22:08,537 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 19 [2024-10-14 20:22:08,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:22:08,537 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2024-10-14 20:22:08,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:08,538 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2024-10-14 20:22:08,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 20:22:08,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:22:08,538 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:22:08,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 20:22:08,539 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:22:08,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:22:08,539 INFO L85 PathProgramCache]: Analyzing trace with hash -506404486, now seen corresponding path program 1 times [2024-10-14 20:22:08,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:22:08,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46384354] [2024-10-14 20:22:08,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:22:08,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:22:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:22:08,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:22:08,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:22:08,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46384354] [2024-10-14 20:22:08,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46384354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:22:08,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:22:08,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:22:08,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239867269] [2024-10-14 20:22:08,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:22:08,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:22:08,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:22:08,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:22:08,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:22:08,600 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:08,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:22:08,622 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2024-10-14 20:22:08,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:22:08,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-14 20:22:08,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:22:08,625 INFO L225 Difference]: With dead ends: 64 [2024-10-14 20:22:08,625 INFO L226 Difference]: Without dead ends: 63 [2024-10-14 20:22:08,625 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-14 20:22:08,626 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:22:08,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 30 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:22:08,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-14 20:22:08,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2024-10-14 20:22:08,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 59 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:08,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2024-10-14 20:22:08,636 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 21 [2024-10-14 20:22:08,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:22:08,636 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2024-10-14 20:22:08,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:08,637 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2024-10-14 20:22:08,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 20:22:08,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:22:08,637 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:22:08,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 20:22:08,637 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:22:08,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:22:08,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1481330194, now seen corresponding path program 1 times [2024-10-14 20:22:08,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:22:08,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919757064] [2024-10-14 20:22:08,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:22:08,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:22:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:22:08,711 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 20:22:08,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:22:08,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919757064] [2024-10-14 20:22:08,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919757064] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:22:08,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:22:08,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:22:08,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134038319] [2024-10-14 20:22:08,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:22:08,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:22:08,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:22:08,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:22:08,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:22:08,714 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:08,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:22:08,737 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2024-10-14 20:22:08,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:22:08,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-14 20:22:08,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:22:08,739 INFO L225 Difference]: With dead ends: 64 [2024-10-14 20:22:08,739 INFO L226 Difference]: Without dead ends: 63 [2024-10-14 20:22:08,739 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-14 20:22:08,740 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:22:08,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 32 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:22:08,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-14 20:22:08,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2024-10-14 20:22:08,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 51 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-14 20:22:08,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2024-10-14 20:22:08,745 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 22 [2024-10-14 20:22:08,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:22:08,745 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2024-10-14 20:22:08,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:08,746 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2024-10-14 20:22:08,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 20:22:08,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:22:08,747 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2024-10-14 20:22:08,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 20:22:08,747 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:22:08,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:22:08,747 INFO L85 PathProgramCache]: Analyzing trace with hash 72382854, now seen corresponding path program 1 times [2024-10-14 20:22:08,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:22:08,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620007268] [2024-10-14 20:22:08,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:22:08,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:22:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:22:08,806 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:22:08,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:22:08,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620007268] [2024-10-14 20:22:08,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620007268] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:22:08,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143759116] [2024-10-14 20:22:08,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:22:08,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:22:08,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:22:08,809 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:22:08,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 20:22:08,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:22:08,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 20:22:08,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:22:08,915 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:22:08,916 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:22:08,973 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:22:08,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143759116] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:22:08,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:22:08,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-14 20:22:08,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119220196] [2024-10-14 20:22:08,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:22:08,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 20:22:08,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:22:08,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 20:22:08,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-10-14 20:22:08,975 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 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-14 20:22:09,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:22:09,019 INFO L93 Difference]: Finished difference Result 117 states and 134 transitions. [2024-10-14 20:22:09,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 20:22:09,020 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 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 30 [2024-10-14 20:22:09,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:22:09,020 INFO L225 Difference]: With dead ends: 117 [2024-10-14 20:22:09,021 INFO L226 Difference]: Without dead ends: 116 [2024-10-14 20:22:09,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-10-14 20:22:09,023 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 72 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:22:09,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 82 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:22:09,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-14 20:22:09,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-10-14 20:22:09,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.1304347826086956) internal successors, (130), 115 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:09,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 130 transitions. [2024-10-14 20:22:09,040 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 130 transitions. Word has length 30 [2024-10-14 20:22:09,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:22:09,040 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 130 transitions. [2024-10-14 20:22:09,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 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-14 20:22:09,040 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 130 transitions. [2024-10-14 20:22:09,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 20:22:09,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:22:09,042 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1] [2024-10-14 20:22:09,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 20:22:09,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:22:09,247 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:22:09,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:22:09,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1145521146, now seen corresponding path program 2 times [2024-10-14 20:22:09,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:22:09,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296998061] [2024-10-14 20:22:09,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:22:09,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:22:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:22:09,399 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-10-14 20:22:09,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:22:09,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296998061] [2024-10-14 20:22:09,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296998061] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:22:09,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813710457] [2024-10-14 20:22:09,399 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 20:22:09,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:22:09,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:22:09,401 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:22:09,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 20:22:09,476 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 20:22:09,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 20:22:09,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 20:22:09,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:22:09,580 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-10-14 20:22:09,580 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:22:09,690 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-10-14 20:22:09,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813710457] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:22:09,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:22:09,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2024-10-14 20:22:09,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98083570] [2024-10-14 20:22:09,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:22:09,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:22:09,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:22:09,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:22:09,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:22:09,695 INFO L87 Difference]: Start difference. First operand 116 states and 130 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 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-14 20:22:09,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:22:09,719 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2024-10-14 20:22:09,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:22:09,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 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) Word has length 66 [2024-10-14 20:22:09,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:22:09,720 INFO L225 Difference]: With dead ends: 116 [2024-10-14 20:22:09,720 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 20:22:09,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 128 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 20:22:09,721 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 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-14 20:22:09,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:22:09,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 20:22:09,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 20:22:09,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:09,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 20:22:09,722 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2024-10-14 20:22:09,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:22:09,723 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 20:22:09,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 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-14 20:22:09,723 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 20:22:09,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 20:22:09,725 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-14 20:22:09,726 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-14 20:22:09,726 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-14 20:22:09,726 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-14 20:22:09,727 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-14 20:22:09,727 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-14 20:22:09,727 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-14 20:22:09,727 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-14 20:22:09,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-14 20:22:09,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:22:09,933 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:22:09,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 20:22:10,053 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 20:22:10,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:22:10 BoogieIcfgContainer [2024-10-14 20:22:10,069 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 20:22:10,070 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 20:22:10,070 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 20:22:10,070 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 20:22:10,072 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:22:06" (3/4) ... [2024-10-14 20:22:10,074 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 20:22:10,081 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-10-14 20:22:10,082 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-14 20:22:10,082 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-14 20:22:10,082 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 20:22:10,171 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 20:22:10,172 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 20:22:10,172 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 20:22:10,173 INFO L158 Benchmark]: Toolchain (without parser) took 5101.58ms. Allocated memory was 163.6MB in the beginning and 211.8MB in the end (delta: 48.2MB). Free memory was 90.0MB in the beginning and 179.5MB in the end (delta: -89.5MB). Peak memory consumption was 83.5MB. Max. memory is 16.1GB. [2024-10-14 20:22:10,173 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 163.6MB. Free memory is still 114.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:22:10,173 INFO L158 Benchmark]: CACSL2BoogieTranslator took 499.77ms. Allocated memory is still 163.6MB. Free memory was 89.8MB in the beginning and 131.6MB in the end (delta: -41.9MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2024-10-14 20:22:10,174 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.93ms. Allocated memory was 163.6MB in the beginning and 211.8MB in the end (delta: 48.2MB). Free memory was 131.6MB in the beginning and 181.4MB in the end (delta: -49.9MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2024-10-14 20:22:10,174 INFO L158 Benchmark]: Boogie Preprocessor took 58.68ms. Allocated memory is still 211.8MB. Free memory was 181.4MB in the beginning and 179.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:22:10,174 INFO L158 Benchmark]: RCFGBuilder took 345.49ms. Allocated memory is still 211.8MB. Free memory was 179.1MB in the beginning and 165.7MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 20:22:10,175 INFO L158 Benchmark]: TraceAbstraction took 4027.72ms. Allocated memory is still 211.8MB. Free memory was 164.7MB in the beginning and 63.0MB in the end (delta: 101.6MB). Peak memory consumption was 100.6MB. Max. memory is 16.1GB. [2024-10-14 20:22:10,175 INFO L158 Benchmark]: Witness Printer took 102.66ms. Allocated memory is still 211.8MB. Free memory was 63.0MB in the beginning and 179.5MB in the end (delta: -116.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 20:22:10,176 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.29ms. Allocated memory is still 163.6MB. Free memory is still 114.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 499.77ms. Allocated memory is still 163.6MB. Free memory was 89.8MB in the beginning and 131.6MB in the end (delta: -41.9MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.93ms. Allocated memory was 163.6MB in the beginning and 211.8MB in the end (delta: 48.2MB). Free memory was 131.6MB in the beginning and 181.4MB in the end (delta: -49.9MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.68ms. Allocated memory is still 211.8MB. Free memory was 181.4MB in the beginning and 179.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 345.49ms. Allocated memory is still 211.8MB. Free memory was 179.1MB in the beginning and 165.7MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4027.72ms. Allocated memory is still 211.8MB. Free memory was 164.7MB in the beginning and 63.0MB in the end (delta: 101.6MB). Peak memory consumption was 100.6MB. Max. memory is 16.1GB. * Witness Printer took 102.66ms. Allocated memory is still 211.8MB. Free memory was 63.0MB in the beginning and 179.5MB in the end (delta: -116.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 554]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 554]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 550]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 550]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 26 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 12, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 280 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 280 mSDsluCounter, 479 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 295 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 348 IncrementalHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 184 mSDtfsCounter, 348 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 288 GetRequests, 240 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=11, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 44 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 366 NumberOfCodeBlocks, 312 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 460 ConstructedInterpolants, 0 QuantifiedInterpolants, 1202 SizeOfPredicates, 5 NumberOfNonLiveVariables, 294 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 19 InterpolantComputations, 9 PerfectInterpolantSequences, 446/691 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 553]: Loop Invariant Derived loop invariant: ((((1 <= i) && (i <= 2147483646)) && (array_size <= 2147483647)) && (j <= 2147483648)) - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: (((1 <= i) && (array_size <= 2147483647)) && (i <= 2147483647)) RESULT: Ultimate proved your program to be correct! [2024-10-14 20:22:10,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE