./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-multidimensional/max-3-n-u.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-multidimensional/max-3-n-u.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 6c8d330fcf7e017e6b51632eb7a9f8f167fb4f3e932700b6ef82da7b1572a2f0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:08:30,247 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:08:30,315 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:08:30,321 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:08:30,322 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:08:30,366 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:08:30,367 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:08:30,367 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:08:30,369 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:08:30,369 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:08:30,370 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:08:30,371 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:08:30,371 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:08:30,371 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:08:30,374 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:08:30,374 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:08:30,374 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:08:30,375 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:08:30,375 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:08:30,375 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:08:30,375 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:08:30,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:08:30,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:08:30,380 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:08:30,380 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:08:30,380 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:08:30,380 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:08:30,381 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:08:30,381 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:08:30,381 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:08:30,382 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:08:30,382 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:08:30,382 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:08:30,382 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:08:30,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:08:30,383 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:08:30,383 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:08:30,383 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:08:30,384 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:08:30,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:08:30,384 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:08:30,385 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:08:30,385 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:08:30,385 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:08:30,386 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 -> 6c8d330fcf7e017e6b51632eb7a9f8f167fb4f3e932700b6ef82da7b1572a2f0 [2024-10-11 20:08:30,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:08:30,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:08:30,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:08:30,714 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:08:30,714 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:08:30,716 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/max-3-n-u.c [2024-10-11 20:08:32,220 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:08:32,404 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:08:32,405 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/max-3-n-u.c [2024-10-11 20:08:32,415 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/96ff6b2d8/d56d05177c144f4d95fc42c06532e67d/FLAGea82c6066 [2024-10-11 20:08:32,795 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/96ff6b2d8/d56d05177c144f4d95fc42c06532e67d [2024-10-11 20:08:32,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:08:32,799 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:08:32,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:08:32,802 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:08:32,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:08:32,809 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:08:32" (1/1) ... [2024-10-11 20:08:32,810 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12eb6f5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:08:32, skipping insertion in model container [2024-10-11 20:08:32,810 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:08:32" (1/1) ... [2024-10-11 20:08:32,836 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:08:33,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:08:33,062 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:08:33,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:08:33,116 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:08:33,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:08:33 WrapperNode [2024-10-11 20:08:33,117 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:08:33,118 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:08:33,118 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:08:33,119 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:08:33,126 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:08:33" (1/1) ... [2024-10-11 20:08:33,135 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:08:33" (1/1) ... [2024-10-11 20:08:33,159 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 128 [2024-10-11 20:08:33,160 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:08:33,160 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:08:33,161 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:08:33,161 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:08:33,173 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:08:33" (1/1) ... [2024-10-11 20:08:33,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:08:33" (1/1) ... [2024-10-11 20:08:33,180 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:08:33" (1/1) ... [2024-10-11 20:08:33,202 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-10-11 20:08:33,202 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:08:33" (1/1) ... [2024-10-11 20:08:33,202 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:08:33" (1/1) ... [2024-10-11 20:08:33,208 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:08:33" (1/1) ... [2024-10-11 20:08:33,217 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:08:33" (1/1) ... [2024-10-11 20:08:33,218 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:08:33" (1/1) ... [2024-10-11 20:08:33,221 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:08:33" (1/1) ... [2024-10-11 20:08:33,225 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:08:33,228 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:08:33,228 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:08:33,228 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:08:33,229 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:08:33" (1/1) ... [2024-10-11 20:08:33,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:08:33,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:08:33,271 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:08:33,279 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:08:33,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:08:33,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:08:33,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 20:08:33,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 20:08:33,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 20:08:33,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 20:08:33,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:08:33,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:08:33,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 20:08:33,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 20:08:33,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 20:08:33,418 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:08:33,420 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:08:33,671 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-10-11 20:08:33,672 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:08:33,701 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:08:33,701 INFO L314 CfgBuilder]: Removed 9 assume(true) statements. [2024-10-11 20:08:33,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:08:33 BoogieIcfgContainer [2024-10-11 20:08:33,702 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:08:33,704 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:08:33,705 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:08:33,710 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:08:33,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:08:32" (1/3) ... [2024-10-11 20:08:33,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d646fe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:08:33, skipping insertion in model container [2024-10-11 20:08:33,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:08:33" (2/3) ... [2024-10-11 20:08:33,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d646fe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:08:33, skipping insertion in model container [2024-10-11 20:08:33,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:08:33" (3/3) ... [2024-10-11 20:08:33,714 INFO L112 eAbstractionObserver]: Analyzing ICFG max-3-n-u.c [2024-10-11 20:08:33,734 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:08:33,736 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2024-10-11 20:08:33,804 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:08:33,811 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;@6a24cf8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:08:33,811 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2024-10-11 20:08:33,816 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 52 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:08:33,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 20:08:33,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:08:33,822 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 20:08:33,823 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-10-11 20:08:33,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:08:33,828 INFO L85 PathProgramCache]: Analyzing trace with hash 6148119, now seen corresponding path program 1 times [2024-10-11 20:08:33,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:08:33,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957424255] [2024-10-11 20:08:33,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:33,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:08:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:34,073 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:08:34,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:08:34,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957424255] [2024-10-11 20:08:34,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957424255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:08:34,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:08:34,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:08:34,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713046419] [2024-10-11 20:08:34,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:08:34,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:08:34,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:08:34,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:08:34,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:08:34,105 INFO L87 Difference]: Start difference. First operand has 53 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 52 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:08:34,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:08:34,238 INFO L93 Difference]: Finished difference Result 132 states and 190 transitions. [2024-10-11 20:08:34,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:08:34,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 20:08:34,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:08:34,250 INFO L225 Difference]: With dead ends: 132 [2024-10-11 20:08:34,250 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 20:08:34,253 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:08:34,256 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 118 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:08:34,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 79 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:08:34,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 20:08:34,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2024-10-11 20:08:34,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 54 states have (on average 1.6851851851851851) internal successors, (91), 71 states have internal predecessors, (91), 0 states have call successors, (0), 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:08:34,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2024-10-11 20:08:34,298 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 91 transitions. Word has length 4 [2024-10-11 20:08:34,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:08:34,298 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 91 transitions. [2024-10-11 20:08:34,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:08:34,299 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2024-10-11 20:08:34,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 20:08:34,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:08:34,299 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 20:08:34,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:08:34,300 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-10-11 20:08:34,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:08:34,301 INFO L85 PathProgramCache]: Analyzing trace with hash 190593176, now seen corresponding path program 1 times [2024-10-11 20:08:34,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:08:34,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098806558] [2024-10-11 20:08:34,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:34,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:08:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:34,448 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:08:34,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:08:34,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098806558] [2024-10-11 20:08:34,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098806558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:08:34,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:08:34,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:08:34,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183363429] [2024-10-11 20:08:34,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:08:34,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:08:34,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:08:34,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:08:34,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:08:34,454 INFO L87 Difference]: Start difference. First operand 72 states and 91 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:08:34,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:08:34,564 INFO L93 Difference]: Finished difference Result 102 states and 135 transitions. [2024-10-11 20:08:34,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:08:34,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2024-10-11 20:08:34,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:08:34,566 INFO L225 Difference]: With dead ends: 102 [2024-10-11 20:08:34,566 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 20:08:34,567 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:08:34,568 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 9 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:08:34,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 83 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:08:34,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 20:08:34,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-11 20:08:34,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 78 states have (on average 1.5769230769230769) internal successors, (123), 95 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:08:34,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 123 transitions. [2024-10-11 20:08:34,582 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 123 transitions. Word has length 5 [2024-10-11 20:08:34,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:08:34,582 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 123 transitions. [2024-10-11 20:08:34,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:08:34,583 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 123 transitions. [2024-10-11 20:08:34,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 20:08:34,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:08:34,583 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:08:34,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:08:34,584 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-10-11 20:08:34,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:08:34,585 INFO L85 PathProgramCache]: Analyzing trace with hash 12971232, now seen corresponding path program 1 times [2024-10-11 20:08:34,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:08:34,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922163851] [2024-10-11 20:08:34,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:34,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:08:34,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:34,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:08:34,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:08:34,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922163851] [2024-10-11 20:08:34,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922163851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:08:34,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:08:34,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:08:34,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713841592] [2024-10-11 20:08:34,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:08:34,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:08:34,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:08:34,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:08:34,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:08:34,695 INFO L87 Difference]: Start difference. First operand 96 states and 123 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:08:34,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:08:34,779 INFO L93 Difference]: Finished difference Result 191 states and 245 transitions. [2024-10-11 20:08:34,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:08:34,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 20:08:34,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:08:34,782 INFO L225 Difference]: With dead ends: 191 [2024-10-11 20:08:34,782 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 20:08:34,783 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:08:34,785 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 68 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:08:34,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 83 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:08:34,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 20:08:34,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-11 20:08:34,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 78 states have (on average 1.5) internal successors, (117), 95 states have internal predecessors, (117), 0 states have call successors, (0), 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:08:34,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 117 transitions. [2024-10-11 20:08:34,797 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 117 transitions. Word has length 8 [2024-10-11 20:08:34,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:08:34,798 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 117 transitions. [2024-10-11 20:08:34,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:08:34,798 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2024-10-11 20:08:34,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 20:08:34,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:08:34,799 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-11 20:08:34,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:08:34,799 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-10-11 20:08:34,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:08:34,800 INFO L85 PathProgramCache]: Analyzing trace with hash 14603337, now seen corresponding path program 1 times [2024-10-11 20:08:34,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:08:34,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998046163] [2024-10-11 20:08:34,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:34,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:08:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:34,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:08:34,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:08:34,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998046163] [2024-10-11 20:08:34,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998046163] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:08:34,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470356492] [2024-10-11 20:08:34,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:34,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:08:34,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:08:34,902 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:08:34,904 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:08:34,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:34,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:08:34,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:08:35,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:08:35,016 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:08:35,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470356492] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:08:35,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:08:35,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-10-11 20:08:35,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413302555] [2024-10-11 20:08:35,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:08:35,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:08:35,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:08:35,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:08:35,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:08:35,018 INFO L87 Difference]: Start difference. First operand 96 states and 117 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:08:35,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:08:35,097 INFO L93 Difference]: Finished difference Result 96 states and 117 transitions. [2024-10-11 20:08:35,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:08:35,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 20:08:35,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:08:35,101 INFO L225 Difference]: With dead ends: 96 [2024-10-11 20:08:35,101 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 20:08:35,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:08:35,103 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 17 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:08:35,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 80 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:08:35,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 20:08:35,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-11 20:08:35,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 92 states have internal predecessors, (111), 0 states have call successors, (0), 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:08:35,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2024-10-11 20:08:35,126 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 8 [2024-10-11 20:08:35,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:08:35,127 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2024-10-11 20:08:35,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:08:35,127 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2024-10-11 20:08:35,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 20:08:35,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:08:35,128 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2024-10-11 20:08:35,148 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:08:35,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:08:35,329 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-10-11 20:08:35,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:08:35,330 INFO L85 PathProgramCache]: Analyzing trace with hash 452703510, now seen corresponding path program 1 times [2024-10-11 20:08:35,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:08:35,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853328152] [2024-10-11 20:08:35,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:35,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:08:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:35,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:08:35,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:08:35,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853328152] [2024-10-11 20:08:35,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853328152] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:08:35,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42369687] [2024-10-11 20:08:35,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:35,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:08:35,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:08:35,400 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:08:35,403 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:08:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:35,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:08:35,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:08:35,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:08:35,472 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:08:35,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:08:35,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42369687] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:08:35,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:08:35,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-11 20:08:35,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001546451] [2024-10-11 20:08:35,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:08:35,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:08:35,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:08:35,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:08:35,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:08:35,506 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:08:35,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:08:35,634 INFO L93 Difference]: Finished difference Result 168 states and 225 transitions. [2024-10-11 20:08:35,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:08:35,635 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 20:08:35,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:08:35,638 INFO L225 Difference]: With dead ends: 168 [2024-10-11 20:08:35,638 INFO L226 Difference]: Without dead ends: 165 [2024-10-11 20:08:35,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:08:35,641 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 56 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:08:35,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 123 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:08:35,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-11 20:08:35,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2024-10-11 20:08:35,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 150 states have (on average 1.38) internal successors, (207), 164 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:08:35,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 207 transitions. [2024-10-11 20:08:35,674 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 207 transitions. Word has length 9 [2024-10-11 20:08:35,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:08:35,674 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 207 transitions. [2024-10-11 20:08:35,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:08:35,675 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 207 transitions. [2024-10-11 20:08:35,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 20:08:35,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:08:35,675 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:08:35,693 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:08:35,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:08:35,877 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-10-11 20:08:35,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:08:35,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1254745999, now seen corresponding path program 1 times [2024-10-11 20:08:35,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:08:35,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124510219] [2024-10-11 20:08:35,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:35,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:08:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:35,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 20:08:35,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:08:35,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124510219] [2024-10-11 20:08:35,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124510219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:08:35,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:08:35,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 20:08:35,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279872468] [2024-10-11 20:08:35,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:08:35,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:08:35,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:08:35,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:08:35,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:08:35,934 INFO L87 Difference]: Start difference. First operand 165 states and 207 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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:08:36,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:08:36,002 INFO L93 Difference]: Finished difference Result 327 states and 411 transitions. [2024-10-11 20:08:36,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:08:36,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-10-11 20:08:36,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:08:36,004 INFO L225 Difference]: With dead ends: 327 [2024-10-11 20:08:36,005 INFO L226 Difference]: Without dead ends: 321 [2024-10-11 20:08:36,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:08:36,007 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 34 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:08:36,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 74 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:08:36,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-10-11 20:08:36,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 312. [2024-10-11 20:08:36,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 297 states have (on average 1.3636363636363635) internal successors, (405), 311 states have internal predecessors, (405), 0 states have call successors, (0), 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:08:36,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 405 transitions. [2024-10-11 20:08:36,043 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 405 transitions. Word has length 11 [2024-10-11 20:08:36,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:08:36,044 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 405 transitions. [2024-10-11 20:08:36,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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:08:36,044 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 405 transitions. [2024-10-11 20:08:36,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 20:08:36,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:08:36,045 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-11 20:08:36,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 20:08:36,045 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-10-11 20:08:36,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:08:36,046 INFO L85 PathProgramCache]: Analyzing trace with hash -2147324022, now seen corresponding path program 1 times [2024-10-11 20:08:36,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:08:36,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991863118] [2024-10-11 20:08:36,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:36,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:08:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:36,094 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 20:08:36,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:08:36,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991863118] [2024-10-11 20:08:36,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991863118] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:08:36,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654194195] [2024-10-11 20:08:36,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:36,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:08:36,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:08:36,098 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:08:36,100 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:08:36,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:36,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:08:36,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:08:36,203 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 20:08:36,203 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:08:36,251 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 20:08:36,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654194195] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:08:36,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:08:36,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2024-10-11 20:08:36,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263876746] [2024-10-11 20:08:36,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:08:36,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 20:08:36,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:08:36,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 20:08:36,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:08:36,253 INFO L87 Difference]: Start difference. First operand 312 states and 405 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:08:36,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:08:36,685 INFO L93 Difference]: Finished difference Result 606 states and 786 transitions. [2024-10-11 20:08:36,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 20:08:36,686 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 20:08:36,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:08:36,688 INFO L225 Difference]: With dead ends: 606 [2024-10-11 20:08:36,689 INFO L226 Difference]: Without dead ends: 312 [2024-10-11 20:08:36,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-10-11 20:08:36,693 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 347 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:08:36,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 138 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:08:36,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-10-11 20:08:36,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 309. [2024-10-11 20:08:36,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 297 states have (on average 1.2222222222222223) internal successors, (363), 308 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:08:36,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 363 transitions. [2024-10-11 20:08:36,723 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 363 transitions. Word has length 15 [2024-10-11 20:08:36,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:08:36,724 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 363 transitions. [2024-10-11 20:08:36,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:08:36,724 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 363 transitions. [2024-10-11 20:08:36,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 20:08:36,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:08:36,726 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2024-10-11 20:08:36,743 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:08:36,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:08:36,927 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-10-11 20:08:36,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:08:36,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1408011751, now seen corresponding path program 2 times [2024-10-11 20:08:36,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:08:36,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486810654] [2024-10-11 20:08:36,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:36,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:08:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:36,994 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 20:08:36,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:08:36,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486810654] [2024-10-11 20:08:36,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486810654] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:08:36,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036065745] [2024-10-11 20:08:36,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:08:36,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:08:36,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:08:36,997 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:08:36,999 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:08:37,058 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 20:08:37,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:08:37,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:08:37,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:08:37,094 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 20:08:37,095 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:08:37,137 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 20:08:37,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036065745] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:08:37,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:08:37,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2024-10-11 20:08:37,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865376843] [2024-10-11 20:08:37,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:08:37,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:08:37,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:08:37,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:08:37,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:08:37,139 INFO L87 Difference]: Start difference. First operand 309 states and 363 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:08:37,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:08:37,199 INFO L93 Difference]: Finished difference Result 309 states and 363 transitions. [2024-10-11 20:08:37,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:08:37,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-11 20:08:37,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:08:37,201 INFO L225 Difference]: With dead ends: 309 [2024-10-11 20:08:37,201 INFO L226 Difference]: Without dead ends: 306 [2024-10-11 20:08:37,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:08:37,203 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 102 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:08:37,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 99 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:08:37,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-10-11 20:08:37,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 270. [2024-10-11 20:08:37,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 261 states have (on average 1.1915708812260537) internal successors, (311), 269 states have internal predecessors, (311), 0 states have call successors, (0), 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:08:37,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 311 transitions. [2024-10-11 20:08:37,223 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 311 transitions. Word has length 18 [2024-10-11 20:08:37,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:08:37,224 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 311 transitions. [2024-10-11 20:08:37,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:08:37,224 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 311 transitions. [2024-10-11 20:08:37,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 20:08:37,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:08:37,226 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 1, 1, 1, 1] [2024-10-11 20:08:37,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 20:08:37,426 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,SelfDestructingSolverStorable7 [2024-10-11 20:08:37,427 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-10-11 20:08:37,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:08:37,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1303200654, now seen corresponding path program 1 times [2024-10-11 20:08:37,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:08:37,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166175202] [2024-10-11 20:08:37,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:37,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:08:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:37,525 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-11 20:08:37,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:08:37,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166175202] [2024-10-11 20:08:37,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166175202] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:08:37,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455381252] [2024-10-11 20:08:37,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:37,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:08:37,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:08:37,528 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:08:37,529 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:08:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:37,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 20:08:37,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:08:37,732 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:08:37,732 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:08:37,831 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:08:37,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455381252] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:08:37,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:08:37,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 16 [2024-10-11 20:08:37,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698794585] [2024-10-11 20:08:37,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:08:37,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 20:08:37,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:08:37,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 20:08:37,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:08:37,835 INFO L87 Difference]: Start difference. First operand 270 states and 311 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 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:08:38,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:08:38,624 INFO L93 Difference]: Finished difference Result 1076 states and 1326 transitions. [2024-10-11 20:08:38,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-11 20:08:38,624 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 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:08:38,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:08:38,628 INFO L225 Difference]: With dead ends: 1076 [2024-10-11 20:08:38,628 INFO L226 Difference]: Without dead ends: 822 [2024-10-11 20:08:38,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=643, Invalid=1163, Unknown=0, NotChecked=0, Total=1806 [2024-10-11 20:08:38,630 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 1023 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:08:38,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 134 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:08:38,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2024-10-11 20:08:38,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 822. [2024-10-11 20:08:38,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 813 states have (on average 1.1303813038130381) internal successors, (919), 821 states have internal predecessors, (919), 0 states have call successors, (0), 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:08:38,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 919 transitions. [2024-10-11 20:08:38,666 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 919 transitions. Word has length 34 [2024-10-11 20:08:38,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:08:38,666 INFO L471 AbstractCegarLoop]: Abstraction has 822 states and 919 transitions. [2024-10-11 20:08:38,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 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:08:38,667 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 919 transitions. [2024-10-11 20:08:38,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 20:08:38,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:08:38,668 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-10-11 20:08:38,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 20:08:38,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:08:38,873 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-10-11 20:08:38,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:08:38,873 INFO L85 PathProgramCache]: Analyzing trace with hash -793546112, now seen corresponding path program 1 times [2024-10-11 20:08:38,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:08:38,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585856832] [2024-10-11 20:08:38,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:38,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:08:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:39,006 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 0 proven. 329 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-10-11 20:08:39,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:08:39,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585856832] [2024-10-11 20:08:39,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585856832] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:08:39,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190250127] [2024-10-11 20:08:39,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:39,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:08:39,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:08:39,011 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:08:39,014 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:08:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:39,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 20:08:39,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:08:39,357 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 325 proven. 145 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-10-11 20:08:39,357 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:08:39,602 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 325 proven. 145 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-10-11 20:08:39,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190250127] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:08:39,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:08:39,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 13, 13] total 27 [2024-10-11 20:08:39,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148659733] [2024-10-11 20:08:39,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:08:39,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 20:08:39,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:08:39,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 20:08:39,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=449, Unknown=0, NotChecked=0, Total=756 [2024-10-11 20:08:39,607 INFO L87 Difference]: Start difference. First operand 822 states and 919 transitions. Second operand has 28 states, 28 states have (on average 3.642857142857143) internal successors, (102), 27 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:08:41,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:08:41,293 INFO L93 Difference]: Finished difference Result 2474 states and 2954 transitions. [2024-10-11 20:08:41,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-11 20:08:41,294 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.642857142857143) internal successors, (102), 27 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-10-11 20:08:41,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:08:41,300 INFO L225 Difference]: With dead ends: 2474 [2024-10-11 20:08:41,300 INFO L226 Difference]: Without dead ends: 1686 [2024-10-11 20:08:41,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1254 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1549, Invalid=3853, Unknown=0, NotChecked=0, Total=5402 [2024-10-11 20:08:41,304 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 2169 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2169 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 309 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 20:08:41,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2169 Valid, 278 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [309 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 20:08:41,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2024-10-11 20:08:41,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1683. [2024-10-11 20:08:41,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 1677 states have (on average 1.1043530113297555) internal successors, (1852), 1682 states have internal predecessors, (1852), 0 states have call successors, (0), 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:08:41,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 1852 transitions. [2024-10-11 20:08:41,413 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 1852 transitions. Word has length 76 [2024-10-11 20:08:41,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:08:41,414 INFO L471 AbstractCegarLoop]: Abstraction has 1683 states and 1852 transitions. [2024-10-11 20:08:41,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.642857142857143) internal successors, (102), 27 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:08:41,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 1852 transitions. [2024-10-11 20:08:41,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-11 20:08:41,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:08:41,418 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2024-10-11 20:08:41,436 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:08:41,622 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,SelfDestructingSolverStorable9 [2024-10-11 20:08:41,623 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-10-11 20:08:41,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:08:41,624 INFO L85 PathProgramCache]: Analyzing trace with hash 169232973, now seen corresponding path program 1 times [2024-10-11 20:08:41,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:08:41,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574833566] [2024-10-11 20:08:41,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:41,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:08:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:41,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2938 backedges. 0 proven. 1506 refuted. 0 times theorem prover too weak. 1432 trivial. 0 not checked. [2024-10-11 20:08:41,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:08:41,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574833566] [2024-10-11 20:08:41,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574833566] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:08:41,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862139746] [2024-10-11 20:08:41,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:41,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:08:41,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:08:41,919 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:08:41,920 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:08:42,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:42,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 20:08:42,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:08:42,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2938 backedges. 1501 proven. 715 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-10-11 20:08:42,646 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:08:43,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2938 backedges. 1501 proven. 715 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-10-11 20:08:43,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862139746] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:08:43,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:08:43,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 25, 25] total 51 [2024-10-11 20:08:43,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147737683] [2024-10-11 20:08:43,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:08:43,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-11 20:08:43,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:08:43,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-11 20:08:43,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1184, Invalid=1468, Unknown=0, NotChecked=0, Total=2652 [2024-10-11 20:08:43,253 INFO L87 Difference]: Start difference. First operand 1683 states and 1852 transitions. Second operand has 52 states, 52 states have (on average 3.3653846153846154) internal successors, (175), 51 states have internal predecessors, (175), 0 states have call successors, (0), 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:08:49,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:08:49,182 INFO L93 Difference]: Finished difference Result 6731 states and 8014 transitions. [2024-10-11 20:08:49,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2024-10-11 20:08:49,182 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.3653846153846154) internal successors, (175), 51 states have internal predecessors, (175), 0 states have call successors, (0), 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:08:49,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:08:49,201 INFO L225 Difference]: With dead ends: 6731 [2024-10-11 20:08:49,202 INFO L226 Difference]: Without dead ends: 5118 [2024-10-11 20:08:49,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9180 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=9913, Invalid=18479, Unknown=0, NotChecked=0, Total=28392 [2024-10-11 20:08:49,211 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 5852 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5852 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 1678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:08:49,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5852 Valid, 347 Invalid, 1678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 20:08:49,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5118 states. [2024-10-11 20:08:49,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5118 to 5112. [2024-10-11 20:08:49,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5112 states, 5106 states have (on average 1.0934195064629848) internal successors, (5583), 5111 states have internal predecessors, (5583), 0 states have call successors, (0), 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:08:49,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5112 states to 5112 states and 5583 transitions. [2024-10-11 20:08:49,472 INFO L78 Accepts]: Start accepts. Automaton has 5112 states and 5583 transitions. Word has length 149 [2024-10-11 20:08:49,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:08:49,474 INFO L471 AbstractCegarLoop]: Abstraction has 5112 states and 5583 transitions. [2024-10-11 20:08:49,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.3653846153846154) internal successors, (175), 51 states have internal predecessors, (175), 0 states have call successors, (0), 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:08:49,475 INFO L276 IsEmpty]: Start isEmpty. Operand 5112 states and 5583 transitions. [2024-10-11 20:08:49,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2024-10-11 20:08:49,483 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:08:49,483 INFO L215 NwaCegarLoop]: trace histogram [138, 138, 138, 3, 3, 3, 2, 1, 1, 1] [2024-10-11 20:08:49,501 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:08:49,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:08:49,688 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-10-11 20:08:49,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:08:49,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1759040247, now seen corresponding path program 2 times [2024-10-11 20:08:49,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:08:49,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132019372] [2024-10-11 20:08:49,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:49,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:08:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:50,262 INFO L134 CoverageAnalysis]: Checked inductivity of 28785 backedges. 0 proven. 12886 refuted. 0 times theorem prover too weak. 15899 trivial. 0 not checked. [2024-10-11 20:08:50,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:08:50,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132019372] [2024-10-11 20:08:50,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132019372] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:08:50,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036912631] [2024-10-11 20:08:50,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:08:50,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:08:50,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:08:50,265 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:08:50,266 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:08:50,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 20:08:50,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:08:50,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:08:50,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:08:50,906 INFO L134 CoverageAnalysis]: Checked inductivity of 28785 backedges. 0 proven. 12886 refuted. 0 times theorem prover too weak. 15899 trivial. 0 not checked. [2024-10-11 20:08:50,906 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:08:51,331 INFO L134 CoverageAnalysis]: Checked inductivity of 28785 backedges. 0 proven. 12886 refuted. 0 times theorem prover too weak. 15899 trivial. 0 not checked. [2024-10-11 20:08:51,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036912631] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:08:51,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:08:51,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2024-10-11 20:08:51,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991057595] [2024-10-11 20:08:51,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:08:51,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:08:51,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:08:51,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:08:51,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:08:51,334 INFO L87 Difference]: Start difference. First operand 5112 states and 5583 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:08:51,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:08:51,522 INFO L93 Difference]: Finished difference Result 5112 states and 5583 transitions. [2024-10-11 20:08:51,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:08:51,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 428 [2024-10-11 20:08:51,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:08:51,542 INFO L225 Difference]: With dead ends: 5112 [2024-10-11 20:08:51,542 INFO L226 Difference]: Without dead ends: 5109 [2024-10-11 20:08:51,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 858 GetRequests, 852 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:08:51,546 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 72 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:08:51,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 41 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:08:51,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5109 states. [2024-10-11 20:08:51,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5109 to 1734. [2024-10-11 20:08:51,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1731 states have (on average 1.0953206239168112) internal successors, (1896), 1733 states have internal predecessors, (1896), 0 states have call successors, (0), 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:08:51,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 1896 transitions. [2024-10-11 20:08:51,694 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 1896 transitions. Word has length 428 [2024-10-11 20:08:51,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:08:51,696 INFO L471 AbstractCegarLoop]: Abstraction has 1734 states and 1896 transitions. [2024-10-11 20:08:51,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:08:51,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 1896 transitions. [2024-10-11 20:08:51,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2024-10-11 20:08:51,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:08:51,704 INFO L215 NwaCegarLoop]: trace histogram [138, 138, 138, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1] [2024-10-11 20:08:51,721 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:08:51,904 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,SelfDestructingSolverStorable11 [2024-10-11 20:08:51,905 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-10-11 20:08:51,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:08:51,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1714535565, now seen corresponding path program 2 times [2024-10-11 20:08:51,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:08:51,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402546830] [2024-10-11 20:08:51,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:08:51,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:08:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:08:52,437 INFO L134 CoverageAnalysis]: Checked inductivity of 28806 backedges. 0 proven. 12898 refuted. 0 times theorem prover too weak. 15908 trivial. 0 not checked. [2024-10-11 20:08:52,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:08:52,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402546830] [2024-10-11 20:08:52,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402546830] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:08:52,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169119068] [2024-10-11 20:08:52,438 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:08:52,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:08:52,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:08:52,440 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:08:52,442 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:08:52,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 20:08:52,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:08:52,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:08:52,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:08:53,184 INFO L134 CoverageAnalysis]: Checked inductivity of 28806 backedges. 0 proven. 12898 refuted. 0 times theorem prover too weak. 15908 trivial. 0 not checked. [2024-10-11 20:08:53,184 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:08:53,680 INFO L134 CoverageAnalysis]: Checked inductivity of 28806 backedges. 0 proven. 12898 refuted. 0 times theorem prover too weak. 15908 trivial. 0 not checked. [2024-10-11 20:08:53,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169119068] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:08:53,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:08:53,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2024-10-11 20:08:53,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69418615] [2024-10-11 20:08:53,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:08:53,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:08:53,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:08:53,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:08:53,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:08:53,684 INFO L87 Difference]: Start difference. First operand 1734 states and 1896 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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:08:53,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:08:53,806 INFO L93 Difference]: Finished difference Result 1734 states and 1896 transitions. [2024-10-11 20:08:53,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:08:53,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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 439 [2024-10-11 20:08:53,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:08:53,808 INFO L225 Difference]: With dead ends: 1734 [2024-10-11 20:08:53,808 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:08:53,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 880 GetRequests, 874 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:08:53,810 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:08:53,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 26 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:08:53,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:08:53,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:08:53,811 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:08:53,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:08:53,812 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 439 [2024-10-11 20:08:53,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:08:53,812 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:08:53,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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:08:53,812 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:08:53,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:08:53,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2024-10-11 20:08:53,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2024-10-11 20:08:53,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2024-10-11 20:08:53,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2024-10-11 20:08:53,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2024-10-11 20:08:53,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2024-10-11 20:08:53,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2024-10-11 20:08:53,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2024-10-11 20:08:53,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2024-10-11 20:08:53,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2024-10-11 20:08:53,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2024-10-11 20:08:53,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2024-10-11 20:08:53,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2024-10-11 20:08:53,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2024-10-11 20:08:53,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2024-10-11 20:08:53,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2024-10-11 20:08:53,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2024-10-11 20:08:53,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2024-10-11 20:08:53,835 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:08:54,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:08:54,022 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:08:54,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:09:07,888 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:09:07,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:09:07 BoogieIcfgContainer [2024-10-11 20:09:07,917 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:09:07,917 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:09:07,918 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:09:07,918 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:09:07,918 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:08:33" (3/4) ... [2024-10-11 20:09:07,921 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:09:07,933 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-11 20:09:07,934 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 20:09:07,934 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 20:09:07,934 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:09:08,051 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:09:08,051 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:09:08,051 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:09:08,052 INFO L158 Benchmark]: Toolchain (without parser) took 35252.86ms. Allocated memory was 163.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 111.6MB in the beginning and 580.3MB in the end (delta: -468.7MB). Peak memory consumption was 650.9MB. Max. memory is 16.1GB. [2024-10-11 20:09:08,052 INFO L158 Benchmark]: CDTParser took 1.07ms. Allocated memory is still 163.6MB. Free memory is still 131.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:09:08,052 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.49ms. Allocated memory is still 163.6MB. Free memory was 111.6MB in the beginning and 98.9MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 20:09:08,052 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.47ms. Allocated memory is still 163.6MB. Free memory was 98.9MB in the beginning and 96.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:09:08,053 INFO L158 Benchmark]: Boogie Preprocessor took 66.58ms. Allocated memory is still 163.6MB. Free memory was 96.9MB in the beginning and 94.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:09:08,053 INFO L158 Benchmark]: RCFGBuilder took 474.39ms. Allocated memory is still 163.6MB. Free memory was 94.8MB in the beginning and 78.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 20:09:08,053 INFO L158 Benchmark]: TraceAbstraction took 34212.46ms. Allocated memory was 163.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 77.4MB in the beginning and 585.5MB in the end (delta: -508.1MB). Peak memory consumption was 730.6MB. Max. memory is 16.1GB. [2024-10-11 20:09:08,053 INFO L158 Benchmark]: Witness Printer took 133.93ms. Allocated memory is still 1.3GB. Free memory was 585.5MB in the beginning and 580.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 20:09:08,054 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.07ms. Allocated memory is still 163.6MB. Free memory is still 131.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.49ms. Allocated memory is still 163.6MB. Free memory was 111.6MB in the beginning and 98.9MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.47ms. Allocated memory is still 163.6MB. Free memory was 98.9MB in the beginning and 96.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.58ms. Allocated memory is still 163.6MB. Free memory was 96.9MB in the beginning and 94.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 474.39ms. Allocated memory is still 163.6MB. Free memory was 94.8MB in the beginning and 78.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 34212.46ms. Allocated memory was 163.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 77.4MB in the beginning and 585.5MB in the end (delta: -508.1MB). Peak memory consumption was 730.6MB. Max. memory is 16.1GB. * Witness Printer took 133.93ms. Allocated memory is still 1.3GB. Free memory was 585.5MB in the beginning and 580.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 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: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 73]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 73]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: 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, 53 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 20.2s, OverallIterations: 13, TraceHistogramMax: 138, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9959 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9959 mSDsluCounter, 1585 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1120 mSDsCounter, 1650 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2114 IncrementalHoareTripleChecker+Invalid, 3764 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1650 mSolverCounterUnsat, 465 mSDtfsCounter, 2114 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2564 GetRequests, 2234 SyntacticMatches, 0 SemanticMatches, 330 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10960 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5112occurred in iteration=11, InterpolantAutomatonStates: 279, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 3438 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 2380 NumberOfCodeBlocks, 1512 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 3518 ConstructedInterpolants, 0 QuantifiedInterpolants, 10618 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1378 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 30 InterpolantComputations, 5 PerfectInterpolantSequences, 102842/183898 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 18 specifications checked. All of them hold - InvariantResult [Line: 71]: Loop Invariant Derived loop invariant: ((((((m <= 1000) && (i <= 999)) && ((((((1 <= i) && (k == 0)) && (p == 1800)) && (j == 0)) && (n == 1500)) || ((((((1 <= i) && (1 <= j)) && (k == 0)) && (p == 1800)) && (n == 1500)) && (j <= 1499)))) || ((m <= 1000) && (((((((i == 0) && (1 <= j)) && (k == 0)) && (p == 1800)) && (n == 1500)) && (j <= 1499)) || (((((i == 0) && (k == 0)) && (p == 1800)) && (j == 0)) && (n == 1500))))) || ((m <= 1000) && ((((((((i == 0) && (1 <= j)) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (n == 1500)) && (j <= 1499)) || ((((((i == 0) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1500))))) || (((m <= 1000) && (i <= 999)) && ((((((((1 <= i) && (1 <= j)) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (n == 1500)) && (j <= 1499)) || ((((((1 <= i) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1500))))) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((m <= 1000) && (i <= 999)) && ((((((1 <= i) && (k == 0)) && (p == 1800)) && (j == 0)) && (n == 1500)) || ((((((1 <= i) && (1 <= j)) && (k == 0)) && (p == 1800)) && (n == 1500)) && (j <= 1499)))) || ((m <= 1000) && (((((((i == 0) && (1 <= j)) && (k == 0)) && (p == 1800)) && (n == 1500)) && (j <= 1499)) || (((((i == 0) && (k == 0)) && (p == 1800)) && (j == 0)) && (n == 1500))))) || ((m <= 1000) && ((((((((i == 0) && (1 <= j)) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (n == 1500)) && (j <= 1499)) || ((((((i == 0) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1500))))) || (((m <= 1000) && (i <= 999)) && ((((((((1 <= i) && (1 <= j)) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (n == 1500)) && (j <= 1499)) || ((((((1 <= i) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1500))))) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((((((m <= 1000) && (1 <= i)) && (i <= 2147483646)) && (p == 1800)) && (n == 1500)) || ((((m <= 1000) && (i == 0)) && (p == 1800)) && (n == 1500))) - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: ((((((((((m <= 1000) && (1 <= i)) && (1 <= j)) && (i <= 999)) && (p == 1800)) && (j <= 2147483646)) && (n == 1500)) || ((((((m <= 1000) && (i == 0)) && (1 <= j)) && (p == 1800)) && (j <= 2147483646)) && (n == 1500))) || (((((m <= 1000) && (i == 0)) && (p == 1800)) && (j == 0)) && (n == 1500))) || ((((((m <= 1000) && (1 <= i)) && (i <= 999)) && (p == 1800)) && (j == 0)) && (n == 1500))) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: ((((((m <= 1000) && (i <= 999)) && ((((((1 <= i) && (k == 0)) && (p == 1800)) && (j == 0)) && (n == 1500)) || ((((((1 <= i) && (1 <= j)) && (k == 0)) && (p == 1800)) && (n == 1500)) && (j <= 1499)))) || ((m <= 1000) && (((((((i == 0) && (1 <= j)) && (k == 0)) && (p == 1800)) && (n == 1500)) && (j <= 1499)) || (((((i == 0) && (k == 0)) && (p == 1800)) && (j == 0)) && (n == 1500))))) || ((m <= 1000) && ((((((((i == 0) && (1 <= j)) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (n == 1500)) && (j <= 1499)) || ((((((i == 0) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1500))))) || (((m <= 1000) && (i <= 999)) && ((((((((1 <= i) && (1 <= j)) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (n == 1500)) && (j <= 1499)) || ((((((1 <= i) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1500))))) - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: ((((((((((m <= 1000) && (1 <= i)) && (1 <= j)) && (i <= 999)) && (p == 1800)) && (j <= 2147483646)) && (n == 1500)) || ((((((m <= 1000) && (i == 0)) && (1 <= j)) && (p == 1800)) && (j <= 2147483646)) && (n == 1500))) || (((((m <= 1000) && (i == 0)) && (p == 1800)) && (j == 0)) && (n == 1500))) || ((((((m <= 1000) && (1 <= i)) && (i <= 999)) && (p == 1800)) && (j == 0)) && (n == 1500))) - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: ((((((m <= 1000) && (1 <= i)) && (i <= 2147483646)) && (p == 1800)) && (n == 1500)) || ((((m <= 1000) && (i == 0)) && (p == 1800)) && (n == 1500))) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ((((((((((m <= 1000) && (1 <= i)) && (1 <= j)) && (i <= 999)) && (p == 1800)) && (j <= 2147483646)) && (n == 1500)) || ((((((m <= 1000) && (i == 0)) && (1 <= j)) && (p == 1800)) && (j <= 2147483646)) && (n == 1500))) || (((((m <= 1000) && (i == 0)) && (p == 1800)) && (j == 0)) && (n == 1500))) || ((((((m <= 1000) && (1 <= i)) && (i <= 999)) && (p == 1800)) && (j == 0)) && (n == 1500))) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: ((((((m <= 1000) && (1 <= i)) && (i <= 2147483646)) && (p == 1800)) && (n == 1500)) || ((((m <= 1000) && (i == 0)) && (p == 1800)) && (n == 1500))) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:09:08,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE