./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark23_conjunctive.i --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/loop-zilu/benchmark23_conjunctive.i -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 c8661b1e533413e4de6576c4feab251d05a672526bd5f59b260c6cb9f9c05939 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:29:36,739 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:29:36,820 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:29:36,824 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:29:36,824 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:29:36,855 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:29:36,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:29:36,856 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:29:36,857 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:29:36,858 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:29:36,859 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:29:36,859 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:29:36,860 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:29:36,862 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:29:36,862 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:29:36,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:29:36,863 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:29:36,866 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:29:36,866 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:29:36,866 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:29:36,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:29:36,867 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:29:36,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:29:36,868 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:29:36,868 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:29:36,868 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:29:36,868 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:29:36,869 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:29:36,869 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:29:36,869 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:29:36,869 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:29:36,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:29:36,870 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:29:36,872 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:29:36,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:29:36,873 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:29:36,873 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:29:36,873 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:29:36,873 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:29:36,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:29:36,874 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:29:36,874 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:29:36,875 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:29:36,875 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:29:36,875 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 -> c8661b1e533413e4de6576c4feab251d05a672526bd5f59b260c6cb9f9c05939 [2024-10-11 20:29:37,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:29:37,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:29:37,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:29:37,146 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:29:37,146 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:29:37,147 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark23_conjunctive.i [2024-10-11 20:29:38,579 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:29:38,752 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:29:38,753 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark23_conjunctive.i [2024-10-11 20:29:38,760 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d0c734ced/7f5b8c4eb5d14b1f98cc12ff0e64ff46/FLAG0d262a1ac [2024-10-11 20:29:38,774 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d0c734ced/7f5b8c4eb5d14b1f98cc12ff0e64ff46 [2024-10-11 20:29:38,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:29:38,778 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:29:38,780 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:29:38,780 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:29:38,784 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:29:38,785 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:29:38" (1/1) ... [2024-10-11 20:29:38,786 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cafd4ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:38, skipping insertion in model container [2024-10-11 20:29:38,786 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:29:38" (1/1) ... [2024-10-11 20:29:38,805 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:29:38,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:29:39,008 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:29:39,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:29:39,041 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:29:39,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:39 WrapperNode [2024-10-11 20:29:39,042 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:29:39,043 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:29:39,043 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:29:39,043 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:29:39,050 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:29:39" (1/1) ... [2024-10-11 20:29:39,056 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:29:39" (1/1) ... [2024-10-11 20:29:39,073 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 39 [2024-10-11 20:29:39,074 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:29:39,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:29:39,075 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:29:39,075 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:29:39,084 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:39" (1/1) ... [2024-10-11 20:29:39,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:39" (1/1) ... [2024-10-11 20:29:39,085 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:39" (1/1) ... [2024-10-11 20:29:39,098 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 20:29:39,098 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:39" (1/1) ... [2024-10-11 20:29:39,098 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:39" (1/1) ... [2024-10-11 20:29:39,101 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:39" (1/1) ... [2024-10-11 20:29:39,106 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:39" (1/1) ... [2024-10-11 20:29:39,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:39" (1/1) ... [2024-10-11 20:29:39,109 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:39" (1/1) ... [2024-10-11 20:29:39,111 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:29:39,112 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:29:39,113 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:29:39,113 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:29:39,114 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:39" (1/1) ... [2024-10-11 20:29:39,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:29:39,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:29:39,145 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:29:39,149 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:29:39,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:29:39,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:29:39,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:29:39,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:29:39,245 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:29:39,247 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:29:39,360 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-11 20:29:39,360 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:29:39,383 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:29:39,384 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 20:29:39,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:29:39 BoogieIcfgContainer [2024-10-11 20:29:39,384 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:29:39,387 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:29:39,387 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:29:39,391 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:29:39,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:29:38" (1/3) ... [2024-10-11 20:29:39,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b3754c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:29:39, skipping insertion in model container [2024-10-11 20:29:39,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:39" (2/3) ... [2024-10-11 20:29:39,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b3754c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:29:39, skipping insertion in model container [2024-10-11 20:29:39,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:29:39" (3/3) ... [2024-10-11 20:29:39,394 INFO L112 eAbstractionObserver]: Analyzing ICFG benchmark23_conjunctive.i [2024-10-11 20:29:39,412 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:29:39,413 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-11 20:29:39,474 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:29:39,483 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;@5eff7d26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:29:39,483 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 20:29:39,489 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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:29:39,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 20:29:39,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:29:39,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 20:29:39,516 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:29:39,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:29:39,531 INFO L85 PathProgramCache]: Analyzing trace with hash 2301147, now seen corresponding path program 1 times [2024-10-11 20:29:39,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:29:39,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456738871] [2024-10-11 20:29:39,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:29:39,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:29:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:29:39,787 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:29:39,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:29:39,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456738871] [2024-10-11 20:29:39,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456738871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:29:39,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:29:39,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 20:29:39,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854460498] [2024-10-11 20:29:39,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:29:39,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:29:39,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:29:39,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:29:39,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:29:39,827 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 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 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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:29:39,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:29:39,861 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2024-10-11 20:29:39,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:29:39,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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:29:39,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:29:39,871 INFO L225 Difference]: With dead ends: 24 [2024-10-11 20:29:39,871 INFO L226 Difference]: Without dead ends: 10 [2024-10-11 20:29:39,873 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:29:39,877 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 6 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:29:39,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 12 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:29:39,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-10-11 20:29:39,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-10-11 20:29:39,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:29:39,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-10-11 20:29:39,902 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 4 [2024-10-11 20:29:39,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:29:39,902 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-10-11 20:29:39,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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:29:39,903 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-10-11 20:29:39,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 20:29:39,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:29:39,903 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 20:29:39,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:29:39,904 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:29:39,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:29:39,905 INFO L85 PathProgramCache]: Analyzing trace with hash 71335607, now seen corresponding path program 1 times [2024-10-11 20:29:39,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:29:39,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032269600] [2024-10-11 20:29:39,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:29:39,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:29:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:29:39,942 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:29:39,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:29:39,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032269600] [2024-10-11 20:29:39,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032269600] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:29:39,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:29:39,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:29:39,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858669323] [2024-10-11 20:29:39,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:29:39,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:29:39,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:29:39,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:29:39,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:29:39,946 INFO L87 Difference]: Start difference. First operand 10 states and 10 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:29:39,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:29:39,957 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-10-11 20:29:39,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:29:39,957 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:29:39,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:29:39,958 INFO L225 Difference]: With dead ends: 14 [2024-10-11 20:29:39,958 INFO L226 Difference]: Without dead ends: 13 [2024-10-11 20:29:39,958 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:29:39,959 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:29:39,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:29:39,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-10-11 20:29:39,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-10-11 20:29:39,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 1.3) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:29:39,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-10-11 20:29:39,964 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 5 [2024-10-11 20:29:39,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:29:39,964 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-10-11 20:29:39,965 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:29:39,965 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-10-11 20:29:39,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 20:29:39,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:29:39,965 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 20:29:39,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:29:39,966 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:29:39,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:29:39,967 INFO L85 PathProgramCache]: Analyzing trace with hash -2083563427, now seen corresponding path program 1 times [2024-10-11 20:29:39,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:29:39,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565403438] [2024-10-11 20:29:39,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:29:39,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:29:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:29:40,042 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:29:40,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:29:40,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565403438] [2024-10-11 20:29:40,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565403438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:29:40,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:29:40,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:29:40,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299465284] [2024-10-11 20:29:40,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:29:40,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:29:40,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:29:40,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:29:40,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:29:40,045 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:29:40,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:29:40,070 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-10-11 20:29:40,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:29:40,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 20:29:40,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:29:40,074 INFO L225 Difference]: With dead ends: 13 [2024-10-11 20:29:40,074 INFO L226 Difference]: Without dead ends: 12 [2024-10-11 20:29:40,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:29:40,076 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:29:40,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:29:40,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-11 20:29:40,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-10-11 20:29:40,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:29:40,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-10-11 20:29:40,084 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 6 [2024-10-11 20:29:40,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:29:40,085 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-10-11 20:29:40,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:29:40,085 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-10-11 20:29:40,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 20:29:40,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:29:40,085 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:29:40,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:29:40,086 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:29:40,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:29:40,086 INFO L85 PathProgramCache]: Analyzing trace with hash -165956743, now seen corresponding path program 1 times [2024-10-11 20:29:40,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:29:40,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70165992] [2024-10-11 20:29:40,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:29:40,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:29:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:29:40,159 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:29:40,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:29:40,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70165992] [2024-10-11 20:29:40,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70165992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:29:40,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:29:40,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:29:40,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668639403] [2024-10-11 20:29:40,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:29:40,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:29:40,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:29:40,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:29:40,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:29:40,163 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:29:40,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:29:40,188 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-10-11 20:29:40,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:29:40,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 20:29:40,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:29:40,190 INFO L225 Difference]: With dead ends: 15 [2024-10-11 20:29:40,190 INFO L226 Difference]: Without dead ends: 14 [2024-10-11 20:29:40,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:29:40,192 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:29:40,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:29:40,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-10-11 20:29:40,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-11 20:29:40,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:29:40,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-10-11 20:29:40,199 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2024-10-11 20:29:40,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:29:40,199 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-10-11 20:29:40,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:29:40,199 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-10-11 20:29:40,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 20:29:40,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:29:40,200 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 20:29:40,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 20:29:40,202 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:29:40,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:29:40,203 INFO L85 PathProgramCache]: Analyzing trace with hash -509927273, now seen corresponding path program 1 times [2024-10-11 20:29:40,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:29:40,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444044657] [2024-10-11 20:29:40,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:29:40,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:29:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:29:40,251 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:29:40,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:29:40,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444044657] [2024-10-11 20:29:40,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444044657] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:29:40,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340049290] [2024-10-11 20:29:40,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:29:40,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:29:40,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:29:40,254 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:29:40,256 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:29:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:29:40,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:29:40,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:29:40,356 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:29:40,357 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:29:40,401 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:29:40,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340049290] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:29:40,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:29:40,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-10-11 20:29:40,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676852346] [2024-10-11 20:29:40,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:29:40,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:29:40,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:29:40,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:29:40,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:29:40,408 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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:29:40,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:29:40,433 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2024-10-11 20:29:40,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:29:40,433 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 20:29:40,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:29:40,434 INFO L225 Difference]: With dead ends: 30 [2024-10-11 20:29:40,434 INFO L226 Difference]: Without dead ends: 29 [2024-10-11 20:29:40,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:29:40,435 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 5 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:29:40,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 21 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:29:40,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-11 20:29:40,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-10-11 20:29:40,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:29:40,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2024-10-11 20:29:40,444 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 10 [2024-10-11 20:29:40,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:29:40,444 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-10-11 20:29:40,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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:29:40,445 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2024-10-11 20:29:40,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 20:29:40,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:29:40,446 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1] [2024-10-11 20:29:40,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 20:29:40,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:29:40,647 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:29:40,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:29:40,648 INFO L85 PathProgramCache]: Analyzing trace with hash -413835943, now seen corresponding path program 1 times [2024-10-11 20:29:40,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:29:40,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635872174] [2024-10-11 20:29:40,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:29:40,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:29:40,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:29:40,700 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:29:40,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:29:40,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635872174] [2024-10-11 20:29:40,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635872174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:29:40,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:29:40,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:29:40,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586616411] [2024-10-11 20:29:40,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:29:40,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:29:40,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:29:40,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:29:40,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:29:40,703 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:29:40,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:29:40,718 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2024-10-11 20:29:40,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:29:40,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-11 20:29:40,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:29:40,720 INFO L225 Difference]: With dead ends: 27 [2024-10-11 20:29:40,720 INFO L226 Difference]: Without dead ends: 26 [2024-10-11 20:29:40,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:29:40,721 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 1 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:29:40,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 6 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:29:40,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-11 20:29:40,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-11 20:29:40,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:29:40,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2024-10-11 20:29:40,726 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 12 [2024-10-11 20:29:40,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:29:40,726 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2024-10-11 20:29:40,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:29:40,727 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2024-10-11 20:29:40,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 20:29:40,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:29:40,728 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1] [2024-10-11 20:29:40,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 20:29:40,728 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:29:40,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:29:40,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1209149769, now seen corresponding path program 2 times [2024-10-11 20:29:40,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:29:40,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508870066] [2024-10-11 20:29:40,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:29:40,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:29:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:29:40,859 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:29:40,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:29:40,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508870066] [2024-10-11 20:29:40,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508870066] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:29:40,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751826560] [2024-10-11 20:29:40,860 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:29:40,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:29:40,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:29:40,862 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:29:40,863 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:29:40,903 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:29:40,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:29:40,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:29:40,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:29:40,954 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:29:40,954 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:29:41,071 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:29:41,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751826560] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:29:41,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:29:41,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-10-11 20:29:41,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954955660] [2024-10-11 20:29:41,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:29:41,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:29:41,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:29:41,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:29:41,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:29:41,077 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:29:41,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:29:41,140 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2024-10-11 20:29:41,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 20:29:41,140 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-10-11 20:29:41,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:29:41,141 INFO L225 Difference]: With dead ends: 57 [2024-10-11 20:29:41,141 INFO L226 Difference]: Without dead ends: 56 [2024-10-11 20:29:41,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:29:41,142 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:29:41,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 35 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:29:41,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-11 20:29:41,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-11 20:29:41,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.018181818181818) internal successors, (56), 55 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:29:41,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2024-10-11 20:29:41,166 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 25 [2024-10-11 20:29:41,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:29:41,166 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2024-10-11 20:29:41,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:29:41,167 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2024-10-11 20:29:41,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 20:29:41,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:29:41,168 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1] [2024-10-11 20:29:41,185 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:29:41,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:29:41,369 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:29:41,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:29:41,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1348642121, now seen corresponding path program 3 times [2024-10-11 20:29:41,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:29:41,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261379937] [2024-10-11 20:29:41,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:29:41,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:29:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:29:41,659 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:29:41,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:29:41,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261379937] [2024-10-11 20:29:41,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261379937] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:29:41,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825981992] [2024-10-11 20:29:41,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 20:29:41,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:29:41,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:29:41,662 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:29:41,664 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:29:41,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-11 20:29:41,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:29:41,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 20:29:41,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:29:41,841 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:29:41,842 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:29:42,138 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:29:42,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825981992] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:29:42,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:29:42,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2024-10-11 20:29:42,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045042624] [2024-10-11 20:29:42,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:29:42,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 20:29:42,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:29:42,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 20:29:42,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2024-10-11 20:29:42,145 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand has 24 states, 23 states have (on average 4.739130434782608) internal successors, (109), 24 states have internal predecessors, (109), 0 states have call successors, (0), 0 states 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:29:42,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:29:42,235 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2024-10-11 20:29:42,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 20:29:42,236 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.739130434782608) internal successors, (109), 24 states have internal predecessors, (109), 0 states have call successors, (0), 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 55 [2024-10-11 20:29:42,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:29:42,238 INFO L225 Difference]: With dead ends: 117 [2024-10-11 20:29:42,238 INFO L226 Difference]: Without dead ends: 116 [2024-10-11 20:29:42,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2024-10-11 20:29:42,239 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:29:42,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 71 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:29:42,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-11 20:29:42,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-10-11 20:29:42,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.008695652173913) internal successors, (116), 115 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:29:42,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2024-10-11 20:29:42,251 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 55 [2024-10-11 20:29:42,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:29:42,251 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2024-10-11 20:29:42,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.739130434782608) internal successors, (109), 24 states have internal predecessors, (109), 0 states have call successors, (0), 0 states 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:29:42,252 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2024-10-11 20:29:42,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 20:29:42,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:29:42,254 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1] [2024-10-11 20:29:42,272 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:29:42,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:29:42,459 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:29:42,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:29:42,459 INFO L85 PathProgramCache]: Analyzing trace with hash 675242679, now seen corresponding path program 4 times [2024-10-11 20:29:42,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:29:42,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439444376] [2024-10-11 20:29:42,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:29:42,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:29:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:29:43,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:29:43,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:29:43,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439444376] [2024-10-11 20:29:43,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439444376] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:29:43,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134764709] [2024-10-11 20:29:43,127 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 20:29:43,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:29:43,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:29:43,130 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:29:43,132 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:29:43,216 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 20:29:43,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:29:43,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 20:29:43,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:29:43,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:29:43,394 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:29:44,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:29:44,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134764709] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:29:44,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:29:44,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2024-10-11 20:29:44,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691353338] [2024-10-11 20:29:44,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:29:44,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-10-11 20:29:44,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:29:44,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-10-11 20:29:44,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-10-11 20:29:44,314 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand has 48 states, 47 states have (on average 4.872340425531915) internal successors, (229), 48 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:29:44,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:29:44,462 INFO L93 Difference]: Finished difference Result 237 states and 260 transitions. [2024-10-11 20:29:44,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-10-11 20:29:44,463 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 4.872340425531915) internal successors, (229), 48 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2024-10-11 20:29:44,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:29:44,465 INFO L225 Difference]: With dead ends: 237 [2024-10-11 20:29:44,465 INFO L226 Difference]: Without dead ends: 236 [2024-10-11 20:29:44,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-10-11 20:29:44,467 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:29:44,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 143 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:29:44,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-11 20:29:44,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2024-10-11 20:29:44,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 1.004255319148936) internal successors, (236), 235 states have internal predecessors, (236), 0 states have call successors, (0), 0 states 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:29:44,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2024-10-11 20:29:44,494 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 115 [2024-10-11 20:29:44,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:29:44,494 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2024-10-11 20:29:44,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 4.872340425531915) internal successors, (229), 48 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:29:44,498 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2024-10-11 20:29:44,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-10-11 20:29:44,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:29:44,506 INFO L215 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 1, 1, 1] [2024-10-11 20:29:44,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 20:29:44,709 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,SelfDestructingSolverStorable8 [2024-10-11 20:29:44,710 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:29:44,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:29:44,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1435464375, now seen corresponding path program 5 times [2024-10-11 20:29:44,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:29:44,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760718651] [2024-10-11 20:29:44,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:29:44,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:29:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:29:46,764 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:29:46,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:29:46,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760718651] [2024-10-11 20:29:46,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760718651] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:29:46,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566047328] [2024-10-11 20:29:46,765 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 20:29:46,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:29:46,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:29:46,767 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:29:46,769 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:29:46,930 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2024-10-11 20:29:46,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:29:46,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-11 20:29:46,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:29:47,238 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:29:47,238 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:29:49,837 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:29:49,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566047328] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:29:49,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:29:49,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2024-10-11 20:29:49,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381196330] [2024-10-11 20:29:49,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:29:49,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2024-10-11 20:29:49,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:29:49,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2024-10-11 20:29:49,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2024-10-11 20:29:49,844 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand has 96 states, 95 states have (on average 4.936842105263158) internal successors, (469), 96 states have internal predecessors, (469), 0 states have call successors, (0), 0 states 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:29:50,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:29:50,274 INFO L93 Difference]: Finished difference Result 477 states and 524 transitions. [2024-10-11 20:29:50,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-10-11 20:29:50,275 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 4.936842105263158) internal successors, (469), 96 states have internal predecessors, (469), 0 states have call successors, (0), 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 235 [2024-10-11 20:29:50,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:29:50,278 INFO L225 Difference]: With dead ends: 477 [2024-10-11 20:29:50,278 INFO L226 Difference]: Without dead ends: 476 [2024-10-11 20:29:50,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2024-10-11 20:29:50,281 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:29:50,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 287 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:29:50,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-10-11 20:29:50,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2024-10-11 20:29:50,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 475 states have (on average 1.0021052631578948) internal successors, (476), 475 states have internal predecessors, (476), 0 states have call successors, (0), 0 states 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:29:50,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 476 transitions. [2024-10-11 20:29:50,313 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 476 transitions. Word has length 235 [2024-10-11 20:29:50,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:29:50,314 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 476 transitions. [2024-10-11 20:29:50,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 4.936842105263158) internal successors, (469), 96 states have internal predecessors, (469), 0 states have call successors, (0), 0 states 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:29:50,314 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 476 transitions. [2024-10-11 20:29:50,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2024-10-11 20:29:50,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:29:50,322 INFO L215 NwaCegarLoop]: trace histogram [95, 95, 94, 94, 94, 1, 1, 1] [2024-10-11 20:29:50,340 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:29:50,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 20:29:50,527 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:29:50,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:29:50,528 INFO L85 PathProgramCache]: Analyzing trace with hash -664825161, now seen corresponding path program 6 times [2024-10-11 20:29:50,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:29:50,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655803483] [2024-10-11 20:29:50,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:29:50,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:29:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:29:56,787 INFO L134 CoverageAnalysis]: Checked inductivity of 22137 backedges. 0 proven. 22137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:29:56,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:29:56,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655803483] [2024-10-11 20:29:56,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655803483] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:29:56,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106428368] [2024-10-11 20:29:56,788 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-11 20:29:56,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:29:56,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:29:56,789 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:29:56,790 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:29:57,099 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2024-10-11 20:29:57,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:29:57,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 1062 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-10-11 20:29:57,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:29:57,643 INFO L134 CoverageAnalysis]: Checked inductivity of 22137 backedges. 0 proven. 22137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:29:57,643 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:30:06,767 INFO L134 CoverageAnalysis]: Checked inductivity of 22137 backedges. 0 proven. 22137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:30:06,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106428368] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:30:06,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:30:06,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2024-10-11 20:30:06,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296127825] [2024-10-11 20:30:06,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:30:06,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2024-10-11 20:30:06,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:30:06,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2024-10-11 20:30:06,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2024-10-11 20:30:06,781 INFO L87 Difference]: Start difference. First operand 476 states and 476 transitions. Second operand has 192 states, 191 states have (on average 4.968586387434555) internal successors, (949), 192 states have internal predecessors, (949), 0 states have call successors, (0), 0 states 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:30:07,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:30:07,771 INFO L93 Difference]: Finished difference Result 957 states and 1052 transitions. [2024-10-11 20:30:07,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2024-10-11 20:30:07,772 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 191 states have (on average 4.968586387434555) internal successors, (949), 192 states have internal predecessors, (949), 0 states have call successors, (0), 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 475 [2024-10-11 20:30:07,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:30:07,776 INFO L225 Difference]: With dead ends: 957 [2024-10-11 20:30:07,776 INFO L226 Difference]: Without dead ends: 956 [2024-10-11 20:30:07,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1044 GetRequests, 854 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2024-10-11 20:30:07,780 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:30:07,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 575 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:30:07,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2024-10-11 20:30:07,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 956. [2024-10-11 20:30:07,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 955 states have (on average 1.0010471204188482) internal successors, (956), 955 states have internal predecessors, (956), 0 states have call successors, (0), 0 states 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:30:07,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 956 transitions. [2024-10-11 20:30:07,809 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 956 transitions. Word has length 475 [2024-10-11 20:30:07,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:30:07,810 INFO L471 AbstractCegarLoop]: Abstraction has 956 states and 956 transitions. [2024-10-11 20:30:07,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 191 states have (on average 4.968586387434555) internal successors, (949), 192 states have internal predecessors, (949), 0 states have call successors, (0), 0 states 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:30:07,811 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 956 transitions. [2024-10-11 20:30:07,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 956 [2024-10-11 20:30:07,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:30:07,837 INFO L215 NwaCegarLoop]: trace histogram [191, 191, 190, 190, 190, 1, 1, 1] [2024-10-11 20:30:07,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 20:30:08,038 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,SelfDestructingSolverStorable10 [2024-10-11 20:30:08,038 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:30:08,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:30:08,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1052758711, now seen corresponding path program 7 times [2024-10-11 20:30:08,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:30:08,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274825364] [2024-10-11 20:30:08,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:30:08,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:30:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:30:31,011 INFO L134 CoverageAnalysis]: Checked inductivity of 90345 backedges. 0 proven. 90345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:30:31,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:30:31,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274825364] [2024-10-11 20:30:31,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274825364] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:30:31,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430605455] [2024-10-11 20:30:31,012 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-11 20:30:31,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:30:31,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:30:31,014 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:30:31,015 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:30:31,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:30:31,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 2118 conjuncts, 202 conjuncts are in the unsatisfiable core [2024-10-11 20:30:31,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:30:54,582 INFO L134 CoverageAnalysis]: Checked inductivity of 90345 backedges. 70140 proven. 0 refuted. 0 times theorem prover too weak. 20205 trivial. 0 not checked. [2024-10-11 20:30:54,582 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:30:54,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430605455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:30:54,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:30:54,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [203] imperfect sequences [192] total 394 [2024-10-11 20:30:54,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426473110] [2024-10-11 20:30:54,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:30:54,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 203 states [2024-10-11 20:30:54,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:30:54,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 203 interpolants. [2024-10-11 20:30:54,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28930, Invalid=125912, Unknown=0, NotChecked=0, Total=154842 [2024-10-11 20:30:54,605 INFO L87 Difference]: Start difference. First operand 956 states and 956 transitions. Second operand has 203 states, 203 states have (on average 2.5073891625615765) internal successors, (509), 203 states have internal predecessors, (509), 0 states have call successors, (0), 0 states 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:30:57,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:30:57,781 INFO L93 Difference]: Finished difference Result 956 states and 956 transitions. [2024-10-11 20:30:57,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2024-10-11 20:30:57,783 INFO L78 Accepts]: Start accepts. Automaton has has 203 states, 203 states have (on average 2.5073891625615765) internal successors, (509), 203 states have internal predecessors, (509), 0 states have call successors, (0), 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 955 [2024-10-11 20:30:57,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:30:57,785 INFO L225 Difference]: With dead ends: 956 [2024-10-11 20:30:57,786 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:30:57,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1146 GetRequests, 754 SyntacticMatches, 0 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48090 ImplicationChecksByTransitivity, 34.2s TimeCoverageRelationStatistics Valid=28930, Invalid=125912, Unknown=0, NotChecked=0, Total=154842 [2024-10-11 20:30:57,796 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 3960 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 3960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:30:57,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1227 Invalid, 3960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3960 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 20:30:57,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:30:57,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:30:57,797 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:30:57,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:30:57,797 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 955 [2024-10-11 20:30:57,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:30:57,797 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:30:57,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 203 states, 203 states have (on average 2.5073891625615765) internal successors, (509), 203 states have internal predecessors, (509), 0 states have call successors, (0), 0 states 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:30:57,798 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:30:57,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:30:57,802 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-11 20:30:57,803 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-11 20:30:57,803 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-11 20:30:57,803 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-11 20:30:57,822 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:30:58,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:30:58,007 INFO L407 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1] [2024-10-11 20:30:58,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:30:59,532 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:30:59,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:30:59 BoogieIcfgContainer [2024-10-11 20:30:59,582 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:30:59,582 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:30:59,582 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:30:59,583 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:30:59,583 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:29:39" (3/4) ... [2024-10-11 20:30:59,585 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:30:59,592 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-10-11 20:30:59,592 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-11 20:30:59,592 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 20:30:59,592 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:30:59,687 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:30:59,687 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:30:59,687 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:30:59,688 INFO L158 Benchmark]: Toolchain (without parser) took 80910.04ms. Allocated memory was 153.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 98.0MB in the beginning and 507.7MB in the end (delta: -409.7MB). Peak memory consumption was 705.0MB. Max. memory is 16.1GB. [2024-10-11 20:30:59,689 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 153.1MB. Free memory is still 112.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:30:59,689 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.64ms. Allocated memory is still 153.1MB. Free memory was 98.0MB in the beginning and 85.8MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 20:30:59,689 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.84ms. Allocated memory is still 153.1MB. Free memory was 85.8MB in the beginning and 84.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:30:59,689 INFO L158 Benchmark]: Boogie Preprocessor took 37.29ms. Allocated memory is still 153.1MB. Free memory was 84.1MB in the beginning and 82.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:30:59,690 INFO L158 Benchmark]: RCFGBuilder took 272.15ms. Allocated memory is still 153.1MB. Free memory was 82.6MB in the beginning and 71.9MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 20:30:59,690 INFO L158 Benchmark]: TraceAbstraction took 80194.74ms. Allocated memory was 153.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 71.1MB in the beginning and 511.9MB in the end (delta: -440.8MB). Peak memory consumption was 673.5MB. Max. memory is 16.1GB. [2024-10-11 20:30:59,691 INFO L158 Benchmark]: Witness Printer took 105.18ms. Allocated memory is still 1.3GB. Free memory was 511.9MB in the beginning and 507.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 20:30:59,692 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 153.1MB. Free memory is still 112.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.64ms. Allocated memory is still 153.1MB. Free memory was 98.0MB in the beginning and 85.8MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.84ms. Allocated memory is still 153.1MB. Free memory was 85.8MB in the beginning and 84.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.29ms. Allocated memory is still 153.1MB. Free memory was 84.1MB in the beginning and 82.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 272.15ms. Allocated memory is still 153.1MB. Free memory was 82.6MB in the beginning and 71.9MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 80194.74ms. Allocated memory was 153.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 71.1MB in the beginning and 511.9MB in the end (delta: -440.8MB). Peak memory consumption was 673.5MB. Max. memory is 16.1GB. * Witness Printer took 105.18ms. Allocated memory is still 1.3GB. Free memory was 511.9MB in the beginning and 507.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: 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, 18 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 78.6s, OverallIterations: 12, TraceHistogramMax: 191, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.1s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 24 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24 mSDsluCounter, 2405 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2247 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4833 IncrementalHoareTripleChecker+Invalid, 4842 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 158 mSDtfsCounter, 4833 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3165 GetRequests, 2399 SyntacticMatches, 0 SemanticMatches, 766 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48090 ImplicationChecksByTransitivity, 50.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=956occurred in iteration=11, InterpolantAutomatonStates: 599, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 69.5s InterpolantComputationTime, 3774 NumberOfCodeBlocks, 3774 NumberOfCodeBlocksAsserted, 171 NumberOfCheckSat, 4664 ConstructedInterpolants, 0 QuantifiedInterpolants, 13034 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4233 ConjunctsInSsa, 391 ConjunctsInUnsatCore, 25 InterpolantComputations, 6 PerfectInterpolantSequences, 90350/267608 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 4 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((j <= 118) && (0 <= (j + 2147483648))) && (59 <= i)) || (((0 <= (j + 2147483648)) && (j <= 2147483459)) && (96 <= i))) || (((j <= 138) && (0 <= (j + 2147483648))) && (69 <= i))) || (((0 <= (j + 2147483648)) && (35 <= i)) && (j <= 70))) || (((0 <= (j + 2147483648)) && (65 <= i)) && (j <= 130))) || (((0 <= (j + 2147483648)) && (j <= 146)) && (73 <= i))) || (((0 <= (j + 2147483648)) && (66 <= i)) && (j <= 132))) || (((0 <= (j + 2147483648)) && (j <= 182)) && (91 <= i))) || (((0 <= (j + 2147483648)) && (3 <= i)) && (j <= 6))) || (((0 <= (j + 2147483648)) && (j <= 8)) && (4 <= i))) || (((j <= 164) && (82 <= i)) && (0 <= (j + 2147483648)))) || (((0 <= (j + 2147483648)) && (89 <= i)) && (j <= 178))) || (((0 <= (j + 2147483648)) && (34 <= i)) && (j <= 68))) || (((44 <= i) && (0 <= (j + 2147483648))) && (j <= 88))) || (((0 <= (j + 2147483648)) && (93 <= i)) && (j <= 186))) || (((0 <= (j + 2147483648)) && (j <= 2147483457)) && (95 <= i))) || (((21 <= i) && (0 <= (j + 2147483648))) && (j <= 42))) || (((0 <= (j + 2147483648)) && (23 <= i)) && (j <= 46))) || (((0 <= (j + 2147483648)) && (j <= 2147483465)) && (99 <= i))) || (((0 <= (j + 2147483648)) && (j <= 66)) && (33 <= i))) || (((0 <= (j + 2147483648)) && (28 <= i)) && (j <= 56))) || (((0 <= (j + 2147483648)) && (j <= 18)) && (9 <= i))) || (((0 <= (j + 2147483648)) && (39 <= i)) && (j <= 78))) || (((0 <= (j + 2147483648)) && (j <= 2147483463)) && (98 <= i))) || (((0 <= (j + 2147483648)) && (48 <= i)) && (j <= 96))) || (((0 <= (j + 2147483648)) && (53 <= i)) && (j <= 106))) || (((0 <= (j + 2147483648)) && (20 <= i)) && (j <= 40))) || (((0 <= (j + 2147483648)) && (j <= 44)) && (22 <= i))) || (((0 <= (j + 2147483648)) && (j <= 112)) && (56 <= i))) || (((0 <= (j + 2147483648)) && (45 <= i)) && (j <= 90))) || (((79 <= i) && (0 <= (j + 2147483648))) && (j <= 158))) || (((0 <= (j + 2147483648)) && (58 <= i)) && (j <= 116))) || (((0 <= (j + 2147483648)) && (j <= 64)) && (32 <= i))) || (((0 <= (j + 2147483648)) && (74 <= i)) && (j <= 148))) || (((0 <= (j + 2147483648)) && (j <= 62)) && (31 <= i))) || (((0 <= (j + 2147483648)) && (j <= 50)) && (25 <= i))) || (((0 <= (j + 2147483648)) && (j <= 82)) && (41 <= i))) || (((0 <= (j + 2147483648)) && (57 <= i)) && (j <= 114))) || (((0 <= (j + 2147483648)) && (j <= 140)) && (70 <= i))) || (((j <= 54) && (0 <= (j + 2147483648))) && (27 <= i))) || (((0 <= (j + 2147483648)) && (43 <= i)) && (j <= 86))) || (((0 <= (j + 2147483648)) && (63 <= i)) && (j <= 126))) || (((0 <= (j + 2147483648)) && (13 <= i)) && (j <= 26))) || (((0 <= (j + 2147483648)) && (j <= 160)) && (80 <= i))) || (((0 <= (j + 2147483648)) && (49 <= i)) && (j <= 98))) || (((0 <= (j + 2147483648)) && (51 <= i)) && (j <= 102))) || (((0 <= (j + 2147483648)) && (j <= 142)) && (71 <= i))) || (((86 <= i) && (0 <= (j + 2147483648))) && (j <= 172))) || (((j <= 10) && (0 <= (j + 2147483648))) && (5 <= i))) || (((0 <= (j + 2147483648)) && (10 <= i)) && (j <= 20))) || (((0 <= (j + 2147483648)) && (j <= 32)) && (16 <= i))) || (((0 <= (j + 2147483648)) && (j <= 150)) && (75 <= i))) || (((0 <= (j + 2147483648)) && (88 <= i)) && (j <= 176))) || (((0 <= (j + 2147483648)) && (j <= 92)) && (46 <= i))) || (((0 <= (j + 2147483648)) && (j <= 22)) && (11 <= i))) || (((j <= 170) && (0 <= (j + 2147483648))) && (85 <= i))) || (((0 <= (j + 2147483648)) && (j <= 154)) && (77 <= i))) || (((0 <= (j + 2147483648)) && (37 <= i)) && (j <= 74))) || (((0 <= (j + 2147483648)) && (97 <= i)) && (j <= 2147483461))) || (((0 <= (j + 2147483648)) && (84 <= i)) && (j <= 168))) || (((0 <= (j + 2147483648)) && (j <= 48)) && (24 <= i))) || (((0 <= (j + 2147483648)) && (j <= 16)) && (8 <= i))) || (((0 <= (j + 2147483648)) && (j <= 38)) && (19 <= i))) || (((0 <= (j + 2147483648)) && (100 <= i)) && (j <= 2147483467))) || (((0 <= (j + 2147483648)) && (61 <= i)) && (j <= 122))) || (((0 <= (j + 2147483648)) && (j <= 188)) && (94 <= i))) || (((0 <= (j + 2147483648)) && (j <= 30)) && (15 <= i))) || (((0 <= (j + 2147483648)) && (12 <= i)) && (j <= 24))) || (((0 <= (j + 2147483648)) && (30 <= i)) && (j <= 60))) || (((0 <= (j + 2147483648)) && (j <= 108)) && (54 <= i))) || (((0 <= (j + 2147483648)) && (6 <= i)) && (j <= 12))) || (((0 <= (j + 2147483648)) && (j <= 136)) && (68 <= i))) || (((0 <= (j + 2147483648)) && (87 <= i)) && (j <= 174))) || (((0 <= (j + 2147483648)) && (26 <= i)) && (j <= 52))) || (((0 <= (j + 2147483648)) && (42 <= i)) && (j <= 84))) || (((0 <= (j + 2147483648)) && (50 <= i)) && (j <= 100))) || (((0 <= (j + 2147483648)) && (1 <= i)) && (j <= 2))) || (((j <= 104) && (0 <= (j + 2147483648))) && (52 <= i))) || (((0 <= (j + 2147483648)) && (40 <= i)) && (j <= 80))) || (((0 <= (j + 2147483648)) && (72 <= i)) && (j <= 144))) || (((0 <= (j + 2147483648)) && (17 <= i)) && (j <= 34))) || (((0 <= (j + 2147483648)) && (64 <= i)) && (j <= 128))) || (((0 <= (j + 2147483648)) && (7 <= i)) && (j <= 14))) || (((0 <= (j + 2147483648)) && (j <= 124)) && (62 <= i))) || (((55 <= i) && (0 <= (j + 2147483648))) && (j <= 110))) || (((0 <= (j + 2147483648)) && (47 <= i)) && (j <= 94))) || (((0 <= (j + 2147483648)) && (j <= 4)) && (2 <= i))) || (((0 <= (j + 2147483648)) && (38 <= i)) && (j <= 76))) || (((0 <= (j + 2147483648)) && (14 <= i)) && (j <= 28))) || (((j <= 120) && (0 <= (j + 2147483648))) && (60 <= i))) || (((0 <= (j + 2147483648)) && (18 <= i)) && (j <= 36))) || (((0 <= (j + 2147483648)) && (76 <= i)) && (j <= 152))) || (((j <= 72) && (0 <= (j + 2147483648))) && (36 <= i))) || (((0 <= (j + 2147483648)) && (i == 0)) && (j <= 0))) || (((0 <= (j + 2147483648)) && (92 <= i)) && (j <= 184))) || (((j <= 58) && (0 <= (j + 2147483648))) && (29 <= i))) || (((0 <= (j + 2147483648)) && (j <= 134)) && (67 <= i))) || (((0 <= (j + 2147483648)) && (j <= 166)) && (83 <= i))) || (((0 <= (j + 2147483648)) && (j <= 162)) && (81 <= i))) || (((0 <= (j + 2147483648)) && (j <= 156)) && (78 <= i))) || (((90 <= i) && (0 <= (j + 2147483648))) && (j <= 180))) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:30:59,724 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