./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr3.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a50e57e46342104030586dde3ea26bc2e3984490f4fdef34fa383d24842d8980 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:07:15,588 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:07:15,675 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 20:07:15,679 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:07:15,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:07:15,710 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:07:15,712 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:07:15,713 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:07:15,713 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:07:15,715 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:07:15,716 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:07:15,716 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:07:15,717 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:07:15,717 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:07:15,718 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:07:15,722 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:07:15,723 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:07:15,723 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:07:15,723 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:07:15,723 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:07:15,724 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:07:15,724 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:07:15,724 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:07:15,725 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:07:15,725 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:07:15,725 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:07:15,725 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:07:15,726 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:07:15,726 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:07:15,726 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:07:15,726 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:07:15,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:07:15,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:07:15,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:07:15,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:07:15,727 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:07:15,728 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:07:15,728 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:07:15,729 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:07:15,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:07:15,729 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:07:15,730 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:07:15,730 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:07:15,730 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:07:15,730 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a50e57e46342104030586dde3ea26bc2e3984490f4fdef34fa383d24842d8980 [2024-10-11 20:07:15,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:07:16,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:07:16,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:07:16,005 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:07:16,006 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:07:16,007 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr3.c [2024-10-11 20:07:17,501 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:07:17,671 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:07:17,672 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr3.c [2024-10-11 20:07:17,683 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d738713b8/7fa48ca0d356469cbd9674b60c1b44d5/FLAGc37b64238 [2024-10-11 20:07:18,063 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d738713b8/7fa48ca0d356469cbd9674b60c1b44d5 [2024-10-11 20:07:18,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:07:18,066 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:07:18,067 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:07:18,067 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:07:18,075 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:07:18,076 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:07:18" (1/1) ... [2024-10-11 20:07:18,077 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64fdaf4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:18, skipping insertion in model container [2024-10-11 20:07:18,077 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:07:18" (1/1) ... [2024-10-11 20:07:18,100 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:07:18,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:07:18,329 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:07:18,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:07:18,383 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:07:18,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:18 WrapperNode [2024-10-11 20:07:18,384 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:07:18,385 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:07:18,385 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:07:18,385 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:07:18,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:18" (1/1) ... [2024-10-11 20:07:18,405 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:18" (1/1) ... [2024-10-11 20:07:18,441 INFO L138 Inliner]: procedures = 15, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 203 [2024-10-11 20:07:18,441 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:07:18,442 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:07:18,442 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:07:18,442 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:07:18,458 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:18" (1/1) ... [2024-10-11 20:07:18,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:18" (1/1) ... [2024-10-11 20:07:18,462 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:18" (1/1) ... [2024-10-11 20:07:18,477 INFO L175 MemorySlicer]: Split 30 memory accesses to 3 slices as follows [2, 8, 20]. 67 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0]. The 12 writes are split as follows [0, 0, 12]. [2024-10-11 20:07:18,478 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:18" (1/1) ... [2024-10-11 20:07:18,478 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:18" (1/1) ... [2024-10-11 20:07:18,488 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:18" (1/1) ... [2024-10-11 20:07:18,494 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:18" (1/1) ... [2024-10-11 20:07:18,496 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:18" (1/1) ... [2024-10-11 20:07:18,500 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:18" (1/1) ... [2024-10-11 20:07:18,504 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:07:18,505 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:07:18,505 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:07:18,505 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:07:18,506 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:18" (1/1) ... [2024-10-11 20:07:18,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:07:18,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:18,540 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:07:18,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:07:18,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:07:18,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:07:18,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 20:07:18,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 20:07:18,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 20:07:18,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 20:07:18,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 20:07:18,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 20:07:18,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:07:18,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:07:18,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 20:07:18,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 20:07:18,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 20:07:18,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 20:07:18,686 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:07:18,691 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:07:19,178 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2024-10-11 20:07:19,178 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:07:19,228 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:07:19,229 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-11 20:07:19,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:07:19 BoogieIcfgContainer [2024-10-11 20:07:19,230 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:07:19,233 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:07:19,234 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:07:19,237 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:07:19,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:07:18" (1/3) ... [2024-10-11 20:07:19,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@429f62eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:07:19, skipping insertion in model container [2024-10-11 20:07:19,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:18" (2/3) ... [2024-10-11 20:07:19,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@429f62eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:07:19, skipping insertion in model container [2024-10-11 20:07:19,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:07:19" (3/3) ... [2024-10-11 20:07:19,241 INFO L112 eAbstractionObserver]: Analyzing ICFG mbpr3.c [2024-10-11 20:07:19,274 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:07:19,274 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 86 error locations. [2024-10-11 20:07:19,364 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:07:19,371 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;@5260850f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:07:19,371 INFO L334 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2024-10-11 20:07:19,376 INFO L276 IsEmpty]: Start isEmpty. Operand has 195 states, 108 states have (on average 1.9444444444444444) internal successors, (210), 194 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:19,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 20:07:19,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:19,382 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 20:07:19,382 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-10-11 20:07:19,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:19,388 INFO L85 PathProgramCache]: Analyzing trace with hash 776726341, now seen corresponding path program 1 times [2024-10-11 20:07:19,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:19,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398187783] [2024-10-11 20:07:19,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:19,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:19,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:19,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:19,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398187783] [2024-10-11 20:07:19,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398187783] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:19,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:19,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:07:19,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489835650] [2024-10-11 20:07:19,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:19,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 20:07:19,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:19,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 20:07:19,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:07:19,623 INFO L87 Difference]: Start difference. First operand has 195 states, 108 states have (on average 1.9444444444444444) internal successors, (210), 194 states have internal predecessors, (210), 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.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:19,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:19,676 INFO L93 Difference]: Finished difference Result 386 states and 413 transitions. [2024-10-11 20:07:19,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 20:07:19,679 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2024-10-11 20:07:19,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:19,688 INFO L225 Difference]: With dead ends: 386 [2024-10-11 20:07:19,688 INFO L226 Difference]: Without dead ends: 191 [2024-10-11 20:07:19,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:07:19,696 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:19,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:07:19,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-11 20:07:19,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2024-10-11 20:07:19,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 105 states have (on average 1.8857142857142857) internal successors, (198), 190 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:19,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 198 transitions. [2024-10-11 20:07:19,750 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 198 transitions. Word has length 6 [2024-10-11 20:07:19,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:19,750 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 198 transitions. [2024-10-11 20:07:19,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:19,751 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 198 transitions. [2024-10-11 20:07:19,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 20:07:19,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:19,753 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 20:07:19,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:07:19,753 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-10-11 20:07:19,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:19,755 INFO L85 PathProgramCache]: Analyzing trace with hash 776728263, now seen corresponding path program 1 times [2024-10-11 20:07:19,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:19,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84091099] [2024-10-11 20:07:19,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:19,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:19,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:19,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:19,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84091099] [2024-10-11 20:07:19,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84091099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:19,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:19,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:07:19,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537581484] [2024-10-11 20:07:19,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:19,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:07:19,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:19,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:07:19,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:19,998 INFO L87 Difference]: Start difference. First operand 191 states and 198 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:20,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:20,076 INFO L93 Difference]: Finished difference Result 191 states and 198 transitions. [2024-10-11 20:07:20,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:07:20,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2024-10-11 20:07:20,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:20,078 INFO L225 Difference]: With dead ends: 191 [2024-10-11 20:07:20,078 INFO L226 Difference]: Without dead ends: 188 [2024-10-11 20:07:20,078 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-11 20:07:20,080 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 190 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:20,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 173 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:07:20,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-11 20:07:20,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-10-11 20:07:20,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 105 states have (on average 1.8571428571428572) internal successors, (195), 187 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:20,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 195 transitions. [2024-10-11 20:07:20,094 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 195 transitions. Word has length 6 [2024-10-11 20:07:20,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:20,095 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 195 transitions. [2024-10-11 20:07:20,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:20,095 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 195 transitions. [2024-10-11 20:07:20,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 20:07:20,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:20,096 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:20,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:07:20,096 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-10-11 20:07:20,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:20,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1691227569, now seen corresponding path program 1 times [2024-10-11 20:07:20,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:20,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828178320] [2024-10-11 20:07:20,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:20,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:20,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:20,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:20,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:20,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828178320] [2024-10-11 20:07:20,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828178320] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:20,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:20,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:07:20,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564507797] [2024-10-11 20:07:20,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:20,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:07:20,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:20,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:07:20,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:07:20,286 INFO L87 Difference]: Start difference. First operand 188 states and 195 transitions. Second operand has 5 states, 4 states have (on average 1.75) 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-11 20:07:20,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:20,357 INFO L93 Difference]: Finished difference Result 188 states and 195 transitions. [2024-10-11 20:07:20,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:07:20,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) 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-11 20:07:20,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:20,361 INFO L225 Difference]: With dead ends: 188 [2024-10-11 20:07:20,361 INFO L226 Difference]: Without dead ends: 185 [2024-10-11 20:07:20,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:07:20,362 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 376 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:20,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 172 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:07:20,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-11 20:07:20,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-10-11 20:07:20,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 105 states have (on average 1.8285714285714285) internal successors, (192), 184 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:20,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 192 transitions. [2024-10-11 20:07:20,379 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 192 transitions. Word has length 7 [2024-10-11 20:07:20,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:20,379 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 192 transitions. [2024-10-11 20:07:20,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) 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-11 20:07:20,380 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 192 transitions. [2024-10-11 20:07:20,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 20:07:20,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:20,380 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:20,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:07:20,381 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-10-11 20:07:20,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:20,382 INFO L85 PathProgramCache]: Analyzing trace with hash 900899982, now seen corresponding path program 1 times [2024-10-11 20:07:20,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:20,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997232634] [2024-10-11 20:07:20,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:20,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:20,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:20,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:20,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997232634] [2024-10-11 20:07:20,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997232634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:20,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:20,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:07:20,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222500443] [2024-10-11 20:07:20,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:20,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:07:20,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:20,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:07:20,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:07:20,445 INFO L87 Difference]: Start difference. First operand 185 states and 192 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-11 20:07:20,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:20,839 INFO L93 Difference]: Finished difference Result 341 states and 354 transitions. [2024-10-11 20:07:20,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:07:20,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-11 20:07:20,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:20,842 INFO L225 Difference]: With dead ends: 341 [2024-10-11 20:07:20,842 INFO L226 Difference]: Without dead ends: 269 [2024-10-11 20:07:20,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:07:20,844 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 80 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:20,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 141 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 20:07:20,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-10-11 20:07:20,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2024-10-11 20:07:20,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 189 states have (on average 1.492063492063492) internal successors, (282), 268 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:20,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 282 transitions. [2024-10-11 20:07:20,869 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 282 transitions. Word has length 10 [2024-10-11 20:07:20,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:20,869 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 282 transitions. [2024-10-11 20:07:20,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-11 20:07:20,869 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 282 transitions. [2024-10-11 20:07:20,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 20:07:20,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:20,870 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:20,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 20:07:20,871 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-10-11 20:07:20,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:20,872 INFO L85 PathProgramCache]: Analyzing trace with hash 31503318, now seen corresponding path program 1 times [2024-10-11 20:07:20,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:20,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544179459] [2024-10-11 20:07:20,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:20,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:20,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:20,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:20,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544179459] [2024-10-11 20:07:20,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544179459] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:20,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:20,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:07:20,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908330438] [2024-10-11 20:07:20,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:20,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:07:20,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:20,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:07:20,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:20,968 INFO L87 Difference]: Start difference. First operand 269 states and 282 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:21,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:21,173 INFO L93 Difference]: Finished difference Result 278 states and 292 transitions. [2024-10-11 20:07:21,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:07:21,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2024-10-11 20:07:21,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:21,175 INFO L225 Difference]: With dead ends: 278 [2024-10-11 20:07:21,175 INFO L226 Difference]: Without dead ends: 276 [2024-10-11 20:07:21,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:21,177 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 2 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:21,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 392 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:07:21,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-10-11 20:07:21,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2024-10-11 20:07:21,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 196 states have (on average 1.4795918367346939) internal successors, (290), 275 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:21,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 290 transitions. [2024-10-11 20:07:21,201 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 290 transitions. Word has length 23 [2024-10-11 20:07:21,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:21,202 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 290 transitions. [2024-10-11 20:07:21,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:21,202 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 290 transitions. [2024-10-11 20:07:21,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 20:07:21,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:21,203 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:21,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:07:21,203 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-10-11 20:07:21,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:21,204 INFO L85 PathProgramCache]: Analyzing trace with hash -838429126, now seen corresponding path program 1 times [2024-10-11 20:07:21,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:21,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131585875] [2024-10-11 20:07:21,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:21,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:21,437 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 20:07:21,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:21,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131585875] [2024-10-11 20:07:21,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131585875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:21,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:21,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:07:21,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339941512] [2024-10-11 20:07:21,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:21,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:07:21,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:21,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:07:21,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:07:21,440 INFO L87 Difference]: Start difference. First operand 276 states and 290 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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-11 20:07:21,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:21,762 INFO L93 Difference]: Finished difference Result 463 states and 487 transitions. [2024-10-11 20:07:21,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:07:21,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-10-11 20:07:21,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:21,763 INFO L225 Difference]: With dead ends: 463 [2024-10-11 20:07:21,763 INFO L226 Difference]: Without dead ends: 276 [2024-10-11 20:07:21,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:07:21,765 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 354 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:21,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 126 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:07:21,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-10-11 20:07:21,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2024-10-11 20:07:21,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 196 states have (on average 1.4642857142857142) internal successors, (287), 275 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:21,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 287 transitions. [2024-10-11 20:07:21,774 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 287 transitions. Word has length 30 [2024-10-11 20:07:21,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:21,774 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 287 transitions. [2024-10-11 20:07:21,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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-11 20:07:21,774 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 287 transitions. [2024-10-11 20:07:21,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 20:07:21,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:21,775 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:21,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 20:07:21,775 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-10-11 20:07:21,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:21,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1356843739, now seen corresponding path program 1 times [2024-10-11 20:07:21,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:21,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710747597] [2024-10-11 20:07:21,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:21,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:21,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:21,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:21,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:21,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710747597] [2024-10-11 20:07:21,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710747597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:21,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:21,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:07:21,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276715979] [2024-10-11 20:07:21,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:21,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:07:21,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:21,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:07:21,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:21,841 INFO L87 Difference]: Start difference. First operand 276 states and 287 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:22,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:22,098 INFO L93 Difference]: Finished difference Result 280 states and 291 transitions. [2024-10-11 20:07:22,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:07:22,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-10-11 20:07:22,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:22,099 INFO L225 Difference]: With dead ends: 280 [2024-10-11 20:07:22,100 INFO L226 Difference]: Without dead ends: 278 [2024-10-11 20:07:22,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:22,100 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 62 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:22,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 252 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:07:22,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-10-11 20:07:22,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2024-10-11 20:07:22,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 198 states have (on average 1.4595959595959596) internal successors, (289), 277 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:22,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 289 transitions. [2024-10-11 20:07:22,108 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 289 transitions. Word has length 30 [2024-10-11 20:07:22,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:22,108 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 289 transitions. [2024-10-11 20:07:22,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:22,108 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 289 transitions. [2024-10-11 20:07:22,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 20:07:22,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:22,109 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:22,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 20:07:22,110 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-10-11 20:07:22,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:22,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1487150081, now seen corresponding path program 1 times [2024-10-11 20:07:22,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:22,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858055196] [2024-10-11 20:07:22,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:22,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:22,192 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:22,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:22,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858055196] [2024-10-11 20:07:22,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858055196] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:07:22,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55159799] [2024-10-11 20:07:22,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:22,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:22,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:22,195 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:07:22,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:07:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:22,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:07:22,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:07:22,367 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:22,367 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:07:22,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55159799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:22,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:07:22,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-11 20:07:22,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116452784] [2024-10-11 20:07:22,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:22,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:07:22,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:22,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:07:22,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:07:22,370 INFO L87 Difference]: Start difference. First operand 278 states and 289 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:22,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:22,722 INFO L93 Difference]: Finished difference Result 278 states and 289 transitions. [2024-10-11 20:07:22,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:07:22,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 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 36 [2024-10-11 20:07:22,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:22,724 INFO L225 Difference]: With dead ends: 278 [2024-10-11 20:07:22,724 INFO L226 Difference]: Without dead ends: 265 [2024-10-11 20:07:22,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:07:22,725 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 85 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:22,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 228 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:07:22,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-11 20:07:22,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2024-10-11 20:07:22,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 198 states have (on average 1.393939393939394) internal successors, (276), 264 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:22,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 276 transitions. [2024-10-11 20:07:22,733 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 276 transitions. Word has length 36 [2024-10-11 20:07:22,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:22,733 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 276 transitions. [2024-10-11 20:07:22,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:22,733 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 276 transitions. [2024-10-11 20:07:22,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 20:07:22,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:22,734 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:22,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 20:07:22,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:22,936 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-10-11 20:07:22,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:22,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1142987811, now seen corresponding path program 1 times [2024-10-11 20:07:22,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:22,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080552837] [2024-10-11 20:07:22,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:22,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:23,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:23,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:23,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080552837] [2024-10-11 20:07:23,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080552837] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:07:23,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684039368] [2024-10-11 20:07:23,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:23,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:23,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:23,011 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:07:23,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:07:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:23,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:07:23,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:07:23,145 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:23,145 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:07:23,214 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:23,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684039368] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:07:23,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:07:23,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-10-11 20:07:23,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428529009] [2024-10-11 20:07:23,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:07:23,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 20:07:23,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:23,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 20:07:23,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:07:23,215 INFO L87 Difference]: Start difference. First operand 265 states and 276 transitions. Second operand has 10 states, 9 states have (on average 10.777777777777779) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:23,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:23,658 INFO L93 Difference]: Finished difference Result 306 states and 333 transitions. [2024-10-11 20:07:23,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:07:23,658 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 10.777777777777779) internal successors, (97), 10 states have internal predecessors, (97), 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 37 [2024-10-11 20:07:23,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:23,660 INFO L225 Difference]: With dead ends: 306 [2024-10-11 20:07:23,660 INFO L226 Difference]: Without dead ends: 273 [2024-10-11 20:07:23,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:07:23,661 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 160 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:23,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 224 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 20:07:23,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-10-11 20:07:23,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2024-10-11 20:07:23,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 234 states have (on average 1.2222222222222223) internal successors, (286), 270 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:23,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 286 transitions. [2024-10-11 20:07:23,668 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 286 transitions. Word has length 37 [2024-10-11 20:07:23,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:23,669 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 286 transitions. [2024-10-11 20:07:23,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 10.777777777777779) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:23,669 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 286 transitions. [2024-10-11 20:07:23,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 20:07:23,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:23,670 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:23,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 20:07:23,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:23,871 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-10-11 20:07:23,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:23,872 INFO L85 PathProgramCache]: Analyzing trace with hash 991630712, now seen corresponding path program 1 times [2024-10-11 20:07:23,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:23,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681797535] [2024-10-11 20:07:23,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:23,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:23,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 20:07:23,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:23,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681797535] [2024-10-11 20:07:23,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681797535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:23,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:23,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:07:23,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216175648] [2024-10-11 20:07:23,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:23,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:07:23,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:23,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:07:23,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:07:23,968 INFO L87 Difference]: Start difference. First operand 271 states and 286 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:23,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:23,989 INFO L93 Difference]: Finished difference Result 416 states and 438 transitions. [2024-10-11 20:07:23,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:07:23,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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 60 [2024-10-11 20:07:23,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:23,991 INFO L225 Difference]: With dead ends: 416 [2024-10-11 20:07:23,991 INFO L226 Difference]: Without dead ends: 260 [2024-10-11 20:07:23,992 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-11 20:07:23,994 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 105 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:23,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 129 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:07:23,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-10-11 20:07:24,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2024-10-11 20:07:24,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 226 states have (on average 1.2079646017699115) internal successors, (273), 259 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:24,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 273 transitions. [2024-10-11 20:07:24,003 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 273 transitions. Word has length 60 [2024-10-11 20:07:24,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:24,004 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 273 transitions. [2024-10-11 20:07:24,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:24,004 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 273 transitions. [2024-10-11 20:07:24,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 20:07:24,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:24,005 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:24,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 20:07:24,006 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-10-11 20:07:24,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:24,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1187303998, now seen corresponding path program 1 times [2024-10-11 20:07:24,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:24,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898467908] [2024-10-11 20:07:24,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:24,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:24,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 20:07:24,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:24,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898467908] [2024-10-11 20:07:24,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898467908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:24,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:24,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:07:24,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108033801] [2024-10-11 20:07:24,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:24,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:07:24,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:24,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:07:24,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:24,087 INFO L87 Difference]: Start difference. First operand 260 states and 273 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:24,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:24,293 INFO L93 Difference]: Finished difference Result 266 states and 279 transitions. [2024-10-11 20:07:24,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:07:24,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 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 60 [2024-10-11 20:07:24,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:24,295 INFO L225 Difference]: With dead ends: 266 [2024-10-11 20:07:24,295 INFO L226 Difference]: Without dead ends: 264 [2024-10-11 20:07:24,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:24,296 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 57 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:24,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 156 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:07:24,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-11 20:07:24,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 263. [2024-10-11 20:07:24,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 229 states have (on average 1.205240174672489) internal successors, (276), 262 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:24,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 276 transitions. [2024-10-11 20:07:24,303 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 276 transitions. Word has length 60 [2024-10-11 20:07:24,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:24,303 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 276 transitions. [2024-10-11 20:07:24,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:24,304 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 276 transitions. [2024-10-11 20:07:24,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 20:07:24,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:24,305 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:24,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 20:07:24,305 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-10-11 20:07:24,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:24,305 INFO L85 PathProgramCache]: Analyzing trace with hash -2081932762, now seen corresponding path program 1 times [2024-10-11 20:07:24,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:24,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15234309] [2024-10-11 20:07:24,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:24,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:24,415 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 20:07:24,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:24,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15234309] [2024-10-11 20:07:24,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15234309] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:07:24,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673425264] [2024-10-11 20:07:24,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:24,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:24,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:24,418 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:07:24,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:07:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:24,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:07:24,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:07:24,553 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 20:07:24,553 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:07:24,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673425264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:24,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:07:24,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-11 20:07:24,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095568008] [2024-10-11 20:07:24,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:24,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:07:24,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:24,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:07:24,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:07:24,556 INFO L87 Difference]: Start difference. First operand 263 states and 276 transitions. Second operand has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:24,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:24,799 INFO L93 Difference]: Finished difference Result 264 states and 277 transitions. [2024-10-11 20:07:24,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:07:24,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 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-11 20:07:24,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:24,801 INFO L225 Difference]: With dead ends: 264 [2024-10-11 20:07:24,801 INFO L226 Difference]: Without dead ends: 253 [2024-10-11 20:07:24,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:07:24,802 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 75 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:24,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 142 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:07:24,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-10-11 20:07:24,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2024-10-11 20:07:24,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 229 states have (on average 1.1572052401746724) internal successors, (265), 251 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:24,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 265 transitions. [2024-10-11 20:07:24,809 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 265 transitions. Word has length 66 [2024-10-11 20:07:24,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:24,809 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 265 transitions. [2024-10-11 20:07:24,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:24,809 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 265 transitions. [2024-10-11 20:07:24,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 20:07:24,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:24,810 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:24,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 20:07:25,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:25,011 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-10-11 20:07:25,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:25,011 INFO L85 PathProgramCache]: Analyzing trace with hash -115406040, now seen corresponding path program 1 times [2024-10-11 20:07:25,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:25,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279182278] [2024-10-11 20:07:25,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:25,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:25,107 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 20:07:25,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:25,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279182278] [2024-10-11 20:07:25,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279182278] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:07:25,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260973181] [2024-10-11 20:07:25,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:25,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:25,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:25,109 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:07:25,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:07:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:25,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:07:25,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:07:25,222 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 20:07:25,223 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:07:25,281 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 20:07:25,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260973181] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:07:25,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:07:25,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-10-11 20:07:25,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272316036] [2024-10-11 20:07:25,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:07:25,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 20:07:25,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:25,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 20:07:25,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:07:25,283 INFO L87 Difference]: Start difference. First operand 252 states and 265 transitions. Second operand has 10 states, 9 states have (on average 13.88888888888889) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:25,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:25,601 INFO L93 Difference]: Finished difference Result 287 states and 303 transitions. [2024-10-11 20:07:25,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:07:25,602 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 13.88888888888889) internal successors, (125), 10 states have internal predecessors, (125), 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 67 [2024-10-11 20:07:25,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:25,603 INFO L225 Difference]: With dead ends: 287 [2024-10-11 20:07:25,603 INFO L226 Difference]: Without dead ends: 285 [2024-10-11 20:07:25,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:07:25,604 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 252 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:25,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 180 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:07:25,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-10-11 20:07:25,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 284. [2024-10-11 20:07:25,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 261 states have (on average 1.1455938697318007) internal successors, (299), 283 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:25,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 299 transitions. [2024-10-11 20:07:25,614 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 299 transitions. Word has length 67 [2024-10-11 20:07:25,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:25,615 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 299 transitions. [2024-10-11 20:07:25,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 13.88888888888889) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:25,615 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 299 transitions. [2024-10-11 20:07:25,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 20:07:25,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:25,616 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:25,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 20:07:25,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 20:07:25,817 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-10-11 20:07:25,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:25,817 INFO L85 PathProgramCache]: Analyzing trace with hash 579036826, now seen corresponding path program 1 times [2024-10-11 20:07:25,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:25,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108193020] [2024-10-11 20:07:25,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:25,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:25,894 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-11 20:07:25,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:25,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108193020] [2024-10-11 20:07:25,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108193020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:25,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:25,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:07:25,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902564890] [2024-10-11 20:07:25,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:25,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:07:25,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:25,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:07:25,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:25,897 INFO L87 Difference]: Start difference. First operand 284 states and 299 transitions. Second operand has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:26,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:26,061 INFO L93 Difference]: Finished difference Result 284 states and 299 transitions. [2024-10-11 20:07:26,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:07:26,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 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 83 [2024-10-11 20:07:26,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:26,062 INFO L225 Difference]: With dead ends: 284 [2024-10-11 20:07:26,062 INFO L226 Difference]: Without dead ends: 283 [2024-10-11 20:07:26,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:26,063 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 66 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:26,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 108 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:07:26,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-10-11 20:07:26,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2024-10-11 20:07:26,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 261 states have (on average 1.1417624521072798) internal successors, (298), 282 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:26,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 298 transitions. [2024-10-11 20:07:26,070 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 298 transitions. Word has length 83 [2024-10-11 20:07:26,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:26,071 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 298 transitions. [2024-10-11 20:07:26,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:26,071 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 298 transitions. [2024-10-11 20:07:26,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 20:07:26,072 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:26,072 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:26,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 20:07:26,072 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-10-11 20:07:26,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:26,073 INFO L85 PathProgramCache]: Analyzing trace with hash -567327935, now seen corresponding path program 2 times [2024-10-11 20:07:26,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:26,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742047862] [2024-10-11 20:07:26,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:26,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:26,347 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-10-11 20:07:26,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:26,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742047862] [2024-10-11 20:07:26,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742047862] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:07:26,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618446404] [2024-10-11 20:07:26,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:07:26,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:26,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:26,350 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:07:26,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:07:26,416 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 20:07:26,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:07:26,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:07:26,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:07:26,708 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-10-11 20:07:26,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:07:26,890 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-10-11 20:07:26,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618446404] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:07:26,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:07:26,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 2] total 7 [2024-10-11 20:07:26,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555089853] [2024-10-11 20:07:26,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:07:26,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 20:07:26,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:26,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 20:07:26,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:07:26,892 INFO L87 Difference]: Start difference. First operand 283 states and 298 transitions. Second operand has 9 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:27,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:27,065 INFO L93 Difference]: Finished difference Result 283 states and 298 transitions. [2024-10-11 20:07:27,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:07:27,065 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 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 89 [2024-10-11 20:07:27,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:27,067 INFO L225 Difference]: With dead ends: 283 [2024-10-11 20:07:27,067 INFO L226 Difference]: Without dead ends: 278 [2024-10-11 20:07:27,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:07:27,067 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 291 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:27,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 39 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:07:27,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-10-11 20:07:27,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 207. [2024-10-11 20:07:27,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 190 states have (on average 1.1368421052631579) internal successors, (216), 206 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:27,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 216 transitions. [2024-10-11 20:07:27,073 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 216 transitions. Word has length 89 [2024-10-11 20:07:27,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:27,074 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 216 transitions. [2024-10-11 20:07:27,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:27,074 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 216 transitions. [2024-10-11 20:07:27,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 20:07:27,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:27,075 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:27,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 20:07:27,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 20:07:27,276 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-10-11 20:07:27,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:27,276 INFO L85 PathProgramCache]: Analyzing trace with hash -827273427, now seen corresponding path program 1 times [2024-10-11 20:07:27,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:27,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587931551] [2024-10-11 20:07:27,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:27,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:27,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 20:07:27,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:27,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587931551] [2024-10-11 20:07:27,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587931551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:27,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:27,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:07:27,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132843028] [2024-10-11 20:07:27,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:27,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:07:27,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:27,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:07:27,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:27,360 INFO L87 Difference]: Start difference. First operand 207 states and 216 transitions. Second operand has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:27,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:27,556 INFO L93 Difference]: Finished difference Result 237 states and 247 transitions. [2024-10-11 20:07:27,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:07:27,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 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 90 [2024-10-11 20:07:27,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:27,558 INFO L225 Difference]: With dead ends: 237 [2024-10-11 20:07:27,558 INFO L226 Difference]: Without dead ends: 235 [2024-10-11 20:07:27,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:27,559 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 57 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:27,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 120 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:07:27,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-11 20:07:27,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 210. [2024-10-11 20:07:27,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 193 states have (on average 1.1347150259067358) internal successors, (219), 209 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:27,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 219 transitions. [2024-10-11 20:07:27,564 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 219 transitions. Word has length 90 [2024-10-11 20:07:27,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:27,565 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 219 transitions. [2024-10-11 20:07:27,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:27,565 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 219 transitions. [2024-10-11 20:07:27,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 20:07:27,566 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:27,566 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:27,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 20:07:27,566 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-10-11 20:07:27,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:27,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1528749329, now seen corresponding path program 1 times [2024-10-11 20:07:27,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:27,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457501551] [2024-10-11 20:07:27,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:27,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:27,704 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 20:07:27,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:27,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457501551] [2024-10-11 20:07:27,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457501551] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:07:27,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785970773] [2024-10-11 20:07:27,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:27,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:27,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:27,707 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:07:27,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 20:07:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:27,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:07:27,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:07:27,840 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 20:07:27,840 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:07:27,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785970773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:27,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:07:27,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-11 20:07:27,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094093915] [2024-10-11 20:07:27,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:27,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:07:27,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:27,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:07:27,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:07:27,842 INFO L87 Difference]: Start difference. First operand 210 states and 219 transitions. Second operand has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:28,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:28,081 INFO L93 Difference]: Finished difference Result 235 states and 245 transitions. [2024-10-11 20:07:28,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:07:28,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 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 96 [2024-10-11 20:07:28,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:28,082 INFO L225 Difference]: With dead ends: 235 [2024-10-11 20:07:28,082 INFO L226 Difference]: Without dead ends: 222 [2024-10-11 20:07:28,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:07:28,083 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 80 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:28,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 116 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:07:28,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-10-11 20:07:28,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 197. [2024-10-11 20:07:28,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 193 states have (on average 1.067357512953368) internal successors, (206), 196 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:28,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 206 transitions. [2024-10-11 20:07:28,088 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 206 transitions. Word has length 96 [2024-10-11 20:07:28,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:28,089 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 206 transitions. [2024-10-11 20:07:28,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:28,089 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 206 transitions. [2024-10-11 20:07:28,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 20:07:28,090 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:28,090 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:28,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 20:07:28,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 20:07:28,294 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-10-11 20:07:28,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:28,294 INFO L85 PathProgramCache]: Analyzing trace with hash 159404077, now seen corresponding path program 1 times [2024-10-11 20:07:28,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:28,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705421587] [2024-10-11 20:07:28,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:28,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:28,421 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 20:07:28,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:28,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705421587] [2024-10-11 20:07:28,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705421587] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:07:28,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562021635] [2024-10-11 20:07:28,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:28,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:28,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:28,424 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:07:28,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 20:07:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:28,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:07:28,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:07:28,546 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 20:07:28,547 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:07:28,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562021635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:28,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:07:28,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-11 20:07:28,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183399654] [2024-10-11 20:07:28,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:28,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:07:28,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:28,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:07:28,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:07:28,549 INFO L87 Difference]: Start difference. First operand 197 states and 206 transitions. Second operand has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:28,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:28,766 INFO L93 Difference]: Finished difference Result 222 states and 232 transitions. [2024-10-11 20:07:28,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:07:28,767 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 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 108 [2024-10-11 20:07:28,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:28,768 INFO L225 Difference]: With dead ends: 222 [2024-10-11 20:07:28,768 INFO L226 Difference]: Without dead ends: 221 [2024-10-11 20:07:28,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:07:28,769 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 82 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:28,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 109 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:07:28,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-10-11 20:07:28,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 196. [2024-10-11 20:07:28,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 193 states have (on average 1.0621761658031088) internal successors, (205), 195 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:28,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 205 transitions. [2024-10-11 20:07:28,787 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 205 transitions. Word has length 108 [2024-10-11 20:07:28,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:28,788 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 205 transitions. [2024-10-11 20:07:28,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:28,788 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 205 transitions. [2024-10-11 20:07:28,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-11 20:07:28,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:28,789 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:28,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 20:07:28,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 20:07:28,990 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-10-11 20:07:28,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:28,990 INFO L85 PathProgramCache]: Analyzing trace with hash 646559398, now seen corresponding path program 1 times [2024-10-11 20:07:28,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:28,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047153108] [2024-10-11 20:07:28,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:28,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:29,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:29,121 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 20:07:29,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:29,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047153108] [2024-10-11 20:07:29,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047153108] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:07:29,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425689271] [2024-10-11 20:07:29,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:29,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:29,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:29,123 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:07:29,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 20:07:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:29,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:07:29,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:07:29,250 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 20:07:29,251 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:07:29,303 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 20:07:29,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425689271] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:07:29,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:07:29,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-11 20:07:29,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545545407] [2024-10-11 20:07:29,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:07:29,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:07:29,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:29,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:07:29,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:07:29,306 INFO L87 Difference]: Start difference. First operand 196 states and 205 transitions. Second operand has 12 states, 11 states have (on average 11.454545454545455) internal successors, (126), 12 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:29,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:29,593 INFO L93 Difference]: Finished difference Result 243 states and 258 transitions. [2024-10-11 20:07:29,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:07:29,594 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 11.454545454545455) internal successors, (126), 12 states have internal predecessors, (126), 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 109 [2024-10-11 20:07:29,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:29,595 INFO L225 Difference]: With dead ends: 243 [2024-10-11 20:07:29,595 INFO L226 Difference]: Without dead ends: 242 [2024-10-11 20:07:29,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:07:29,596 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 194 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:29,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 148 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:07:29,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-10-11 20:07:29,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 217. [2024-10-11 20:07:29,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 214 states have (on average 1.0700934579439252) internal successors, (229), 216 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:29,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 229 transitions. [2024-10-11 20:07:29,603 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 229 transitions. Word has length 109 [2024-10-11 20:07:29,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:29,603 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 229 transitions. [2024-10-11 20:07:29,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 11.454545454545455) internal successors, (126), 12 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:29,603 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 229 transitions. [2024-10-11 20:07:29,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 20:07:29,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:29,604 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:29,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 20:07:29,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:29,806 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-10-11 20:07:29,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:29,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1033925821, now seen corresponding path program 1 times [2024-10-11 20:07:29,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:29,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434420874] [2024-10-11 20:07:29,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:29,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:29,874 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-10-11 20:07:29,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:29,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434420874] [2024-10-11 20:07:29,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434420874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:29,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:29,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:07:29,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990714599] [2024-10-11 20:07:29,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:29,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:07:29,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:29,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:07:29,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:29,876 INFO L87 Difference]: Start difference. First operand 217 states and 229 transitions. Second operand has 4 states, 3 states have (on average 26.666666666666668) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:30,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:30,008 INFO L93 Difference]: Finished difference Result 222 states and 235 transitions. [2024-10-11 20:07:30,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:07:30,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 26.666666666666668) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-10-11 20:07:30,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:30,009 INFO L225 Difference]: With dead ends: 222 [2024-10-11 20:07:30,009 INFO L226 Difference]: Without dead ends: 221 [2024-10-11 20:07:30,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:30,010 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 66 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:30,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 85 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:07:30,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-10-11 20:07:30,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 167. [2024-10-11 20:07:30,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 165 states have (on average 1.0787878787878789) internal successors, (178), 166 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:30,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 178 transitions. [2024-10-11 20:07:30,016 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 178 transitions. Word has length 113 [2024-10-11 20:07:30,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:30,016 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 178 transitions. [2024-10-11 20:07:30,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 26.666666666666668) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:30,017 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 178 transitions. [2024-10-11 20:07:30,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 20:07:30,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:30,018 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:30,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 20:07:30,019 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-10-11 20:07:30,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:30,019 INFO L85 PathProgramCache]: Analyzing trace with hash 423172511, now seen corresponding path program 1 times [2024-10-11 20:07:30,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:30,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864626264] [2024-10-11 20:07:30,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:30,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:30,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:30,114 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:07:30,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:30,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864626264] [2024-10-11 20:07:30,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864626264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:30,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:30,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:07:30,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892756845] [2024-10-11 20:07:30,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:30,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:07:30,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:30,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:07:30,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:30,116 INFO L87 Difference]: Start difference. First operand 167 states and 178 transitions. Second operand has 4 states, 3 states have (on average 36.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:30,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:30,237 INFO L93 Difference]: Finished difference Result 175 states and 187 transitions. [2024-10-11 20:07:30,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:07:30,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 36.0) internal successors, (108), 4 states have internal predecessors, (108), 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 117 [2024-10-11 20:07:30,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:30,238 INFO L225 Difference]: With dead ends: 175 [2024-10-11 20:07:30,238 INFO L226 Difference]: Without dead ends: 174 [2024-10-11 20:07:30,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:30,239 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 66 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:30,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 82 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:07:30,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-10-11 20:07:30,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 139. [2024-10-11 20:07:30,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.0797101449275361) internal successors, (149), 138 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:30,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 149 transitions. [2024-10-11 20:07:30,244 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 149 transitions. Word has length 117 [2024-10-11 20:07:30,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:30,245 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 149 transitions. [2024-10-11 20:07:30,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 36.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:30,245 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 149 transitions. [2024-10-11 20:07:30,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 20:07:30,246 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:30,246 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:30,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 20:07:30,246 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-10-11 20:07:30,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:30,247 INFO L85 PathProgramCache]: Analyzing trace with hash 761113296, now seen corresponding path program 2 times [2024-10-11 20:07:30,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:30,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989947128] [2024-10-11 20:07:30,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:30,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:30,969 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 49 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:07:30,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:30,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989947128] [2024-10-11 20:07:30,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989947128] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:07:30,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820192064] [2024-10-11 20:07:30,970 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:07:30,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:30,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:30,972 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:07:30,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 20:07:31,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 20:07:31,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:07:31,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:07:31,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:07:31,222 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 20:07:31,223 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:07:31,384 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 20:07:31,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820192064] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:07:31,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:07:31,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 3, 3] total 18 [2024-10-11 20:07:31,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234837209] [2024-10-11 20:07:31,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:07:31,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 20:07:31,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:31,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 20:07:31,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2024-10-11 20:07:31,387 INFO L87 Difference]: Start difference. First operand 139 states and 149 transitions. Second operand has 18 states, 18 states have (on average 12.444444444444445) internal successors, (224), 18 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:32,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:32,336 INFO L93 Difference]: Finished difference Result 386 states and 410 transitions. [2024-10-11 20:07:32,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 20:07:32,338 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 12.444444444444445) internal successors, (224), 18 states have internal predecessors, (224), 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 130 [2024-10-11 20:07:32,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:32,339 INFO L225 Difference]: With dead ends: 386 [2024-10-11 20:07:32,339 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:07:32,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 257 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=247, Invalid=943, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 20:07:32,340 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 878 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:32,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 205 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1160 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 20:07:32,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:07:32,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:07:32,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:32,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:07:32,342 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 130 [2024-10-11 20:07:32,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:32,342 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:07:32,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 12.444444444444445) internal successors, (224), 18 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:32,342 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:07:32,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:07:32,345 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 86 remaining) [2024-10-11 20:07:32,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 86 remaining) [2024-10-11 20:07:32,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 86 remaining) [2024-10-11 20:07:32,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 86 remaining) [2024-10-11 20:07:32,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 86 remaining) [2024-10-11 20:07:32,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 86 remaining) [2024-10-11 20:07:32,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 86 remaining) [2024-10-11 20:07:32,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 86 remaining) [2024-10-11 20:07:32,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 86 remaining) [2024-10-11 20:07:32,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 86 remaining) [2024-10-11 20:07:32,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 86 remaining) [2024-10-11 20:07:32,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 86 remaining) [2024-10-11 20:07:32,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 86 remaining) [2024-10-11 20:07:32,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 86 remaining) [2024-10-11 20:07:32,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 86 remaining) [2024-10-11 20:07:32,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 86 remaining) [2024-10-11 20:07:32,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 86 remaining) [2024-10-11 20:07:32,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 86 remaining) [2024-10-11 20:07:32,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 86 remaining) [2024-10-11 20:07:32,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 86 remaining) [2024-10-11 20:07:32,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 86 remaining) [2024-10-11 20:07:32,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 86 remaining) [2024-10-11 20:07:32,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 86 remaining) [2024-10-11 20:07:32,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 86 remaining) [2024-10-11 20:07:32,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 86 remaining) [2024-10-11 20:07:32,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 86 remaining) [2024-10-11 20:07:32,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 86 remaining) [2024-10-11 20:07:32,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 86 remaining) [2024-10-11 20:07:32,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 86 remaining) [2024-10-11 20:07:32,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 86 remaining) [2024-10-11 20:07:32,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 86 remaining) [2024-10-11 20:07:32,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 86 remaining) [2024-10-11 20:07:32,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 86 remaining) [2024-10-11 20:07:32,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 86 remaining) [2024-10-11 20:07:32,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 86 remaining) [2024-10-11 20:07:32,353 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 86 remaining) [2024-10-11 20:07:32,353 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 86 remaining) [2024-10-11 20:07:32,353 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 86 remaining) [2024-10-11 20:07:32,354 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 86 remaining) [2024-10-11 20:07:32,354 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 86 remaining) [2024-10-11 20:07:32,354 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 86 remaining) [2024-10-11 20:07:32,355 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 86 remaining) [2024-10-11 20:07:32,355 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 86 remaining) [2024-10-11 20:07:32,355 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 86 remaining) [2024-10-11 20:07:32,355 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 86 remaining) [2024-10-11 20:07:32,355 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 86 remaining) [2024-10-11 20:07:32,355 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 86 remaining) [2024-10-11 20:07:32,355 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 86 remaining) [2024-10-11 20:07:32,355 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 86 remaining) [2024-10-11 20:07:32,355 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 86 remaining) [2024-10-11 20:07:32,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 86 remaining) [2024-10-11 20:07:32,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 86 remaining) [2024-10-11 20:07:32,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 86 remaining) [2024-10-11 20:07:32,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 86 remaining) [2024-10-11 20:07:32,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 86 remaining) [2024-10-11 20:07:32,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 86 remaining) [2024-10-11 20:07:32,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 86 remaining) [2024-10-11 20:07:32,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 86 remaining) [2024-10-11 20:07:32,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 86 remaining) [2024-10-11 20:07:32,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 86 remaining) [2024-10-11 20:07:32,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 86 remaining) [2024-10-11 20:07:32,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 86 remaining) [2024-10-11 20:07:32,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 86 remaining) [2024-10-11 20:07:32,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 86 remaining) [2024-10-11 20:07:32,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 86 remaining) [2024-10-11 20:07:32,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 86 remaining) [2024-10-11 20:07:32,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 86 remaining) [2024-10-11 20:07:32,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 86 remaining) [2024-10-11 20:07:32,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 86 remaining) [2024-10-11 20:07:32,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 86 remaining) [2024-10-11 20:07:32,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 86 remaining) [2024-10-11 20:07:32,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 86 remaining) [2024-10-11 20:07:32,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 86 remaining) [2024-10-11 20:07:32,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 86 remaining) [2024-10-11 20:07:32,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 86 remaining) [2024-10-11 20:07:32,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 86 remaining) [2024-10-11 20:07:32,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 86 remaining) [2024-10-11 20:07:32,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 86 remaining) [2024-10-11 20:07:32,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 86 remaining) [2024-10-11 20:07:32,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 86 remaining) [2024-10-11 20:07:32,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 86 remaining) [2024-10-11 20:07:32,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 86 remaining) [2024-10-11 20:07:32,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 86 remaining) [2024-10-11 20:07:32,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 86 remaining) [2024-10-11 20:07:32,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 86 remaining) [2024-10-11 20:07:32,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 86 remaining) [2024-10-11 20:07:32,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 20:07:32,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:32,571 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:32,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:07:32,877 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:07:32,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:07:32 BoogieIcfgContainer [2024-10-11 20:07:32,907 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:07:32,908 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:07:32,908 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:07:32,908 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:07:32,908 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:07:19" (3/4) ... [2024-10-11 20:07:32,910 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:07:32,922 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2024-10-11 20:07:32,923 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-11 20:07:32,923 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-11 20:07:32,924 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:07:32,924 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:07:33,044 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:07:33,045 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:07:33,045 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:07:33,045 INFO L158 Benchmark]: Toolchain (without parser) took 14979.31ms. Allocated memory was 163.6MB in the beginning and 310.4MB in the end (delta: 146.8MB). Free memory was 115.3MB in the beginning and 158.9MB in the end (delta: -43.7MB). Peak memory consumption was 104.2MB. Max. memory is 16.1GB. [2024-10-11 20:07:33,046 INFO L158 Benchmark]: CDTParser took 1.66ms. Allocated memory is still 163.6MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:07:33,046 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.89ms. Allocated memory is still 163.6MB. Free memory was 114.8MB in the beginning and 100.9MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 20:07:33,046 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.93ms. Allocated memory is still 163.6MB. Free memory was 100.9MB in the beginning and 98.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:07:33,046 INFO L158 Benchmark]: Boogie Preprocessor took 62.05ms. Allocated memory is still 163.6MB. Free memory was 98.5MB in the beginning and 95.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:07:33,047 INFO L158 Benchmark]: RCFGBuilder took 725.31ms. Allocated memory is still 163.6MB. Free memory was 95.9MB in the beginning and 67.1MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-11 20:07:33,047 INFO L158 Benchmark]: TraceAbstraction took 13674.09ms. Allocated memory was 163.6MB in the beginning and 310.4MB in the end (delta: 146.8MB). Free memory was 66.5MB in the beginning and 166.3MB in the end (delta: -99.7MB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. [2024-10-11 20:07:33,047 INFO L158 Benchmark]: Witness Printer took 137.26ms. Allocated memory is still 310.4MB. Free memory was 166.3MB in the beginning and 158.9MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 20:07:33,049 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.66ms. Allocated memory is still 163.6MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 316.89ms. Allocated memory is still 163.6MB. Free memory was 114.8MB in the beginning and 100.9MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.93ms. Allocated memory is still 163.6MB. Free memory was 100.9MB in the beginning and 98.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.05ms. Allocated memory is still 163.6MB. Free memory was 98.5MB in the beginning and 95.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 725.31ms. Allocated memory is still 163.6MB. Free memory was 95.9MB in the beginning and 67.1MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 13674.09ms. Allocated memory was 163.6MB in the beginning and 310.4MB in the end (delta: 146.8MB). Free memory was 66.5MB in the beginning and 166.3MB in the end (delta: -99.7MB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. * Witness Printer took 137.26ms. Allocated memory is still 310.4MB. Free memory was 166.3MB in the beginning and 158.9MB in the end (delta: 7.3MB). 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: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 64]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 64]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 64]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 64]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: 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, 195 locations, 86 error locations. Started 1 CEGAR loops. OverallTime: 13.2s, OverallIterations: 22, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3578 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3578 mSDsluCounter, 3525 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1732 mSDsCounter, 263 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6481 IncrementalHoareTripleChecker+Invalid, 6744 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 263 mSolverCounterUnsat, 1793 mSDtfsCounter, 6481 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1269 GetRequests, 1152 SyntacticMatches, 3 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=284occurred in iteration=13, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 265 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 2111 NumberOfCodeBlocks, 1927 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2507 ConstructedInterpolants, 0 QuantifiedInterpolants, 7687 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1422 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 36 InterpolantComputations, 17 PerfectInterpolantSequences, 734/905 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 86 specifications checked. All of them hold - InvariantResult [Line: 70]: Loop Invariant Derived loop invariant: (((((((CELLCOUNT == (((CELLCOUNT >= 0) ? (CELLCOUNT / 3) : ((CELLCOUNT / 3) - 1)) * 3)) && (i == 0)) && (2 <= CELLCOUNT)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL2 == 3)) || ((((((CELLCOUNT == (((CELLCOUNT >= 0) ? (CELLCOUNT / 3) : ((CELLCOUNT / 3) - 1)) * 3)) && (1 <= i)) && (2 <= CELLCOUNT)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL2 == 3))) - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: (((((((CELLCOUNT == (((CELLCOUNT >= 0) ? (CELLCOUNT / 3) : ((CELLCOUNT / 3) - 1)) * 3)) && (2 <= CELLCOUNT)) && (i == 1)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL2 == 3)) || ((((((CELLCOUNT == (((CELLCOUNT >= 0) ? (CELLCOUNT / 3) : ((CELLCOUNT / 3) - 1)) * 3)) && (2 <= CELLCOUNT)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL2 == 3)) && (2 <= i))) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (((((((CELLCOUNT == (((CELLCOUNT >= 0) ? (CELLCOUNT / 3) : ((CELLCOUNT / 3) - 1)) * 3)) && (2 <= CELLCOUNT)) && (i == 1)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL2 == 3)) || ((((((CELLCOUNT == (((CELLCOUNT >= 0) ? (CELLCOUNT / 3) : ((CELLCOUNT / 3) - 1)) * 3)) && (2 <= CELLCOUNT)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL2 == 3)) && (2 <= i))) - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: (((((((CELLCOUNT == (((CELLCOUNT >= 0) ? (CELLCOUNT / 3) : ((CELLCOUNT / 3) - 1)) * 3)) && (2 <= CELLCOUNT)) && (i == 1)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL2 == 3)) || ((((((CELLCOUNT == (((CELLCOUNT >= 0) ? (CELLCOUNT / 3) : ((CELLCOUNT / 3) - 1)) * 3)) && (2 <= CELLCOUNT)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL2 == 3)) && (2 <= i))) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:07:33,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE