./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/mbpr4.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/mbpr4.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 d3770c63a87ff983494c9353997301d9eb30588c650f83b67bcf55f325443055 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:07:17,137 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:07:17,217 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:17,225 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:07:17,226 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:07:17,259 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:07:17,260 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:07:17,260 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:07:17,261 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:07:17,262 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:07:17,263 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:07:17,263 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:07:17,264 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:07:17,264 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:07:17,264 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:07:17,264 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:07:17,265 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:07:17,265 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:07:17,268 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:07:17,269 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:07:17,269 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:07:17,269 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:07:17,270 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:07:17,270 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:07:17,270 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:07:17,270 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:07:17,271 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:07:17,271 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:07:17,271 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:07:17,271 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:07:17,272 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:07:17,272 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:07:17,272 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:07:17,272 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:07:17,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:07:17,273 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:07:17,273 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:07:17,273 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:07:17,273 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:07:17,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:07:17,274 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:07:17,275 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:07:17,275 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:07:17,276 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:07:17,276 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 -> d3770c63a87ff983494c9353997301d9eb30588c650f83b67bcf55f325443055 [2024-10-11 20:07:17,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:07:17,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:07:17,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:07:17,571 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:07:17,572 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:07:17,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr4.c [2024-10-11 20:07:19,104 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:07:19,300 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:07:19,300 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr4.c [2024-10-11 20:07:19,308 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/72a5a0027/c4dd96d348b74488881757c75ff5ac99/FLAG0aeb517b4 [2024-10-11 20:07:19,661 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/72a5a0027/c4dd96d348b74488881757c75ff5ac99 [2024-10-11 20:07:19,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:07:19,665 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:07:19,666 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:07:19,666 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:07:19,672 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:07:19,673 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:07:19" (1/1) ... [2024-10-11 20:07:19,674 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14139bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:19, skipping insertion in model container [2024-10-11 20:07:19,674 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:07:19" (1/1) ... [2024-10-11 20:07:19,697 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:07:19,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:07:19,948 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:07:19,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:07:20,011 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:07:20,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:20 WrapperNode [2024-10-11 20:07:20,012 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:07:20,013 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:07:20,013 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:07:20,014 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:07:20,021 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:20" (1/1) ... [2024-10-11 20:07:20,035 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:20" (1/1) ... [2024-10-11 20:07:20,072 INFO L138 Inliner]: procedures = 15, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 293 [2024-10-11 20:07:20,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:07:20,073 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:07:20,074 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:07:20,074 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:07:20,086 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:20" (1/1) ... [2024-10-11 20:07:20,087 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:20" (1/1) ... [2024-10-11 20:07:20,090 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:20" (1/1) ... [2024-10-11 20:07:20,108 INFO L175 MemorySlicer]: Split 44 memory accesses to 3 slices as follows [2, 8, 34]. 77 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0]. The 20 writes are split as follows [0, 0, 20]. [2024-10-11 20:07:20,109 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:20" (1/1) ... [2024-10-11 20:07:20,109 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:20" (1/1) ... [2024-10-11 20:07:20,124 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:20" (1/1) ... [2024-10-11 20:07:20,128 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:20" (1/1) ... [2024-10-11 20:07:20,130 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:20" (1/1) ... [2024-10-11 20:07:20,132 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:20" (1/1) ... [2024-10-11 20:07:20,135 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:07:20,136 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:07:20,136 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:07:20,136 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:07:20,137 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:20" (1/1) ... [2024-10-11 20:07:20,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:07:20,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:20,178 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:20,181 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:20,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:07:20,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:07:20,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 20:07:20,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 20:07:20,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 20:07:20,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 20:07:20,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 20:07:20,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 20:07:20,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:07:20,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:07:20,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 20:07:20,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 20:07:20,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 20:07:20,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 20:07:20,320 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:07:20,322 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:07:21,016 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2024-10-11 20:07:21,016 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:07:21,065 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:07:21,065 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-11 20:07:21,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:07:21 BoogieIcfgContainer [2024-10-11 20:07:21,066 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:07:21,068 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:07:21,068 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:07:21,072 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:07:21,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:07:19" (1/3) ... [2024-10-11 20:07:21,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1642033f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:07:21, skipping insertion in model container [2024-10-11 20:07:21,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:20" (2/3) ... [2024-10-11 20:07:21,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1642033f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:07:21, skipping insertion in model container [2024-10-11 20:07:21,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:07:21" (3/3) ... [2024-10-11 20:07:21,075 INFO L112 eAbstractionObserver]: Analyzing ICFG mbpr4.c [2024-10-11 20:07:21,094 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:07:21,094 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 146 error locations. [2024-10-11 20:07:21,163 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:07:21,169 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;@4c31e1fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:07:21,170 INFO L334 AbstractCegarLoop]: Starting to check reachability of 146 error locations. [2024-10-11 20:07:21,174 INFO L276 IsEmpty]: Start isEmpty. Operand has 318 states, 171 states have (on average 1.9649122807017543) internal successors, (336), 317 states have internal predecessors, (336), 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,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 20:07:21,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:21,179 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 20:07:21,180 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-10-11 20:07:21,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:21,184 INFO L85 PathProgramCache]: Analyzing trace with hash 518469336, now seen corresponding path program 1 times [2024-10-11 20:07:21,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:21,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667046447] [2024-10-11 20:07:21,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:21,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:21,408 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,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:21,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667046447] [2024-10-11 20:07:21,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667046447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:21,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:21,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:07:21,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416026491] [2024-10-11 20:07:21,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:21,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 20:07:21,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:21,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 20:07:21,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:07:21,447 INFO L87 Difference]: Start difference. First operand has 318 states, 171 states have (on average 1.9649122807017543) internal successors, (336), 317 states have internal predecessors, (336), 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:21,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:21,498 INFO L93 Difference]: Finished difference Result 632 states and 665 transitions. [2024-10-11 20:07:21,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 20:07:21,501 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:21,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:21,515 INFO L225 Difference]: With dead ends: 632 [2024-10-11 20:07:21,515 INFO L226 Difference]: Without dead ends: 314 [2024-10-11 20:07:21,521 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:21,526 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:21,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 322 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:07:21,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-10-11 20:07:21,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2024-10-11 20:07:21,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 168 states have (on average 1.9226190476190477) internal successors, (323), 313 states have internal predecessors, (323), 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,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 323 transitions. [2024-10-11 20:07:21,593 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 323 transitions. Word has length 6 [2024-10-11 20:07:21,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:21,594 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 323 transitions. [2024-10-11 20:07:21,594 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:21,594 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 323 transitions. [2024-10-11 20:07:21,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 20:07:21,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:21,594 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 20:07:21,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:07:21,595 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-10-11 20:07:21,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:21,595 INFO L85 PathProgramCache]: Analyzing trace with hash 518471258, now seen corresponding path program 1 times [2024-10-11 20:07:21,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:21,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014214981] [2024-10-11 20:07:21,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:21,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:21,854 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,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:21,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014214981] [2024-10-11 20:07:21,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014214981] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:21,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:21,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:07:21,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996866055] [2024-10-11 20:07:21,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:21,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:07:21,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:21,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:07:21,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:21,857 INFO L87 Difference]: Start difference. First operand 314 states and 323 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:21,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:21,982 INFO L93 Difference]: Finished difference Result 314 states and 323 transitions. [2024-10-11 20:07:21,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:07:21,982 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:21,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:21,984 INFO L225 Difference]: With dead ends: 314 [2024-10-11 20:07:21,984 INFO L226 Difference]: Without dead ends: 310 [2024-10-11 20:07:21,985 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:21,986 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 314 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:21,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 291 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:07:21,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-10-11 20:07:21,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2024-10-11 20:07:22,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 168 states have (on average 1.8988095238095237) internal successors, (319), 309 states have internal predecessors, (319), 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,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 319 transitions. [2024-10-11 20:07:22,001 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 319 transitions. Word has length 6 [2024-10-11 20:07:22,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:22,002 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 319 transitions. [2024-10-11 20:07:22,002 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:22,002 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 319 transitions. [2024-10-11 20:07:22,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 20:07:22,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:22,002 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:22,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:07:22,003 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-10-11 20:07:22,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:22,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1107260132, now seen corresponding path program 1 times [2024-10-11 20:07:22,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:22,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612537551] [2024-10-11 20:07:22,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:22,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:22,285 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:22,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:22,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612537551] [2024-10-11 20:07:22,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612537551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:22,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:22,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:07:22,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149106249] [2024-10-11 20:07:22,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:22,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:07:22,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:22,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:07:22,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:07:22,289 INFO L87 Difference]: Start difference. First operand 310 states and 319 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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:22,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:22,354 INFO L93 Difference]: Finished difference Result 310 states and 319 transitions. [2024-10-11 20:07:22,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:07:22,355 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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:22,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:22,357 INFO L225 Difference]: With dead ends: 310 [2024-10-11 20:07:22,357 INFO L226 Difference]: Without dead ends: 306 [2024-10-11 20:07:22,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:07:22,359 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 310 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:22,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 290 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:07:22,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-10-11 20:07:22,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2024-10-11 20:07:22,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 168 states have (on average 1.875) internal successors, (315), 305 states have internal predecessors, (315), 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,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 315 transitions. [2024-10-11 20:07:22,372 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 315 transitions. Word has length 7 [2024-10-11 20:07:22,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:22,372 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 315 transitions. [2024-10-11 20:07:22,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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:22,373 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 315 transitions. [2024-10-11 20:07:22,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 20:07:22,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:22,373 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:22,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:07:22,374 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-10-11 20:07:22,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:22,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1037700447, now seen corresponding path program 1 times [2024-10-11 20:07:22,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:22,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521907792] [2024-10-11 20:07:22,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:22,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:22,434 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:22,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:22,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521907792] [2024-10-11 20:07:22,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521907792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:22,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:22,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:07:22,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014788904] [2024-10-11 20:07:22,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:22,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:07:22,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:22,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:07:22,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:07:22,436 INFO L87 Difference]: Start difference. First operand 306 states and 315 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:23,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:23,011 INFO L93 Difference]: Finished difference Result 578 states and 595 transitions. [2024-10-11 20:07:23,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:07:23,012 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:23,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:23,014 INFO L225 Difference]: With dead ends: 578 [2024-10-11 20:07:23,014 INFO L226 Difference]: Without dead ends: 450 [2024-10-11 20:07:23,014 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:23,018 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 140 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:23,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 213 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 20:07:23,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-10-11 20:07:23,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2024-10-11 20:07:23,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 312 states have (on average 1.4967948717948718) internal successors, (467), 449 states have internal predecessors, (467), 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,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 467 transitions. [2024-10-11 20:07:23,039 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 467 transitions. Word has length 10 [2024-10-11 20:07:23,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:23,039 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 467 transitions. [2024-10-11 20:07:23,039 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:23,039 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 467 transitions. [2024-10-11 20:07:23,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 20:07:23,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:23,044 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] [2024-10-11 20:07:23,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 20:07:23,044 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr144ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-10-11 20:07:23,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:23,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1998435804, now seen corresponding path program 1 times [2024-10-11 20:07:23,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:23,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598069375] [2024-10-11 20:07:23,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:23,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:23,169 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:23,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:23,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598069375] [2024-10-11 20:07:23,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598069375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:23,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:23,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:07:23,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349474106] [2024-10-11 20:07:23,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:23,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:07:23,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:23,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:07:23,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:23,171 INFO L87 Difference]: Start difference. First operand 450 states and 467 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:23,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:23,465 INFO L93 Difference]: Finished difference Result 459 states and 477 transitions. [2024-10-11 20:07:23,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:07:23,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-10-11 20:07:23,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:23,467 INFO L225 Difference]: With dead ends: 459 [2024-10-11 20:07:23,467 INFO L226 Difference]: Without dead ends: 457 [2024-10-11 20:07:23,468 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:23,468 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 2 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:23,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 643 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:07:23,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-10-11 20:07:23,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 457. [2024-10-11 20:07:23,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 319 states have (on average 1.4890282131661443) internal successors, (475), 456 states have internal predecessors, (475), 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,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 475 transitions. [2024-10-11 20:07:23,486 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 475 transitions. Word has length 27 [2024-10-11 20:07:23,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:23,487 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 475 transitions. [2024-10-11 20:07:23,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:23,487 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 475 transitions. [2024-10-11 20:07:23,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 20:07:23,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:23,489 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] [2024-10-11 20:07:23,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:07:23,490 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr144ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-10-11 20:07:23,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:23,490 INFO L85 PathProgramCache]: Analyzing trace with hash 261187733, now seen corresponding path program 1 times [2024-10-11 20:07:23,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:23,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729057397] [2024-10-11 20:07:23,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:23,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:23,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:23,756 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:23,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:23,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729057397] [2024-10-11 20:07:23,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729057397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:23,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:23,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:07:23,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663815619] [2024-10-11 20:07:23,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:23,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:07:23,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:23,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:07:23,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:07:23,759 INFO L87 Difference]: Start difference. First operand 457 states and 475 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:24,321 INFO L93 Difference]: Finished difference Result 801 states and 833 transitions. [2024-10-11 20:07:24,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:07:24,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 34 [2024-10-11 20:07:24,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:24,324 INFO L225 Difference]: With dead ends: 801 [2024-10-11 20:07:24,324 INFO L226 Difference]: Without dead ends: 457 [2024-10-11 20:07:24,325 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:24,326 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 1030 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1030 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:24,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1030 Valid, 194 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 20:07:24,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-10-11 20:07:24,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 457. [2024-10-11 20:07:24,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 319 states have (on average 1.4764890282131662) internal successors, (471), 456 states have internal predecessors, (471), 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,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 471 transitions. [2024-10-11 20:07:24,339 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 471 transitions. Word has length 34 [2024-10-11 20:07:24,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:24,340 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 471 transitions. [2024-10-11 20:07:24,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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,340 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 471 transitions. [2024-10-11 20:07:24,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 20:07:24,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:24,341 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:24,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 20:07:24,341 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-10-11 20:07:24,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:24,342 INFO L85 PathProgramCache]: Analyzing trace with hash -477095143, now seen corresponding path program 1 times [2024-10-11 20:07:24,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:24,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590215845] [2024-10-11 20:07:24,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:24,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:24,415 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:24,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:24,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590215845] [2024-10-11 20:07:24,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590215845] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:24,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:24,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:07:24,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364563219] [2024-10-11 20:07:24,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:24,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:07:24,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:24,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:07:24,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:24,418 INFO L87 Difference]: Start difference. First operand 457 states and 471 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:24,852 INFO L93 Difference]: Finished difference Result 461 states and 475 transitions. [2024-10-11 20:07:24,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:07:24,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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 38 [2024-10-11 20:07:24,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:24,854 INFO L225 Difference]: With dead ends: 461 [2024-10-11 20:07:24,854 INFO L226 Difference]: Without dead ends: 459 [2024-10-11 20:07:24,855 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,856 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 114 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:24,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 391 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 20:07:24,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-10-11 20:07:24,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 459. [2024-10-11 20:07:24,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 321 states have (on average 1.4735202492211839) internal successors, (473), 458 states have internal predecessors, (473), 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,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 473 transitions. [2024-10-11 20:07:24,867 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 473 transitions. Word has length 38 [2024-10-11 20:07:24,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:24,867 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 473 transitions. [2024-10-11 20:07:24,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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,868 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 473 transitions. [2024-10-11 20:07:24,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 20:07:24,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:24,869 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] [2024-10-11 20:07:24,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 20:07:24,869 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-10-11 20:07:24,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:24,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1403000749, now seen corresponding path program 1 times [2024-10-11 20:07:24,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:24,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972953244] [2024-10-11 20:07:24,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:24,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:24,963 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:24,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:24,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972953244] [2024-10-11 20:07:24,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972953244] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:07:24,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166118424] [2024-10-11 20:07:24,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:24,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:24,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:24,967 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:24,968 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:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:25,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:07:25,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:07:25,152 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:25,152 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:07:25,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166118424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:25,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:07:25,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-11 20:07:25,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945290719] [2024-10-11 20:07:25,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:25,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:07:25,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:25,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:07:25,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:07:25,154 INFO L87 Difference]: Start difference. First operand 459 states and 473 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 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,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:25,705 INFO L93 Difference]: Finished difference Result 459 states and 473 transitions. [2024-10-11 20:07:25,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:07:25,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 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 44 [2024-10-11 20:07:25,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:25,708 INFO L225 Difference]: With dead ends: 459 [2024-10-11 20:07:25,708 INFO L226 Difference]: Without dead ends: 442 [2024-10-11 20:07:25,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 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:25,709 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 145 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:25,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 341 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 20:07:25,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-10-11 20:07:25,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2024-10-11 20:07:25,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 321 states have (on average 1.4205607476635513) internal successors, (456), 441 states have internal predecessors, (456), 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,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 456 transitions. [2024-10-11 20:07:25,724 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 456 transitions. Word has length 44 [2024-10-11 20:07:25,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:25,725 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 456 transitions. [2024-10-11 20:07:25,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 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,725 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 456 transitions. [2024-10-11 20:07:25,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 20:07:25,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:25,727 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:25,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 20:07:25,928 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:25,928 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-10-11 20:07:25,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:25,929 INFO L85 PathProgramCache]: Analyzing trace with hash 543350325, now seen corresponding path program 1 times [2024-10-11 20:07:25,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:25,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097695957] [2024-10-11 20:07:25,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:25,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:26,024 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:26,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:26,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097695957] [2024-10-11 20:07:26,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097695957] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:07:26,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480486127] [2024-10-11 20:07:26,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:26,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:26,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:26,027 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:26,029 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:26,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:26,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:07:26,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:07:26,177 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:26,178 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:07:26,247 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:26,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480486127] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:07:26,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:07:26,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-10-11 20:07:26,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937604457] [2024-10-11 20:07:26,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:07:26,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 20:07:26,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:26,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 20:07:26,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:07:26,249 INFO L87 Difference]: Start difference. First operand 442 states and 456 transitions. Second operand has 10 states, 9 states have (on average 13.444444444444445) internal successors, (121), 10 states have internal predecessors, (121), 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,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:27,027 INFO L93 Difference]: Finished difference Result 491 states and 525 transitions. [2024-10-11 20:07:27,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:07:27,028 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 13.444444444444445) internal successors, (121), 10 states have internal predecessors, (121), 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 45 [2024-10-11 20:07:27,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:27,030 INFO L225 Difference]: With dead ends: 491 [2024-10-11 20:07:27,031 INFO L226 Difference]: Without dead ends: 432 [2024-10-11 20:07:27,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 84 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:27,032 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 492 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:27,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 350 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 20:07:27,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-10-11 20:07:27,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 429. [2024-10-11 20:07:27,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 364 states have (on average 1.228021978021978) internal successors, (447), 428 states have internal predecessors, (447), 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,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 447 transitions. [2024-10-11 20:07:27,045 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 447 transitions. Word has length 45 [2024-10-11 20:07:27,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:27,046 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 447 transitions. [2024-10-11 20:07:27,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 13.444444444444445) internal successors, (121), 10 states have internal predecessors, (121), 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,047 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 447 transitions. [2024-10-11 20:07:27,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 20:07:27,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:27,051 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:27,069 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:27,251 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:27,252 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-10-11 20:07:27,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:27,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1984275619, now seen corresponding path program 1 times [2024-10-11 20:07:27,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:27,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117604800] [2024-10-11 20:07:27,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:27,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:27,373 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:27,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:27,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117604800] [2024-10-11 20:07:27,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117604800] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:27,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:27,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:07:27,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761545728] [2024-10-11 20:07:27,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:27,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:07:27,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:27,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:07:27,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:07:27,375 INFO L87 Difference]: Start difference. First operand 429 states and 447 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:27,401 INFO L93 Difference]: Finished difference Result 708 states and 736 transitions. [2024-10-11 20:07:27,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:07:27,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 76 [2024-10-11 20:07:27,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:27,403 INFO L225 Difference]: With dead ends: 708 [2024-10-11 20:07:27,403 INFO L226 Difference]: Without dead ends: 418 [2024-10-11 20:07:27,403 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:27,404 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 190 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:27,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 219 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:07:27,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-10-11 20:07:27,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2024-10-11 20:07:27,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 356 states have (on average 1.2191011235955056) internal successors, (434), 417 states have internal predecessors, (434), 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,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 434 transitions. [2024-10-11 20:07:27,415 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 434 transitions. Word has length 76 [2024-10-11 20:07:27,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:27,415 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 434 transitions. [2024-10-11 20:07:27,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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,415 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 434 transitions. [2024-10-11 20:07:27,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 20:07:27,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:27,416 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:27,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 20:07:27,416 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-10-11 20:07:27,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:27,417 INFO L85 PathProgramCache]: Analyzing trace with hash 446026477, now seen corresponding path program 1 times [2024-10-11 20:07:27,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:27,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131775817] [2024-10-11 20:07:27,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:27,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:27,510 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:27,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:27,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131775817] [2024-10-11 20:07:27,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131775817] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:27,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:27,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:07:27,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128064882] [2024-10-11 20:07:27,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:27,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:07:27,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:27,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:07:27,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:27,512 INFO L87 Difference]: Start difference. First operand 418 states and 434 transitions. Second operand has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 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,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:27,876 INFO L93 Difference]: Finished difference Result 425 states and 441 transitions. [2024-10-11 20:07:27,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:07:27,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 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 76 [2024-10-11 20:07:27,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:27,879 INFO L225 Difference]: With dead ends: 425 [2024-10-11 20:07:27,879 INFO L226 Difference]: Without dead ends: 423 [2024-10-11 20:07:27,879 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,880 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 109 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:27,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 235 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:07:27,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-10-11 20:07:27,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2024-10-11 20:07:27,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 359 states have (on average 1.2172701949860725) internal successors, (437), 420 states have internal predecessors, (437), 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,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 437 transitions. [2024-10-11 20:07:27,890 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 437 transitions. Word has length 76 [2024-10-11 20:07:27,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:27,890 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 437 transitions. [2024-10-11 20:07:27,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 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,890 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 437 transitions. [2024-10-11 20:07:27,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 20:07:27,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:27,893 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:27,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 20:07:27,893 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-10-11 20:07:27,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:27,894 INFO L85 PathProgramCache]: Analyzing trace with hash 2015568641, now seen corresponding path program 1 times [2024-10-11 20:07:27,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:27,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664101467] [2024-10-11 20:07:27,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:27,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:28,001 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:28,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:28,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664101467] [2024-10-11 20:07:28,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664101467] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:07:28,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499549631] [2024-10-11 20:07:28,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:28,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:28,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:28,003 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:28,005 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:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:28,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:07:28,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:07:28,144 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:28,145 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:07:28,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499549631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:28,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:07:28,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-11 20:07:28,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066384257] [2024-10-11 20:07:28,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:28,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:07:28,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:28,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:07:28,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:07:28,146 INFO L87 Difference]: Start difference. First operand 421 states and 437 transitions. Second operand has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 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:28,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:28,609 INFO L93 Difference]: Finished difference Result 423 states and 439 transitions. [2024-10-11 20:07:28,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:07:28,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 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 82 [2024-10-11 20:07:28,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:28,612 INFO L225 Difference]: With dead ends: 423 [2024-10-11 20:07:28,612 INFO L226 Difference]: Without dead ends: 408 [2024-10-11 20:07:28,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 80 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,612 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 135 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:28,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 233 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 20:07:28,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-10-11 20:07:28,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 406. [2024-10-11 20:07:28,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 359 states have (on average 1.1754874651810585) internal successors, (422), 405 states have internal predecessors, (422), 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,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 422 transitions. [2024-10-11 20:07:28,622 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 422 transitions. Word has length 82 [2024-10-11 20:07:28,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:28,622 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 422 transitions. [2024-10-11 20:07:28,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 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:28,622 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 422 transitions. [2024-10-11 20:07:28,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 20:07:28,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:28,623 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:28,640 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:28,823 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:28,824 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-10-11 20:07:28,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:28,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1941881411, now seen corresponding path program 1 times [2024-10-11 20:07:28,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:28,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668180352] [2024-10-11 20:07:28,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:28,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:28,943 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:28,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:28,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668180352] [2024-10-11 20:07:28,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668180352] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:07:28,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957524629] [2024-10-11 20:07:28,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:28,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:28,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:28,946 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:28,947 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:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:29,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:07:29,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:07:29,096 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:29,096 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:07:29,181 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:29,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957524629] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:07:29,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:07:29,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-10-11 20:07:29,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954262277] [2024-10-11 20:07:29,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:07:29,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 20:07:29,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:29,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 20:07:29,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:07:29,187 INFO L87 Difference]: Start difference. First operand 406 states and 422 transitions. Second operand has 10 states, 9 states have (on average 17.444444444444443) internal successors, (157), 10 states have internal predecessors, (157), 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,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:29,837 INFO L93 Difference]: Finished difference Result 450 states and 469 transitions. [2024-10-11 20:07:29,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:07:29,837 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 17.444444444444443) internal successors, (157), 10 states have internal predecessors, (157), 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:29,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:29,839 INFO L225 Difference]: With dead ends: 450 [2024-10-11 20:07:29,840 INFO L226 Difference]: Without dead ends: 448 [2024-10-11 20:07:29,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 160 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:29,841 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 251 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:29,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 320 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 20:07:29,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-10-11 20:07:29,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 446. [2024-10-11 20:07:29,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 399 states have (on average 1.162907268170426) internal successors, (464), 445 states have internal predecessors, (464), 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,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 464 transitions. [2024-10-11 20:07:29,853 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 464 transitions. Word has length 83 [2024-10-11 20:07:29,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:29,854 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 464 transitions. [2024-10-11 20:07:29,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 17.444444444444443) internal successors, (157), 10 states have internal predecessors, (157), 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,855 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 464 transitions. [2024-10-11 20:07:29,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 20:07:29,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:29,856 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:29,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 20:07:30,056 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:30,057 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-10-11 20:07:30,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:30,057 INFO L85 PathProgramCache]: Analyzing trace with hash 2105587830, now seen corresponding path program 1 times [2024-10-11 20:07:30,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:30,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008241430] [2024-10-11 20:07:30,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:30,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:30,135 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-10-11 20:07:30,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:30,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008241430] [2024-10-11 20:07:30,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008241430] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:30,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:30,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:07:30,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949075087] [2024-10-11 20:07:30,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:30,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:07:30,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:30,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:07:30,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:30,137 INFO L87 Difference]: Start difference. First operand 446 states and 464 transitions. Second operand has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 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,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:30,394 INFO L93 Difference]: Finished difference Result 446 states and 464 transitions. [2024-10-11 20:07:30,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:07:30,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 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 107 [2024-10-11 20:07:30,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:30,396 INFO L225 Difference]: With dead ends: 446 [2024-10-11 20:07:30,396 INFO L226 Difference]: Without dead ends: 445 [2024-10-11 20:07:30,396 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,397 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 118 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:30,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 143 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:07:30,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-10-11 20:07:30,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2024-10-11 20:07:30,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 399 states have (on average 1.1604010025062657) internal successors, (463), 444 states have internal predecessors, (463), 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,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 463 transitions. [2024-10-11 20:07:30,408 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 463 transitions. Word has length 107 [2024-10-11 20:07:30,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:30,409 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 463 transitions. [2024-10-11 20:07:30,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 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,409 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 463 transitions. [2024-10-11 20:07:30,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 20:07:30,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:30,410 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, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:30,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 20:07:30,410 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-10-11 20:07:30,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:30,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1777942499, now seen corresponding path program 2 times [2024-10-11 20:07:30,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:30,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461061771] [2024-10-11 20:07:30,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:30,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:30,761 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-10-11 20:07:30,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:30,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461061771] [2024-10-11 20:07:30,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461061771] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:07:30,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672594935] [2024-10-11 20:07:30,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:07:30,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:30,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:30,763 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:30,765 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:30,833 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 20:07:30,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:07:30,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:07:30,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:07:31,216 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-10-11 20:07:31,217 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:07:31,370 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-10-11 20:07:31,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672594935] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:07:31,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:07:31,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 2] total 7 [2024-10-11 20:07:31,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803175601] [2024-10-11 20:07:31,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:07:31,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 20:07:31,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:31,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 20:07:31,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:07:31,373 INFO L87 Difference]: Start difference. First operand 445 states and 463 transitions. Second operand has 9 states, 8 states have (on average 15.375) internal successors, (123), 8 states have internal predecessors, (123), 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:31,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:31,653 INFO L93 Difference]: Finished difference Result 445 states and 463 transitions. [2024-10-11 20:07:31,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:07:31,653 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 15.375) internal successors, (123), 8 states have internal predecessors, (123), 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:31,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:31,655 INFO L225 Difference]: With dead ends: 445 [2024-10-11 20:07:31,655 INFO L226 Difference]: Without dead ends: 438 [2024-10-11 20:07:31,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 220 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:07:31,656 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 552 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:31,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 49 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:07:31,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-10-11 20:07:31,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 351. [2024-10-11 20:07:31,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 312 states have (on average 1.1634615384615385) internal successors, (363), 350 states have internal predecessors, (363), 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:31,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 363 transitions. [2024-10-11 20:07:31,667 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 363 transitions. Word has length 113 [2024-10-11 20:07:31,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:31,668 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 363 transitions. [2024-10-11 20:07:31,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 15.375) internal successors, (123), 8 states have internal predecessors, (123), 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:31,668 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 363 transitions. [2024-10-11 20:07:31,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 20:07:31,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:31,670 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, 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:31,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 20:07:31,870 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:31,871 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-10-11 20:07:31,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:31,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1386345199, now seen corresponding path program 1 times [2024-10-11 20:07:31,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:31,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863285506] [2024-10-11 20:07:31,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:31,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:31,987 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:31,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:31,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863285506] [2024-10-11 20:07:31,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863285506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:31,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:31,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:07:31,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004235449] [2024-10-11 20:07:31,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:31,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:07:31,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:31,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:07:31,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:07:31,990 INFO L87 Difference]: Start difference. First operand 351 states and 363 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:32,011 INFO L93 Difference]: Finished difference Result 533 states and 552 transitions. [2024-10-11 20:07:32,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:07:32,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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 114 [2024-10-11 20:07:32,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:32,013 INFO L225 Difference]: With dead ends: 533 [2024-10-11 20:07:32,013 INFO L226 Difference]: Without dead ends: 341 [2024-10-11 20:07:32,014 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:32,014 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 124 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:32,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 190 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:07:32,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-10-11 20:07:32,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2024-10-11 20:07:32,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 304 states have (on average 1.1546052631578947) internal successors, (351), 340 states have internal predecessors, (351), 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,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 351 transitions. [2024-10-11 20:07:32,024 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 351 transitions. Word has length 114 [2024-10-11 20:07:32,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:32,024 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 351 transitions. [2024-10-11 20:07:32,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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,024 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 351 transitions. [2024-10-11 20:07:32,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 20:07:32,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:32,025 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, 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:32,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 20:07:32,026 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-10-11 20:07:32,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:32,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1370372955, now seen corresponding path program 1 times [2024-10-11 20:07:32,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:32,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056335483] [2024-10-11 20:07:32,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:32,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:32,129 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:32,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:32,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056335483] [2024-10-11 20:07:32,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056335483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:32,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:32,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:07:32,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389039120] [2024-10-11 20:07:32,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:32,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:07:32,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:32,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:07:32,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:32,132 INFO L87 Difference]: Start difference. First operand 341 states and 351 transitions. Second operand has 4 states, 3 states have (on average 36.666666666666664) internal successors, (110), 4 states have internal predecessors, (110), 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,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:32,469 INFO L93 Difference]: Finished difference Result 380 states and 391 transitions. [2024-10-11 20:07:32,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:07:32,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 36.666666666666664) internal successors, (110), 4 states have internal predecessors, (110), 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 114 [2024-10-11 20:07:32,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:32,471 INFO L225 Difference]: With dead ends: 380 [2024-10-11 20:07:32,471 INFO L226 Difference]: Without dead ends: 378 [2024-10-11 20:07:32,471 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:32,472 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 104 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:32,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 180 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:07:32,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-10-11 20:07:32,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 344. [2024-10-11 20:07:32,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 307 states have (on average 1.1530944625407167) internal successors, (354), 343 states have internal predecessors, (354), 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,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 354 transitions. [2024-10-11 20:07:32,481 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 354 transitions. Word has length 114 [2024-10-11 20:07:32,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:32,481 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 354 transitions. [2024-10-11 20:07:32,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 36.666666666666664) internal successors, (110), 4 states have internal predecessors, (110), 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,481 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 354 transitions. [2024-10-11 20:07:32,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 20:07:32,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:32,482 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, 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:32,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 20:07:32,483 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-10-11 20:07:32,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:32,483 INFO L85 PathProgramCache]: Analyzing trace with hash -495680657, now seen corresponding path program 1 times [2024-10-11 20:07:32,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:32,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512963727] [2024-10-11 20:07:32,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:32,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:32,592 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:32,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:32,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512963727] [2024-10-11 20:07:32,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512963727] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:07:32,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401212189] [2024-10-11 20:07:32,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:32,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:32,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:32,595 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:32,597 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:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:32,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:07:32,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:07:32,766 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:32,766 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:07:32,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401212189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:32,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:07:32,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-11 20:07:32,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732380894] [2024-10-11 20:07:32,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:32,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:07:32,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:32,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:07:32,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:07:32,769 INFO L87 Difference]: Start difference. First operand 344 states and 354 transitions. Second operand has 5 states, 4 states have (on average 29.0) internal successors, (116), 5 states have internal predecessors, (116), 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:33,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:33,191 INFO L93 Difference]: Finished difference Result 378 states and 389 transitions. [2024-10-11 20:07:33,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:07:33,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 29.0) internal successors, (116), 5 states have internal predecessors, (116), 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 120 [2024-10-11 20:07:33,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:33,193 INFO L225 Difference]: With dead ends: 378 [2024-10-11 20:07:33,194 INFO L226 Difference]: Without dead ends: 363 [2024-10-11 20:07:33,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 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:33,195 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 130 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:33,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 177 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 20:07:33,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-10-11 20:07:33,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 329. [2024-10-11 20:07:33,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 307 states have (on average 1.1042345276872965) internal successors, (339), 328 states have internal predecessors, (339), 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:33,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 339 transitions. [2024-10-11 20:07:33,206 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 339 transitions. Word has length 120 [2024-10-11 20:07:33,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:33,206 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 339 transitions. [2024-10-11 20:07:33,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 29.0) internal successors, (116), 5 states have internal predecessors, (116), 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:33,207 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 339 transitions. [2024-10-11 20:07:33,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 20:07:33,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:33,208 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:33,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 20:07:33,409 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,SelfDestructingSolverStorable17 [2024-10-11 20:07:33,410 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-10-11 20:07:33,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:33,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1101077058, now seen corresponding path program 1 times [2024-10-11 20:07:33,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:33,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641472188] [2024-10-11 20:07:33,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:33,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:33,492 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-10-11 20:07:33,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:33,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641472188] [2024-10-11 20:07:33,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641472188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:33,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:33,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:07:33,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368745646] [2024-10-11 20:07:33,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:33,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:07:33,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:33,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:07:33,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:33,494 INFO L87 Difference]: Start difference. First operand 329 states and 339 transitions. Second operand has 4 states, 3 states have (on average 34.666666666666664) internal successors, (104), 4 states have internal predecessors, (104), 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:33,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:33,718 INFO L93 Difference]: Finished difference Result 334 states and 345 transitions. [2024-10-11 20:07:33,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:07:33,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 34.666666666666664) internal successors, (104), 4 states have internal predecessors, (104), 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 145 [2024-10-11 20:07:33,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:33,720 INFO L225 Difference]: With dead ends: 334 [2024-10-11 20:07:33,720 INFO L226 Difference]: Without dead ends: 333 [2024-10-11 20:07:33,720 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:33,720 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 113 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:33,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 116 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:07:33,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-10-11 20:07:33,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 263. [2024-10-11 20:07:33,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 242 states have (on average 1.1239669421487604) internal successors, (272), 262 states have internal predecessors, (272), 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:33,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 272 transitions. [2024-10-11 20:07:33,729 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 272 transitions. Word has length 145 [2024-10-11 20:07:33,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:33,729 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 272 transitions. [2024-10-11 20:07:33,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 34.666666666666664) internal successors, (104), 4 states have internal predecessors, (104), 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:33,730 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 272 transitions. [2024-10-11 20:07:33,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-11 20:07:33,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:33,731 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, 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] [2024-10-11 20:07:33,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 20:07:33,731 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr107ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-10-11 20:07:33,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:33,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1682680066, now seen corresponding path program 1 times [2024-10-11 20:07:33,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:33,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296770363] [2024-10-11 20:07:33,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:33,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:33,815 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:07:33,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:33,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296770363] [2024-10-11 20:07:33,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296770363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:33,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:33,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:07:33,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937341682] [2024-10-11 20:07:33,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:33,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:07:33,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:33,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:07:33,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:33,818 INFO L87 Difference]: Start difference. First operand 263 states and 272 transitions. Second operand has 4 states, 3 states have (on average 46.666666666666664) internal successors, (140), 4 states have internal predecessors, (140), 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:34,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:34,042 INFO L93 Difference]: Finished difference Result 271 states and 281 transitions. [2024-10-11 20:07:34,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:07:34,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 46.666666666666664) internal successors, (140), 4 states have internal predecessors, (140), 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 149 [2024-10-11 20:07:34,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:34,043 INFO L225 Difference]: With dead ends: 271 [2024-10-11 20:07:34,044 INFO L226 Difference]: Without dead ends: 270 [2024-10-11 20:07:34,044 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:34,045 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 113 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:34,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 113 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:07:34,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-10-11 20:07:34,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 231. [2024-10-11 20:07:34,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 211 states have (on average 1.1374407582938388) internal successors, (240), 230 states have internal predecessors, (240), 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:34,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 240 transitions. [2024-10-11 20:07:34,055 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 240 transitions. Word has length 149 [2024-10-11 20:07:34,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:34,056 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 240 transitions. [2024-10-11 20:07:34,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 46.666666666666664) internal successors, (140), 4 states have internal predecessors, (140), 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:34,056 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 240 transitions. [2024-10-11 20:07:34,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 20:07:34,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:34,057 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 20:07:34,058 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr142ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-10-11 20:07:34,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:34,058 INFO L85 PathProgramCache]: Analyzing trace with hash 2146046024, now seen corresponding path program 1 times [2024-10-11 20:07:34,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:34,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243916137] [2024-10-11 20:07:34,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:34,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:34,188 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 20:07:34,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:34,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243916137] [2024-10-11 20:07:34,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243916137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:34,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:34,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:07:34,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527699820] [2024-10-11 20:07:34,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:34,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:07:34,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:34,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:07:34,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:07:34,190 INFO L87 Difference]: Start difference. First operand 231 states and 240 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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:34,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:34,214 INFO L93 Difference]: Finished difference Result 321 states and 334 transitions. [2024-10-11 20:07:34,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:07:34,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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 152 [2024-10-11 20:07:34,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:34,215 INFO L225 Difference]: With dead ends: 321 [2024-10-11 20:07:34,215 INFO L226 Difference]: Without dead ends: 221 [2024-10-11 20:07:34,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:07:34,216 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 64 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 168 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:34,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 168 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:34,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-10-11 20:07:34,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2024-10-11 20:07:34,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 203 states have (on average 1.1231527093596059) internal successors, (228), 220 states have internal predecessors, (228), 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:34,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 228 transitions. [2024-10-11 20:07:34,224 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 228 transitions. Word has length 152 [2024-10-11 20:07:34,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:34,224 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 228 transitions. [2024-10-11 20:07:34,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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:34,225 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 228 transitions. [2024-10-11 20:07:34,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 20:07:34,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:34,226 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 20:07:34,226 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr142ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-10-11 20:07:34,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:34,226 INFO L85 PathProgramCache]: Analyzing trace with hash -610672130, now seen corresponding path program 1 times [2024-10-11 20:07:34,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:34,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603402089] [2024-10-11 20:07:34,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:34,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:34,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:34,347 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 20:07:34,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:34,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603402089] [2024-10-11 20:07:34,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603402089] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:34,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:34,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:07:34,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686534264] [2024-10-11 20:07:34,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:34,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:07:34,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:34,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:07:34,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:34,350 INFO L87 Difference]: Start difference. First operand 221 states and 228 transitions. Second operand has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 4 states have internal predecessors, (146), 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:34,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:34,648 INFO L93 Difference]: Finished difference Result 317 states and 325 transitions. [2024-10-11 20:07:34,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:07:34,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 4 states have internal predecessors, (146), 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 152 [2024-10-11 20:07:34,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:34,650 INFO L225 Difference]: With dead ends: 317 [2024-10-11 20:07:34,650 INFO L226 Difference]: Without dead ends: 315 [2024-10-11 20:07:34,650 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:34,651 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 99 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:34,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 136 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:07:34,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-10-11 20:07:34,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 224. [2024-10-11 20:07:34,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 206 states have (on average 1.1213592233009708) internal successors, (231), 223 states have internal predecessors, (231), 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:34,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 231 transitions. [2024-10-11 20:07:34,658 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 231 transitions. Word has length 152 [2024-10-11 20:07:34,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:34,658 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 231 transitions. [2024-10-11 20:07:34,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 4 states have internal predecessors, (146), 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:34,659 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 231 transitions. [2024-10-11 20:07:34,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-11 20:07:34,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:34,660 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 20:07:34,661 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-10-11 20:07:34,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:34,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1419974766, now seen corresponding path program 1 times [2024-10-11 20:07:34,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:34,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211545304] [2024-10-11 20:07:34,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:34,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:34,792 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 20:07:34,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:34,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211545304] [2024-10-11 20:07:34,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211545304] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:07:34,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872607497] [2024-10-11 20:07:34,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:34,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:34,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:34,795 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:34,796 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:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:34,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:07:34,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:07:34,969 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 20:07:34,970 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:07:34,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872607497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:34,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:07:34,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-11 20:07:34,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172140158] [2024-10-11 20:07:34,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:34,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:07:34,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:34,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:07:34,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:07:34,971 INFO L87 Difference]: Start difference. First operand 224 states and 231 transitions. Second operand has 5 states, 4 states have (on average 38.0) internal successors, (152), 5 states have internal predecessors, (152), 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:35,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:35,330 INFO L93 Difference]: Finished difference Result 315 states and 323 transitions. [2024-10-11 20:07:35,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:07:35,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 38.0) internal successors, (152), 5 states have internal predecessors, (152), 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 158 [2024-10-11 20:07:35,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:35,332 INFO L225 Difference]: With dead ends: 315 [2024-10-11 20:07:35,332 INFO L226 Difference]: Without dead ends: 300 [2024-10-11 20:07:35,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 156 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:35,333 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 125 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:35,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 118 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:07:35,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-10-11 20:07:35,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 209. [2024-10-11 20:07:35,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 206 states have (on average 1.0485436893203883) internal successors, (216), 208 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:35,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 216 transitions. [2024-10-11 20:07:35,339 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 216 transitions. Word has length 158 [2024-10-11 20:07:35,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:35,340 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 216 transitions. [2024-10-11 20:07:35,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 38.0) internal successors, (152), 5 states have internal predecessors, (152), 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:35,340 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 216 transitions. [2024-10-11 20:07:35,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 20:07:35,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:35,341 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 20:07:35,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:35,546 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr144ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-10-11 20:07:35,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:35,546 INFO L85 PathProgramCache]: Analyzing trace with hash 26786190, now seen corresponding path program 1 times [2024-10-11 20:07:35,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:35,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332379915] [2024-10-11 20:07:35,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:35,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:35,698 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:07:35,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:35,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332379915] [2024-10-11 20:07:35,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332379915] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:07:35,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496684206] [2024-10-11 20:07:35,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:35,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:35,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:35,701 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:35,702 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:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:35,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:07:35,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:07:35,857 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:07:35,857 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:07:35,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496684206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:35,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:07:35,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-11 20:07:35,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585759045] [2024-10-11 20:07:35,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:35,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:07:35,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:35,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:07:35,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:07:35,860 INFO L87 Difference]: Start difference. First operand 209 states and 216 transitions. Second operand has 6 states, 5 states have (on average 32.4) internal successors, (162), 6 states have internal predecessors, (162), 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:36,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:36,204 INFO L93 Difference]: Finished difference Result 300 states and 308 transitions. [2024-10-11 20:07:36,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:07:36,205 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 32.4) internal successors, (162), 6 states have internal predecessors, (162), 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 170 [2024-10-11 20:07:36,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:36,206 INFO L225 Difference]: With dead ends: 300 [2024-10-11 20:07:36,206 INFO L226 Difference]: Without dead ends: 299 [2024-10-11 20:07:36,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 168 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:36,207 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 261 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:36,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 143 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:07:36,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-10-11 20:07:36,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 208. [2024-10-11 20:07:36,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 206 states have (on average 1.0436893203883495) internal successors, (215), 207 states have internal predecessors, (215), 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:36,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 215 transitions. [2024-10-11 20:07:36,214 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 215 transitions. Word has length 170 [2024-10-11 20:07:36,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:36,214 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 215 transitions. [2024-10-11 20:07:36,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 32.4) internal successors, (162), 6 states have internal predecessors, (162), 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:36,215 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 215 transitions. [2024-10-11 20:07:36,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 20:07:36,216 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:36,217 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,234 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:36,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-11 20:07:36,418 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr145ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-10-11 20:07:36,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:36,419 INFO L85 PathProgramCache]: Analyzing trace with hash 830372337, now seen corresponding path program 1 times [2024-10-11 20:07:36,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:36,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500882066] [2024-10-11 20:07:36,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:36,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:36,551 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:07:36,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:36,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500882066] [2024-10-11 20:07:36,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500882066] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:07:36,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399524075] [2024-10-11 20:07:36,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:36,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:36,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:36,554 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:36,556 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:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:36,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:07:36,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:07:36,738 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:07:36,738 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:07:36,796 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:07:36,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399524075] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:07:36,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:07:36,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-11 20:07:36,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723453827] [2024-10-11 20:07:36,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:07:36,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:07:36,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:36,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:07:36,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:07:36,799 INFO L87 Difference]: Start difference. First operand 208 states and 215 transitions. Second operand has 12 states, 11 states have (on average 16.90909090909091) internal successors, (186), 12 states have internal predecessors, (186), 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:37,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:37,249 INFO L93 Difference]: Finished difference Result 321 states and 334 transitions. [2024-10-11 20:07:37,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:07:37,249 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 16.90909090909091) internal successors, (186), 12 states have internal predecessors, (186), 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 171 [2024-10-11 20:07:37,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:37,251 INFO L225 Difference]: With dead ends: 321 [2024-10-11 20:07:37,251 INFO L226 Difference]: Without dead ends: 320 [2024-10-11 20:07:37,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 335 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:37,252 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 368 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:37,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 216 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 20:07:37,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-11 20:07:37,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 229. [2024-10-11 20:07:37,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 227 states have (on average 1.052863436123348) internal successors, (239), 228 states have internal predecessors, (239), 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:37,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 239 transitions. [2024-10-11 20:07:37,267 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 239 transitions. Word has length 171 [2024-10-11 20:07:37,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:37,267 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 239 transitions. [2024-10-11 20:07:37,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 16.90909090909091) internal successors, (186), 12 states have internal predecessors, (186), 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:37,268 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 239 transitions. [2024-10-11 20:07:37,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-11 20:07:37,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:37,269 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, 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, 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:37,287 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:37,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:37,470 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr143ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-10-11 20:07:37,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:37,471 INFO L85 PathProgramCache]: Analyzing trace with hash -997227838, now seen corresponding path program 1 times [2024-10-11 20:07:37,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:37,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863102662] [2024-10-11 20:07:37,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:37,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:37,557 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:07:37,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:37,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863102662] [2024-10-11 20:07:37,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863102662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:37,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:37,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:07:37,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279219903] [2024-10-11 20:07:37,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:37,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:07:37,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:37,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:07:37,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:37,560 INFO L87 Difference]: Start difference. First operand 229 states and 239 transitions. Second operand has 4 states, 3 states have (on average 58.666666666666664) internal successors, (176), 4 states have internal predecessors, (176), 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:37,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:37,750 INFO L93 Difference]: Finished difference Result 240 states and 251 transitions. [2024-10-11 20:07:37,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:07:37,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 58.666666666666664) internal successors, (176), 4 states have internal predecessors, (176), 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 187 [2024-10-11 20:07:37,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:37,752 INFO L225 Difference]: With dead ends: 240 [2024-10-11 20:07:37,752 INFO L226 Difference]: Without dead ends: 239 [2024-10-11 20:07:37,752 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:37,753 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 108 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:37,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 97 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:07:37,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-10-11 20:07:37,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 197. [2024-10-11 20:07:37,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.0561224489795917) internal successors, (207), 196 states have internal predecessors, (207), 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:37,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 207 transitions. [2024-10-11 20:07:37,760 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 207 transitions. Word has length 187 [2024-10-11 20:07:37,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:37,761 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 207 transitions. [2024-10-11 20:07:37,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 58.666666666666664) internal successors, (176), 4 states have internal predecessors, (176), 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:37,761 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 207 transitions. [2024-10-11 20:07:37,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-11 20:07:37,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:37,762 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 20:07:37,762 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr145ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 143 more)] === [2024-10-11 20:07:37,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:37,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1988656788, now seen corresponding path program 2 times [2024-10-11 20:07:37,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:37,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933496083] [2024-10-11 20:07:37,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:37,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:38,077 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:07:38,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:38,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933496083] [2024-10-11 20:07:38,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933496083] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:07:38,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279389026] [2024-10-11 20:07:38,078 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:07:38,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:38,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:38,080 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:07:38,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 20:07:38,187 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 20:07:38,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:07:38,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:07:38,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:07:38,431 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-11 20:07:38,431 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:07:38,632 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-11 20:07:38,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279389026] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:07:38,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:07:38,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 3, 3] total 14 [2024-10-11 20:07:38,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936088661] [2024-10-11 20:07:38,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:07:38,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 20:07:38,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:38,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 20:07:38,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-10-11 20:07:38,635 INFO L87 Difference]: Start difference. First operand 197 states and 207 transitions. Second operand has 15 states, 14 states have (on average 24.785714285714285) internal successors, (347), 15 states have internal predecessors, (347), 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:39,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:39,283 INFO L93 Difference]: Finished difference Result 325 states and 338 transitions. [2024-10-11 20:07:39,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 20:07:39,284 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 24.785714285714285) internal successors, (347), 15 states have internal predecessors, (347), 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 192 [2024-10-11 20:07:39,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:39,284 INFO L225 Difference]: With dead ends: 325 [2024-10-11 20:07:39,284 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:07:39,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 380 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2024-10-11 20:07:39,285 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 272 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 1360 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:39,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 160 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1360 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 20:07:39,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:07:39,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:07:39,286 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:39,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:07:39,286 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 192 [2024-10-11 20:07:39,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:39,286 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:07:39,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 24.785714285714285) internal successors, (347), 15 states have internal predecessors, (347), 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:39,286 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:07:39,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:07:39,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (145 of 146 remaining) [2024-10-11 20:07:39,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (144 of 146 remaining) [2024-10-11 20:07:39,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (143 of 146 remaining) [2024-10-11 20:07:39,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (142 of 146 remaining) [2024-10-11 20:07:39,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (141 of 146 remaining) [2024-10-11 20:07:39,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (140 of 146 remaining) [2024-10-11 20:07:39,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (139 of 146 remaining) [2024-10-11 20:07:39,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (138 of 146 remaining) [2024-10-11 20:07:39,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (137 of 146 remaining) [2024-10-11 20:07:39,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (136 of 146 remaining) [2024-10-11 20:07:39,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (135 of 146 remaining) [2024-10-11 20:07:39,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (134 of 146 remaining) [2024-10-11 20:07:39,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (133 of 146 remaining) [2024-10-11 20:07:39,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (132 of 146 remaining) [2024-10-11 20:07:39,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (131 of 146 remaining) [2024-10-11 20:07:39,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (130 of 146 remaining) [2024-10-11 20:07:39,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (129 of 146 remaining) [2024-10-11 20:07:39,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (128 of 146 remaining) [2024-10-11 20:07:39,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (127 of 146 remaining) [2024-10-11 20:07:39,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (126 of 146 remaining) [2024-10-11 20:07:39,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (125 of 146 remaining) [2024-10-11 20:07:39,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (124 of 146 remaining) [2024-10-11 20:07:39,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (123 of 146 remaining) [2024-10-11 20:07:39,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (122 of 146 remaining) [2024-10-11 20:07:39,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (121 of 146 remaining) [2024-10-11 20:07:39,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (120 of 146 remaining) [2024-10-11 20:07:39,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (119 of 146 remaining) [2024-10-11 20:07:39,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (118 of 146 remaining) [2024-10-11 20:07:39,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (117 of 146 remaining) [2024-10-11 20:07:39,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (116 of 146 remaining) [2024-10-11 20:07:39,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (115 of 146 remaining) [2024-10-11 20:07:39,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (114 of 146 remaining) [2024-10-11 20:07:39,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (113 of 146 remaining) [2024-10-11 20:07:39,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (112 of 146 remaining) [2024-10-11 20:07:39,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (111 of 146 remaining) [2024-10-11 20:07:39,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (110 of 146 remaining) [2024-10-11 20:07:39,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (109 of 146 remaining) [2024-10-11 20:07:39,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (108 of 146 remaining) [2024-10-11 20:07:39,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (107 of 146 remaining) [2024-10-11 20:07:39,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (106 of 146 remaining) [2024-10-11 20:07:39,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (105 of 146 remaining) [2024-10-11 20:07:39,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (104 of 146 remaining) [2024-10-11 20:07:39,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 146 remaining) [2024-10-11 20:07:39,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 146 remaining) [2024-10-11 20:07:39,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 146 remaining) [2024-10-11 20:07:39,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 146 remaining) [2024-10-11 20:07:39,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 146 remaining) [2024-10-11 20:07:39,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 146 remaining) [2024-10-11 20:07:39,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 146 remaining) [2024-10-11 20:07:39,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 146 remaining) [2024-10-11 20:07:39,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 146 remaining) [2024-10-11 20:07:39,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 146 remaining) [2024-10-11 20:07:39,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 146 remaining) [2024-10-11 20:07:39,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 146 remaining) [2024-10-11 20:07:39,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 146 remaining) [2024-10-11 20:07:39,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 146 remaining) [2024-10-11 20:07:39,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 146 remaining) [2024-10-11 20:07:39,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 146 remaining) [2024-10-11 20:07:39,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 146 remaining) [2024-10-11 20:07:39,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 146 remaining) [2024-10-11 20:07:39,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 146 remaining) [2024-10-11 20:07:39,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 146 remaining) [2024-10-11 20:07:39,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 146 remaining) [2024-10-11 20:07:39,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 146 remaining) [2024-10-11 20:07:39,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 146 remaining) [2024-10-11 20:07:39,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 146 remaining) [2024-10-11 20:07:39,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 146 remaining) [2024-10-11 20:07:39,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 146 remaining) [2024-10-11 20:07:39,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 146 remaining) [2024-10-11 20:07:39,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 146 remaining) [2024-10-11 20:07:39,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 146 remaining) [2024-10-11 20:07:39,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 146 remaining) [2024-10-11 20:07:39,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 146 remaining) [2024-10-11 20:07:39,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 146 remaining) [2024-10-11 20:07:39,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 146 remaining) [2024-10-11 20:07:39,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 146 remaining) [2024-10-11 20:07:39,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 146 remaining) [2024-10-11 20:07:39,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 146 remaining) [2024-10-11 20:07:39,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 146 remaining) [2024-10-11 20:07:39,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 146 remaining) [2024-10-11 20:07:39,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 146 remaining) [2024-10-11 20:07:39,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 146 remaining) [2024-10-11 20:07:39,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 146 remaining) [2024-10-11 20:07:39,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 146 remaining) [2024-10-11 20:07:39,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 146 remaining) [2024-10-11 20:07:39,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 146 remaining) [2024-10-11 20:07:39,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 146 remaining) [2024-10-11 20:07:39,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 146 remaining) [2024-10-11 20:07:39,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 146 remaining) [2024-10-11 20:07:39,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 146 remaining) [2024-10-11 20:07:39,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 146 remaining) [2024-10-11 20:07:39,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 146 remaining) [2024-10-11 20:07:39,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 146 remaining) [2024-10-11 20:07:39,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 146 remaining) [2024-10-11 20:07:39,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 146 remaining) [2024-10-11 20:07:39,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 146 remaining) [2024-10-11 20:07:39,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 146 remaining) [2024-10-11 20:07:39,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 146 remaining) [2024-10-11 20:07:39,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 146 remaining) [2024-10-11 20:07:39,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr99ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 146 remaining) [2024-10-11 20:07:39,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 146 remaining) [2024-10-11 20:07:39,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 146 remaining) [2024-10-11 20:07:39,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr102ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 146 remaining) [2024-10-11 20:07:39,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr103ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 146 remaining) [2024-10-11 20:07:39,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr104ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 146 remaining) [2024-10-11 20:07:39,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr105ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 146 remaining) [2024-10-11 20:07:39,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 146 remaining) [2024-10-11 20:07:39,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr107ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 146 remaining) [2024-10-11 20:07:39,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr108ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 146 remaining) [2024-10-11 20:07:39,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr109ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 146 remaining) [2024-10-11 20:07:39,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 146 remaining) [2024-10-11 20:07:39,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 146 remaining) [2024-10-11 20:07:39,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr112ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 146 remaining) [2024-10-11 20:07:39,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr113ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 146 remaining) [2024-10-11 20:07:39,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 146 remaining) [2024-10-11 20:07:39,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 146 remaining) [2024-10-11 20:07:39,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 146 remaining) [2024-10-11 20:07:39,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 146 remaining) [2024-10-11 20:07:39,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 146 remaining) [2024-10-11 20:07:39,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 146 remaining) [2024-10-11 20:07:39,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr120ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 146 remaining) [2024-10-11 20:07:39,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr121ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 146 remaining) [2024-10-11 20:07:39,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr122ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 146 remaining) [2024-10-11 20:07:39,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr123ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 146 remaining) [2024-10-11 20:07:39,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr124ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 146 remaining) [2024-10-11 20:07:39,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr125ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 146 remaining) [2024-10-11 20:07:39,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr126ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 146 remaining) [2024-10-11 20:07:39,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr127ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 146 remaining) [2024-10-11 20:07:39,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr128ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 146 remaining) [2024-10-11 20:07:39,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr129ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 146 remaining) [2024-10-11 20:07:39,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 146 remaining) [2024-10-11 20:07:39,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr131ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 146 remaining) [2024-10-11 20:07:39,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr132ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 146 remaining) [2024-10-11 20:07:39,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr133ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 146 remaining) [2024-10-11 20:07:39,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr134ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 146 remaining) [2024-10-11 20:07:39,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr135ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 146 remaining) [2024-10-11 20:07:39,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr136ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 146 remaining) [2024-10-11 20:07:39,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 146 remaining) [2024-10-11 20:07:39,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr138ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 146 remaining) [2024-10-11 20:07:39,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 146 remaining) [2024-10-11 20:07:39,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr140ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 146 remaining) [2024-10-11 20:07:39,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr141ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 146 remaining) [2024-10-11 20:07:39,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr142ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 146 remaining) [2024-10-11 20:07:39,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr143ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 146 remaining) [2024-10-11 20:07:39,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr144ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 146 remaining) [2024-10-11 20:07:39,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr145ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 146 remaining) [2024-10-11 20:07:39,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 20:07:39,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-11 20:07:39,516 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, 1, 1, 1, 1, 1] [2024-10-11 20:07:39,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:07:39,817 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:07:39,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:07:39 BoogieIcfgContainer [2024-10-11 20:07:39,841 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:07:39,842 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:07:39,842 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:07:39,842 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:07:39,842 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:21" (3/4) ... [2024-10-11 20:07:39,844 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:07:39,857 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2024-10-11 20:07:39,857 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-11 20:07:39,858 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-11 20:07:39,858 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:07:39,859 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:07:39,982 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:07:39,983 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:07:39,983 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:07:39,983 INFO L158 Benchmark]: Toolchain (without parser) took 20318.40ms. Allocated memory was 157.3MB in the beginning and 302.0MB in the end (delta: 144.7MB). Free memory was 86.9MB in the beginning and 188.7MB in the end (delta: -101.8MB). Peak memory consumption was 44.9MB. Max. memory is 16.1GB. [2024-10-11 20:07:39,984 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 121.6MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:07:39,984 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.19ms. Allocated memory is still 157.3MB. Free memory was 86.9MB in the beginning and 72.7MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 20:07:39,984 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.62ms. Allocated memory is still 157.3MB. Free memory was 72.7MB in the beginning and 69.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 20:07:39,984 INFO L158 Benchmark]: Boogie Preprocessor took 61.87ms. Allocated memory is still 157.3MB. Free memory was 69.7MB in the beginning and 66.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:07:39,984 INFO L158 Benchmark]: RCFGBuilder took 929.83ms. Allocated memory is still 157.3MB. Free memory was 66.8MB in the beginning and 102.6MB in the end (delta: -35.8MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2024-10-11 20:07:39,985 INFO L158 Benchmark]: TraceAbstraction took 18772.95ms. Allocated memory was 157.3MB in the beginning and 302.0MB in the end (delta: 144.7MB). Free memory was 101.9MB in the beginning and 197.1MB in the end (delta: -95.2MB). Peak memory consumption was 51.6MB. Max. memory is 16.1GB. [2024-10-11 20:07:39,985 INFO L158 Benchmark]: Witness Printer took 141.16ms. Allocated memory is still 302.0MB. Free memory was 197.1MB in the beginning and 188.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 20:07:39,986 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 121.6MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.19ms. Allocated memory is still 157.3MB. Free memory was 86.9MB in the beginning and 72.7MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.62ms. Allocated memory is still 157.3MB. Free memory was 72.7MB in the beginning and 69.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.87ms. Allocated memory is still 157.3MB. Free memory was 69.7MB in the beginning and 66.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 929.83ms. Allocated memory is still 157.3MB. Free memory was 66.8MB in the beginning and 102.6MB in the end (delta: -35.8MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. * TraceAbstraction took 18772.95ms. Allocated memory was 157.3MB in the beginning and 302.0MB in the end (delta: 144.7MB). Free memory was 101.9MB in the beginning and 197.1MB in the end (delta: -95.2MB). Peak memory consumption was 51.6MB. Max. memory is 16.1GB. * Witness Printer took 141.16ms. Allocated memory is still 302.0MB. Free memory was 197.1MB in the beginning and 188.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: 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: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: 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: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: 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: 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: 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: 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: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: 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: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: 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 - 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 - 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 - 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 - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: 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, 318 locations, 146 error locations. Started 1 CEGAR loops. OverallTime: 18.4s, OverallIterations: 27, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5783 SdHoareTripleChecker+Valid, 8.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5783 mSDsluCounter, 6048 SdHoareTripleChecker+Invalid, 6.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2737 mSDsCounter, 419 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12274 IncrementalHoareTripleChecker+Invalid, 12693 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 419 mSolverCounterUnsat, 3311 mSDtfsCounter, 12274 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1887 GetRequests, 1767 SyntacticMatches, 4 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=459occurred in iteration=7, InterpolantAutomatonStates: 137, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 27 MinimizatonAttempts, 679 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 3756 NumberOfCodeBlocks, 3490 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 4318 ConstructedInterpolants, 0 QuantifiedInterpolants, 10635 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2050 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 42 InterpolantComputations, 22 PerfectInterpolantSequences, 921/1152 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 146 specifications checked. All of them hold - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: (((((((((CCCELVOL3 == 7) && (2 <= CELLCOUNT)) && (i == 1)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (CCCELVOL2 == 3)) && (CELLCOUNT == (((CELLCOUNT >= 0) ? (CELLCOUNT / 4) : ((CELLCOUNT / 4) - 1)) * 4))) || ((((((((CCCELVOL3 == 7) && (2 <= CELLCOUNT)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (CCCELVOL2 == 3)) && (2 <= i)) && (CELLCOUNT == (((CELLCOUNT >= 0) ? (CELLCOUNT / 4) : ((CELLCOUNT / 4) - 1)) * 4)))) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: (((((((((CCCELVOL3 == 7) && (2 <= CELLCOUNT)) && (i == 1)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (CCCELVOL2 == 3)) && (CELLCOUNT == (((CELLCOUNT >= 0) ? (CELLCOUNT / 4) : ((CELLCOUNT / 4) - 1)) * 4))) || ((((((((CCCELVOL3 == 7) && (2 <= CELLCOUNT)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (CCCELVOL2 == 3)) && (2 <= i)) && (CELLCOUNT == (((CELLCOUNT >= 0) ? (CELLCOUNT / 4) : ((CELLCOUNT / 4) - 1)) * 4)))) - InvariantResult [Line: 89]: Loop Invariant Derived loop invariant: (((((((((CCCELVOL3 == 7) && (i == 0)) && (2 <= CELLCOUNT)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (CCCELVOL2 == 3)) && (CELLCOUNT == (((CELLCOUNT >= 0) ? (CELLCOUNT / 4) : ((CELLCOUNT / 4) - 1)) * 4))) || ((((((((CCCELVOL3 == 7) && (1 <= i)) && (2 <= CELLCOUNT)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (CCCELVOL2 == 3)) && (CELLCOUNT == (((CELLCOUNT >= 0) ? (CELLCOUNT / 4) : ((CELLCOUNT / 4) - 1)) * 4)))) - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: (((((((((CCCELVOL3 == 7) && (2 <= CELLCOUNT)) && (i == 1)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (CCCELVOL2 == 3)) && (CELLCOUNT == (((CELLCOUNT >= 0) ? (CELLCOUNT / 4) : ((CELLCOUNT / 4) - 1)) * 4))) || ((((((((CCCELVOL3 == 7) && (2 <= CELLCOUNT)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (CCCELVOL2 == 3)) && (2 <= i)) && (CELLCOUNT == (((CELLCOUNT >= 0) ? (CELLCOUNT / 4) : ((CELLCOUNT / 4) - 1)) * 4)))) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((CCCELVOL3 == 7) && (2 <= CELLCOUNT)) && (i == 1)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (CCCELVOL2 == 3)) && (CELLCOUNT == (((CELLCOUNT >= 0) ? (CELLCOUNT / 4) : ((CELLCOUNT / 4) - 1)) * 4))) || ((((((((CCCELVOL3 == 7) && (2 <= CELLCOUNT)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (CCCELVOL2 == 3)) && (2 <= i)) && (CELLCOUNT == (((CELLCOUNT >= 0) ? (CELLCOUNT / 4) : ((CELLCOUNT / 4) - 1)) * 4)))) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:07:40,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE