./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/sorting_bubblesort_ground-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/sorting_bubblesort_ground-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2719a9efd2165050483c20571c85746fdd7204d074459e12a38b31692a3fffb0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 17:54:41,326 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 17:54:41,388 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-20 17:54:41,393 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 17:54:41,394 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 17:54:41,418 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 17:54:41,419 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 17:54:41,419 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 17:54:41,420 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 17:54:41,421 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 17:54:41,421 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 17:54:41,422 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 17:54:41,422 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 17:54:41,423 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 17:54:41,424 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 17:54:41,424 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 17:54:41,424 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 17:54:41,424 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 17:54:41,425 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 17:54:41,425 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 17:54:41,425 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 17:54:41,425 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 17:54:41,426 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 17:54:41,426 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 17:54:41,426 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 17:54:41,426 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-20 17:54:41,427 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 17:54:41,427 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 17:54:41,427 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 17:54:41,427 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 17:54:41,428 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 17:54:41,428 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 17:54:41,428 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 17:54:41,428 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 17:54:41,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:54:41,429 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 17:54:41,438 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 17:54:41,438 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 17:54:41,438 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 17:54:41,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 17:54:41,439 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 17:54:41,439 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 17:54:41,439 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 17:54:41,440 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 17:54:41,440 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2719a9efd2165050483c20571c85746fdd7204d074459e12a38b31692a3fffb0 [2024-11-20 17:54:41,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 17:54:41,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 17:54:41,671 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 17:54:41,672 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 17:54:41,672 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 17:54:41,673 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/sorting_bubblesort_ground-2.i [2024-11-20 17:54:42,886 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 17:54:43,035 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 17:54:43,036 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/sorting_bubblesort_ground-2.i [2024-11-20 17:54:43,042 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ee95e6a7/5dff24d203e642f2b2908170c29fa863/FLAG2461506cb [2024-11-20 17:54:43,446 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ee95e6a7/5dff24d203e642f2b2908170c29fa863 [2024-11-20 17:54:43,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 17:54:43,449 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 17:54:43,453 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 17:54:43,453 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 17:54:43,458 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 17:54:43,458 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:54:43" (1/1) ... [2024-11-20 17:54:43,459 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@523a6673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:43, skipping insertion in model container [2024-11-20 17:54:43,459 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:54:43" (1/1) ... [2024-11-20 17:54:43,474 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 17:54:43,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:54:43,617 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 17:54:43,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:54:43,643 INFO L204 MainTranslator]: Completed translation [2024-11-20 17:54:43,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:43 WrapperNode [2024-11-20 17:54:43,644 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 17:54:43,645 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 17:54:43,645 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 17:54:43,645 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 17:54:43,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:43" (1/1) ... [2024-11-20 17:54:43,658 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:43" (1/1) ... [2024-11-20 17:54:43,678 INFO L138 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 103 [2024-11-20 17:54:43,679 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 17:54:43,679 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 17:54:43,680 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 17:54:43,680 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 17:54:43,687 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:43" (1/1) ... [2024-11-20 17:54:43,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:43" (1/1) ... [2024-11-20 17:54:43,689 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:43" (1/1) ... [2024-11-20 17:54:43,699 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-11-20 17:54:43,700 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:43" (1/1) ... [2024-11-20 17:54:43,700 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:43" (1/1) ... [2024-11-20 17:54:43,703 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:43" (1/1) ... [2024-11-20 17:54:43,706 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:43" (1/1) ... [2024-11-20 17:54:43,707 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:43" (1/1) ... [2024-11-20 17:54:43,707 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:43" (1/1) ... [2024-11-20 17:54:43,708 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 17:54:43,709 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 17:54:43,709 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 17:54:43,709 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 17:54:43,710 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:43" (1/1) ... [2024-11-20 17:54:43,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:54:43,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:54:43,738 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 17:54:43,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 17:54:43,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 17:54:43,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 17:54:43,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 17:54:43,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 17:54:43,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 17:54:43,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 17:54:43,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 17:54:43,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 17:54:43,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 17:54:43,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 17:54:43,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 17:54:43,845 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 17:54:43,848 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 17:54:44,014 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-20 17:54:44,014 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 17:54:44,026 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 17:54:44,026 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-20 17:54:44,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:54:44 BoogieIcfgContainer [2024-11-20 17:54:44,027 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 17:54:44,028 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 17:54:44,028 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 17:54:44,031 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 17:54:44,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:54:43" (1/3) ... [2024-11-20 17:54:44,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c05cc25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:54:44, skipping insertion in model container [2024-11-20 17:54:44,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:43" (2/3) ... [2024-11-20 17:54:44,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c05cc25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:54:44, skipping insertion in model container [2024-11-20 17:54:44,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:54:44" (3/3) ... [2024-11-20 17:54:44,033 INFO L112 eAbstractionObserver]: Analyzing ICFG sorting_bubblesort_ground-2.i [2024-11-20 17:54:44,044 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 17:54:44,045 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-11-20 17:54:44,087 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 17:54:44,092 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;@62f7588c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 17:54:44,092 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-20 17:54:44,095 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 38 states have (on average 1.763157894736842) internal successors, (67), 54 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:44,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-20 17:54:44,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:54:44,099 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-20 17:54:44,100 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-20 17:54:44,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:54:44,104 INFO L85 PathProgramCache]: Analyzing trace with hash 28698728, now seen corresponding path program 1 times [2024-11-20 17:54:44,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:54:44,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474196132] [2024-11-20 17:54:44,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:54:44,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:54:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:54:44,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:54:44,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:54:44,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474196132] [2024-11-20 17:54:44,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474196132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:54:44,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:54:44,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:54:44,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588142549] [2024-11-20 17:54:44,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:54:44,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:54:44,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:54:44,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:54:44,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:54:44,302 INFO L87 Difference]: Start difference. First operand has 55 states, 38 states have (on average 1.763157894736842) internal successors, (67), 54 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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-11-20 17:54:44,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:54:44,361 INFO L93 Difference]: Finished difference Result 107 states and 131 transitions. [2024-11-20 17:54:44,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:54:44,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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-11-20 17:54:44,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:54:44,368 INFO L225 Difference]: With dead ends: 107 [2024-11-20 17:54:44,368 INFO L226 Difference]: Without dead ends: 52 [2024-11-20 17:54:44,370 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-11-20 17:54:44,373 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 1 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:54:44,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 157 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:54:44,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-20 17:54:44,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-20 17:54:44,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:44,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2024-11-20 17:54:44,397 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 5 [2024-11-20 17:54:44,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:54:44,397 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2024-11-20 17:54:44,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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-11-20 17:54:44,397 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2024-11-20 17:54:44,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-20 17:54:44,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:54:44,398 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2024-11-20 17:54:44,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 17:54:44,398 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-20 17:54:44,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:54:44,399 INFO L85 PathProgramCache]: Analyzing trace with hash -363792156, now seen corresponding path program 1 times [2024-11-20 17:54:44,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:54:44,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408779270] [2024-11-20 17:54:44,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:54:44,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:54:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:54:44,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:54:44,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:54:44,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408779270] [2024-11-20 17:54:44,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408779270] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:54:44,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274829743] [2024-11-20 17:54:44,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:54:44,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:54:44,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:54:44,524 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 17:54:44,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 17:54:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:54:44,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 17:54:44,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:54:44,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:54:44,646 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:54:44,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274829743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:54:44,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 17:54:44,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-20 17:54:44,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558422584] [2024-11-20 17:54:44,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:54:44,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:54:44,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:54:44,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:54:44,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-20 17:54:44,649 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:44,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:54:44,689 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2024-11-20 17:54:44,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:54:44,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-20 17:54:44,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:54:44,691 INFO L225 Difference]: With dead ends: 52 [2024-11-20 17:54:44,691 INFO L226 Difference]: Without dead ends: 51 [2024-11-20 17:54:44,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-20 17:54:44,692 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 1 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:54:44,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 180 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:54:44,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-20 17:54:44,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-20 17:54:44,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 50 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-11-20 17:54:44,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2024-11-20 17:54:44,699 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 9 [2024-11-20 17:54:44,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:54:44,699 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2024-11-20 17:54:44,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:44,700 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2024-11-20 17:54:44,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-20 17:54:44,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:54:44,700 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2024-11-20 17:54:44,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 17:54:44,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:54:44,901 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-20 17:54:44,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:54:44,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1607345098, now seen corresponding path program 1 times [2024-11-20 17:54:44,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:54:44,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470663899] [2024-11-20 17:54:44,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:54:44,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:54:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:54:44,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 17:54:44,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:54:44,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470663899] [2024-11-20 17:54:44,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470663899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:54:44,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:54:44,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:54:44,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84738208] [2024-11-20 17:54:44,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:54:44,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:54:44,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:54:44,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:54:44,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:54:44,959 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-11-20 17:54:44,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:54:44,978 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2024-11-20 17:54:44,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:54:44,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-20 17:54:44,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:54:44,981 INFO L225 Difference]: With dead ends: 51 [2024-11-20 17:54:44,981 INFO L226 Difference]: Without dead ends: 50 [2024-11-20 17:54:44,982 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-11-20 17:54:44,983 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 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-11-20 17:54:44,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:54:44,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-20 17:54:44,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2024-11-20 17:54:44,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 46 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:44,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2024-11-20 17:54:44,989 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 10 [2024-11-20 17:54:44,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:54:44,989 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2024-11-20 17:54:44,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-11-20 17:54:44,991 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2024-11-20 17:54:44,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-20 17:54:44,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:54:44,992 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:54:44,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 17:54:44,992 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-20 17:54:44,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:54:44,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1713503061, now seen corresponding path program 1 times [2024-11-20 17:54:44,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:54:44,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453217715] [2024-11-20 17:54:44,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:54:44,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:54:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:54:45,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:54:45,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:54:45,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453217715] [2024-11-20 17:54:45,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453217715] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:54:45,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770066452] [2024-11-20 17:54:45,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:54:45,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:54:45,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:54:45,077 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 17:54:45,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 17:54:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:54:45,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 17:54:45,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:54:45,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 17:54:45,127 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:54:45,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770066452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:54:45,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 17:54:45,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-20 17:54:45,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538797642] [2024-11-20 17:54:45,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:54:45,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:54:45,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:54:45,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:54:45,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:54:45,130 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:45,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:54:45,167 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2024-11-20 17:54:45,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:54:45,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-20 17:54:45,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:54:45,168 INFO L225 Difference]: With dead ends: 47 [2024-11-20 17:54:45,168 INFO L226 Difference]: Without dead ends: 43 [2024-11-20 17:54:45,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:54:45,169 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 9 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:54:45,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 60 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:54:45,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-20 17:54:45,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-20 17:54:45,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:45,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2024-11-20 17:54:45,177 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 11 [2024-11-20 17:54:45,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:54:45,178 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2024-11-20 17:54:45,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:45,178 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2024-11-20 17:54:45,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-20 17:54:45,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:54:45,179 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:54:45,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 17:54:45,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-20 17:54:45,386 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-20 17:54:45,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:54:45,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1579016867, now seen corresponding path program 1 times [2024-11-20 17:54:45,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:54:45,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920831242] [2024-11-20 17:54:45,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:54:45,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:54:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:54:45,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:54:45,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:54:45,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920831242] [2024-11-20 17:54:45,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920831242] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:54:45,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318037807] [2024-11-20 17:54:45,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:54:45,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:54:45,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:54:45,452 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 17:54:45,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 17:54:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:54:45,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 17:54:45,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:54:45,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 17:54:45,492 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:54:45,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318037807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:54:45,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 17:54:45,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-20 17:54:45,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956730186] [2024-11-20 17:54:45,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:54:45,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:54:45,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:54:45,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:54:45,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:54:45,495 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-11-20 17:54:45,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:54:45,503 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2024-11-20 17:54:45,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:54:45,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-11-20 17:54:45,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:54:45,505 INFO L225 Difference]: With dead ends: 78 [2024-11-20 17:54:45,505 INFO L226 Difference]: Without dead ends: 59 [2024-11-20 17:54:45,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:54:45,506 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 16 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:54:45,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 105 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:54:45,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-20 17:54:45,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2024-11-20 17:54:45,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 50 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:45,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2024-11-20 17:54:45,510 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 12 [2024-11-20 17:54:45,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:54:45,510 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2024-11-20 17:54:45,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-11-20 17:54:45,511 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2024-11-20 17:54:45,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-20 17:54:45,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:54:45,511 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:54:45,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-20 17:54:45,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:54:45,712 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-20 17:54:45,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:54:45,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1578987267, now seen corresponding path program 1 times [2024-11-20 17:54:45,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:54:45,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437246052] [2024-11-20 17:54:45,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:54:45,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:54:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:54:45,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:54:45,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:54:45,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437246052] [2024-11-20 17:54:45,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437246052] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:54:45,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400327204] [2024-11-20 17:54:45,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:54:45,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:54:45,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:54:45,772 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 17:54:45,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 17:54:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:54:45,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 17:54:45,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:54:45,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 17:54:45,825 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:54:45,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400327204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:54:45,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 17:54:45,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-20 17:54:45,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58884021] [2024-11-20 17:54:45,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:54:45,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:54:45,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:54:45,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:54:45,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:54:45,826 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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-11-20 17:54:45,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:54:45,860 INFO L93 Difference]: Finished difference Result 106 states and 130 transitions. [2024-11-20 17:54:45,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:54:45,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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-11-20 17:54:45,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:54:45,861 INFO L225 Difference]: With dead ends: 106 [2024-11-20 17:54:45,861 INFO L226 Difference]: Without dead ends: 63 [2024-11-20 17:54:45,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:54:45,863 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 8 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:54:45,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 66 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:54:45,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-20 17:54:45,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-20 17:54:45,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 62 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:45,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2024-11-20 17:54:45,868 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 12 [2024-11-20 17:54:45,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:54:45,869 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2024-11-20 17:54:45,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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-11-20 17:54:45,869 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2024-11-20 17:54:45,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-20 17:54:45,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:54:45,869 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:54:45,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-20 17:54:46,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:54:46,070 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-20 17:54:46,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:54:46,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1890774580, now seen corresponding path program 1 times [2024-11-20 17:54:46,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:54:46,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158065299] [2024-11-20 17:54:46,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:54:46,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:54:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:54:46,136 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-20 17:54:46,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:54:46,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158065299] [2024-11-20 17:54:46,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158065299] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:54:46,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388881715] [2024-11-20 17:54:46,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:54:46,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:54:46,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:54:46,140 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 17:54:46,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-20 17:54:46,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:54:46,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 17:54:46,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:54:46,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 17:54:46,196 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:54:46,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388881715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:54:46,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 17:54:46,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-20 17:54:46,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317433799] [2024-11-20 17:54:46,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:54:46,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:54:46,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:54:46,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:54:46,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:54:46,198 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:46,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:54:46,217 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2024-11-20 17:54:46,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:54:46,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-20 17:54:46,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:54:46,220 INFO L225 Difference]: With dead ends: 63 [2024-11-20 17:54:46,220 INFO L226 Difference]: Without dead ends: 59 [2024-11-20 17:54:46,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:54:46,221 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:54:46,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 61 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:54:46,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-20 17:54:46,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 48. [2024-11-20 17:54:46,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:46,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2024-11-20 17:54:46,228 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 18 [2024-11-20 17:54:46,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:54:46,228 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2024-11-20 17:54:46,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:46,229 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2024-11-20 17:54:46,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-20 17:54:46,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:54:46,229 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:54:46,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-20 17:54:46,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:54:46,431 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-20 17:54:46,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:54:46,431 INFO L85 PathProgramCache]: Analyzing trace with hash 395131169, now seen corresponding path program 1 times [2024-11-20 17:54:46,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:54:46,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005807320] [2024-11-20 17:54:46,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:54:46,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:54:46,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:54:46,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 17:54:46,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:54:46,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005807320] [2024-11-20 17:54:46,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005807320] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:54:46,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598963395] [2024-11-20 17:54:46,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:54:46,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:54:46,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:54:46,476 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 17:54:46,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-20 17:54:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:54:46,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 17:54:46,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:54:46,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-20 17:54:46,517 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:54:46,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598963395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:54:46,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 17:54:46,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-20 17:54:46,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876770701] [2024-11-20 17:54:46,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:54:46,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:54:46,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:54:46,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:54:46,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:54:46,518 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:46,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:54:46,531 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2024-11-20 17:54:46,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:54:46,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-20 17:54:46,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:54:46,532 INFO L225 Difference]: With dead ends: 61 [2024-11-20 17:54:46,532 INFO L226 Difference]: Without dead ends: 60 [2024-11-20 17:54:46,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:54:46,533 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 11 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:54:46,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 70 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:54:46,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-20 17:54:46,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 50. [2024-11-20 17:54:46,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 49 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:46,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2024-11-20 17:54:46,536 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 21 [2024-11-20 17:54:46,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:54:46,536 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2024-11-20 17:54:46,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:46,536 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2024-11-20 17:54:46,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-20 17:54:46,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:54:46,537 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:54:46,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-20 17:54:46,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:54:46,738 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-20 17:54:46,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:54:46,738 INFO L85 PathProgramCache]: Analyzing trace with hash -635835539, now seen corresponding path program 1 times [2024-11-20 17:54:46,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:54:46,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499331572] [2024-11-20 17:54:46,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:54:46,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:54:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:54:46,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 17:54:46,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:54:46,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499331572] [2024-11-20 17:54:46,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499331572] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:54:46,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322131682] [2024-11-20 17:54:46,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:54:46,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:54:46,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:54:46,783 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 17:54:46,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-20 17:54:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:54:46,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 17:54:46,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:54:46,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-20 17:54:46,832 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:54:46,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322131682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:54:46,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 17:54:46,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-20 17:54:46,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641913791] [2024-11-20 17:54:46,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:54:46,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:54:46,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:54:46,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:54:46,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:54:46,834 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 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-11-20 17:54:46,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:54:46,848 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2024-11-20 17:54:46,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:54:46,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 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) Word has length 22 [2024-11-20 17:54:46,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:54:46,849 INFO L225 Difference]: With dead ends: 61 [2024-11-20 17:54:46,849 INFO L226 Difference]: Without dead ends: 60 [2024-11-20 17:54:46,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:54:46,850 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:54:46,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 71 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:54:46,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-20 17:54:46,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2024-11-20 17:54:46,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.288888888888889) internal successors, (58), 50 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:46,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2024-11-20 17:54:46,852 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 22 [2024-11-20 17:54:46,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:54:46,853 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2024-11-20 17:54:46,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 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-11-20 17:54:46,853 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2024-11-20 17:54:46,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-20 17:54:46,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:54:46,853 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:54:46,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-20 17:54:47,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:54:47,054 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-20 17:54:47,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:54:47,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1370650903, now seen corresponding path program 1 times [2024-11-20 17:54:47,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:54:47,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856452863] [2024-11-20 17:54:47,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:54:47,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:54:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:54:47,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 17:54:47,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:54:47,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856452863] [2024-11-20 17:54:47,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856452863] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:54:47,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474887267] [2024-11-20 17:54:47,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:54:47,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:54:47,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:54:47,103 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 17:54:47,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-20 17:54:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:54:47,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 17:54:47,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:54:47,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 17:54:47,167 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:54:47,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 17:54:47,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474887267] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:54:47,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 17:54:47,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-20 17:54:47,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082268594] [2024-11-20 17:54:47,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 17:54:47,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 17:54:47,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:54:47,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 17:54:47,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-20 17:54:47,195 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:47,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:54:47,219 INFO L93 Difference]: Finished difference Result 103 states and 118 transitions. [2024-11-20 17:54:47,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 17:54:47,219 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-20 17:54:47,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:54:47,220 INFO L225 Difference]: With dead ends: 103 [2024-11-20 17:54:47,220 INFO L226 Difference]: Without dead ends: 59 [2024-11-20 17:54:47,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-20 17:54:47,221 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:54:47,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 225 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:54:47,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-20 17:54:47,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-20 17:54:47,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 58 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:47,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2024-11-20 17:54:47,228 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 25 [2024-11-20 17:54:47,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:54:47,228 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2024-11-20 17:54:47,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:47,228 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2024-11-20 17:54:47,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-20 17:54:47,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:54:47,229 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:54:47,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-20 17:54:47,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-20 17:54:47,430 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-20 17:54:47,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:54:47,430 INFO L85 PathProgramCache]: Analyzing trace with hash 2024267233, now seen corresponding path program 2 times [2024-11-20 17:54:47,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:54:47,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46655397] [2024-11-20 17:54:47,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:54:47,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:54:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:54:47,471 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-20 17:54:47,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:54:47,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46655397] [2024-11-20 17:54:47,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46655397] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:54:47,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717358147] [2024-11-20 17:54:47,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 17:54:47,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:54:47,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:54:47,473 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 17:54:47,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-20 17:54:47,512 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 17:54:47,513 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:54:47,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 17:54:47,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:54:47,531 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-20 17:54:47,531 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:54:47,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717358147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:54:47,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 17:54:47,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-20 17:54:47,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729558297] [2024-11-20 17:54:47,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:54:47,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:54:47,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:54:47,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:54:47,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:54:47,533 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:47,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:54:47,564 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2024-11-20 17:54:47,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:54:47,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-20 17:54:47,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:54:47,565 INFO L225 Difference]: With dead ends: 90 [2024-11-20 17:54:47,565 INFO L226 Difference]: Without dead ends: 72 [2024-11-20 17:54:47,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-20 17:54:47,566 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 17 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:54:47,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 103 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:54:47,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-20 17:54:47,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2024-11-20 17:54:47,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 59 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:47,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2024-11-20 17:54:47,572 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 33 [2024-11-20 17:54:47,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:54:47,573 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2024-11-20 17:54:47,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:47,573 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2024-11-20 17:54:47,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-20 17:54:47,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:54:47,574 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:54:47,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-20 17:54:47,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:54:47,775 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-20 17:54:47,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:54:47,775 INFO L85 PathProgramCache]: Analyzing trace with hash -297891803, now seen corresponding path program 1 times [2024-11-20 17:54:47,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:54:47,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272956637] [2024-11-20 17:54:47,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:54:47,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:54:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:54:47,835 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-20 17:54:47,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:54:47,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272956637] [2024-11-20 17:54:47,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272956637] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:54:47,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206486268] [2024-11-20 17:54:47,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:54:47,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:54:47,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:54:47,837 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 17:54:47,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-20 17:54:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:54:47,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 17:54:47,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:54:47,959 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 17:54:47,959 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:54:48,060 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 17:54:48,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206486268] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:54:48,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 17:54:48,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 9] total 18 [2024-11-20 17:54:48,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721200765] [2024-11-20 17:54:48,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 17:54:48,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-20 17:54:48,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:54:48,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-20 17:54:48,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-11-20 17:54:48,063 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 18 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:48,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:54:48,158 INFO L93 Difference]: Finished difference Result 148 states and 170 transitions. [2024-11-20 17:54:48,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-20 17:54:48,158 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 18 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-20 17:54:48,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:54:48,159 INFO L225 Difference]: With dead ends: 148 [2024-11-20 17:54:48,159 INFO L226 Difference]: Without dead ends: 103 [2024-11-20 17:54:48,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-11-20 17:54:48,160 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 17 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 17:54:48,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 187 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 17:54:48,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-20 17:54:48,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 89. [2024-11-20 17:54:48,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 88 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:48,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2024-11-20 17:54:48,165 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 35 [2024-11-20 17:54:48,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:54:48,165 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2024-11-20 17:54:48,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 18 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:48,166 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2024-11-20 17:54:48,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-20 17:54:48,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:54:48,167 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:54:48,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-20 17:54:48,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-20 17:54:48,368 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-20 17:54:48,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:54:48,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1765397658, now seen corresponding path program 2 times [2024-11-20 17:54:48,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:54:48,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637004700] [2024-11-20 17:54:48,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:54:48,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:54:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:54:48,467 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-20 17:54:48,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:54:48,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637004700] [2024-11-20 17:54:48,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637004700] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:54:48,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028772117] [2024-11-20 17:54:48,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 17:54:48,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:54:48,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:54:48,470 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 17:54:48,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-20 17:54:48,514 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 17:54:48,515 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:54:48,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 17:54:48,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:54:48,544 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-20 17:54:48,545 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:54:48,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028772117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:54:48,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 17:54:48,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-20 17:54:48,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682940255] [2024-11-20 17:54:48,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:54:48,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:54:48,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:54:48,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:54:48,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-20 17:54:48,547 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:48,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:54:48,584 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2024-11-20 17:54:48,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:54:48,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-20 17:54:48,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:54:48,584 INFO L225 Difference]: With dead ends: 98 [2024-11-20 17:54:48,584 INFO L226 Difference]: Without dead ends: 97 [2024-11-20 17:54:48,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-20 17:54:48,585 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:54:48,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 128 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:54:48,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-20 17:54:48,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2024-11-20 17:54:48,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 89 states have (on average 1.1797752808988764) internal successors, (105), 94 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:48,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2024-11-20 17:54:48,589 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 57 [2024-11-20 17:54:48,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:54:48,589 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2024-11-20 17:54:48,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:48,589 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2024-11-20 17:54:48,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-20 17:54:48,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:54:48,590 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:54:48,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-20 17:54:48,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-20 17:54:48,791 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-20 17:54:48,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:54:48,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1107247590, now seen corresponding path program 1 times [2024-11-20 17:54:48,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:54:48,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038857218] [2024-11-20 17:54:48,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:54:48,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:54:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:54:48,859 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-20 17:54:48,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:54:48,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038857218] [2024-11-20 17:54:48,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038857218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:54:48,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:54:48,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:54:48,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086000791] [2024-11-20 17:54:48,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:54:48,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:54:48,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:54:48,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:54:48,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:54:48,861 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:48,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:54:48,870 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2024-11-20 17:54:48,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:54:48,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 58 [2024-11-20 17:54:48,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:54:48,871 INFO L225 Difference]: With dead ends: 95 [2024-11-20 17:54:48,871 INFO L226 Difference]: Without dead ends: 94 [2024-11-20 17:54:48,871 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-11-20 17:54:48,872 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:54:48,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:54:48,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-20 17:54:48,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-20 17:54:48,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 89 states have (on average 1.1573033707865168) internal successors, (103), 93 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:48,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2024-11-20 17:54:48,875 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 58 [2024-11-20 17:54:48,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:54:48,875 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2024-11-20 17:54:48,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:48,875 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2024-11-20 17:54:48,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-20 17:54:48,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:54:48,876 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:54:48,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 17:54:48,876 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-20 17:54:48,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:54:48,876 INFO L85 PathProgramCache]: Analyzing trace with hash 664236496, now seen corresponding path program 1 times [2024-11-20 17:54:48,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:54:48,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796653937] [2024-11-20 17:54:48,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:54:48,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:54:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:54:48,936 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-11-20 17:54:48,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:54:48,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796653937] [2024-11-20 17:54:48,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796653937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:54:48,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:54:48,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:54:48,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193961727] [2024-11-20 17:54:48,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:54:48,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:54:48,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:54:48,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:54:48,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:54:48,938 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:48,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:54:48,961 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2024-11-20 17:54:48,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:54:48,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-20 17:54:48,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:54:48,963 INFO L225 Difference]: With dead ends: 99 [2024-11-20 17:54:48,963 INFO L226 Difference]: Without dead ends: 97 [2024-11-20 17:54:48,963 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-11-20 17:54:48,963 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 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.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:54:48,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:54:48,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-20 17:54:48,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-20 17:54:48,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.1521739130434783) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:48,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2024-11-20 17:54:48,972 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 61 [2024-11-20 17:54:48,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:54:48,972 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2024-11-20 17:54:48,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:48,972 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2024-11-20 17:54:48,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-20 17:54:48,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:54:48,973 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:54:48,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 17:54:48,974 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-20 17:54:48,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:54:48,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1355265286, now seen corresponding path program 1 times [2024-11-20 17:54:48,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:54:48,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557171590] [2024-11-20 17:54:48,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:54:48,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:54:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:54:49,055 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-11-20 17:54:49,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:54:49,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557171590] [2024-11-20 17:54:49,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557171590] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:54:49,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133064715] [2024-11-20 17:54:49,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:54:49,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:54:49,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:54:49,058 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 17:54:49,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-20 17:54:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:54:49,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-20 17:54:49,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:54:49,276 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-20 17:54:49,276 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:54:49,557 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-20 17:54:49,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133064715] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:54:49,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 17:54:49,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 17, 17] total 35 [2024-11-20 17:54:49,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213988520] [2024-11-20 17:54:49,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 17:54:49,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-20 17:54:49,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:54:49,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-20 17:54:49,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=912, Unknown=0, NotChecked=0, Total=1190 [2024-11-20 17:54:49,559 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:49,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:54:49,695 INFO L93 Difference]: Finished difference Result 206 states and 234 transitions. [2024-11-20 17:54:49,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-20 17:54:49,695 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 64 [2024-11-20 17:54:49,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:54:49,696 INFO L225 Difference]: With dead ends: 206 [2024-11-20 17:54:49,696 INFO L226 Difference]: Without dead ends: 140 [2024-11-20 17:54:49,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=278, Invalid=912, Unknown=0, NotChecked=0, Total=1190 [2024-11-20 17:54:49,697 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 12 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 17:54:49,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 428 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 17:54:49,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-20 17:54:49,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 131. [2024-11-20 17:54:49,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 126 states have (on average 1.1111111111111112) internal successors, (140), 130 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:49,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2024-11-20 17:54:49,701 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 64 [2024-11-20 17:54:49,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:54:49,701 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2024-11-20 17:54:49,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:49,701 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2024-11-20 17:54:49,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-20 17:54:49,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:54:49,702 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:54:49,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-20 17:54:49,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-20 17:54:49,907 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-20 17:54:49,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:54:49,907 INFO L85 PathProgramCache]: Analyzing trace with hash 611850248, now seen corresponding path program 1 times [2024-11-20 17:54:49,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:54:49,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593403460] [2024-11-20 17:54:49,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:54:49,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:54:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:54:49,967 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 446 trivial. 0 not checked. [2024-11-20 17:54:49,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:54:49,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593403460] [2024-11-20 17:54:49,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593403460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:54:49,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:54:49,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 17:54:49,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969189399] [2024-11-20 17:54:49,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:54:49,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:54:49,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:54:49,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:54:49,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:54:49,972 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:49,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:54:49,982 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2024-11-20 17:54:49,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:54:49,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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 97 [2024-11-20 17:54:49,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:54:49,983 INFO L225 Difference]: With dead ends: 131 [2024-11-20 17:54:49,983 INFO L226 Difference]: Without dead ends: 130 [2024-11-20 17:54:49,984 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-11-20 17:54:49,984 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 9 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:54:49,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 60 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:54:49,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-20 17:54:49,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-20 17:54:49,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 126 states have (on average 1.1031746031746033) internal successors, (139), 129 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:49,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2024-11-20 17:54:49,988 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 97 [2024-11-20 17:54:49,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:54:49,988 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2024-11-20 17:54:49,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:49,989 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2024-11-20 17:54:49,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-20 17:54:49,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:54:49,989 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:54:49,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 17:54:49,989 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-20 17:54:49,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:54:49,990 INFO L85 PathProgramCache]: Analyzing trace with hash -210349970, now seen corresponding path program 1 times [2024-11-20 17:54:49,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:54:49,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007171689] [2024-11-20 17:54:49,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:54:49,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:54:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:54:50,059 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2024-11-20 17:54:50,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:54:50,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007171689] [2024-11-20 17:54:50,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007171689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:54:50,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:54:50,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:54:50,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030332995] [2024-11-20 17:54:50,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:54:50,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:54:50,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:54:50,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:54:50,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:54:50,061 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:50,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:54:50,075 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2024-11-20 17:54:50,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:54:50,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-11-20 17:54:50,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:54:50,076 INFO L225 Difference]: With dead ends: 130 [2024-11-20 17:54:50,076 INFO L226 Difference]: Without dead ends: 128 [2024-11-20 17:54:50,076 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-11-20 17:54:50,077 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 9 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:54:50,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 83 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:54:50,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-20 17:54:50,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2024-11-20 17:54:50,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 124 states have (on average 1.0887096774193548) internal successors, (135), 125 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:50,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2024-11-20 17:54:50,081 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 100 [2024-11-20 17:54:50,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:54:50,081 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2024-11-20 17:54:50,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:50,081 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2024-11-20 17:54:50,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-20 17:54:50,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:54:50,082 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:54:50,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 17:54:50,082 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-20 17:54:50,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:54:50,083 INFO L85 PathProgramCache]: Analyzing trace with hash 2069085670, now seen corresponding path program 1 times [2024-11-20 17:54:50,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:54:50,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192342541] [2024-11-20 17:54:50,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:54:50,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:54:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:54:50,143 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 446 trivial. 0 not checked. [2024-11-20 17:54:50,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:54:50,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192342541] [2024-11-20 17:54:50,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192342541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:54:50,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:54:50,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:54:50,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238943743] [2024-11-20 17:54:50,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:54:50,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:54:50,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:54:50,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:54:50,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:54:50,145 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:50,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:54:50,158 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2024-11-20 17:54:50,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:54:50,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 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 101 [2024-11-20 17:54:50,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:54:50,159 INFO L225 Difference]: With dead ends: 126 [2024-11-20 17:54:50,159 INFO L226 Difference]: Without dead ends: 125 [2024-11-20 17:54:50,159 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-11-20 17:54:50,159 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:54:50,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 83 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:54:50,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-20 17:54:50,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2024-11-20 17:54:50,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.0826446280991735) internal successors, (131), 121 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:50,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2024-11-20 17:54:50,163 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 101 [2024-11-20 17:54:50,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:54:50,163 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2024-11-20 17:54:50,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:50,164 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2024-11-20 17:54:50,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-20 17:54:50,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:54:50,164 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:54:50,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 17:54:50,164 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-20 17:54:50,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:54:50,165 INFO L85 PathProgramCache]: Analyzing trace with hash -281375886, now seen corresponding path program 1 times [2024-11-20 17:54:50,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:54:50,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950997201] [2024-11-20 17:54:50,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:54:50,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:54:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:54:50,244 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-11-20 17:54:50,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:54:50,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950997201] [2024-11-20 17:54:50,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950997201] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:54:50,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850637961] [2024-11-20 17:54:50,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:54:50,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:54:50,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:54:50,247 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 17:54:50,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-20 17:54:50,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:54:50,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-20 17:54:50,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:54:50,802 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-20 17:54:50,802 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:54:51,604 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-20 17:54:51,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850637961] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:54:51,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 17:54:51,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 33, 33] total 67 [2024-11-20 17:54:51,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301558179] [2024-11-20 17:54:51,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 17:54:51,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2024-11-20 17:54:51,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:54:51,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2024-11-20 17:54:51,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1065, Invalid=3357, Unknown=0, NotChecked=0, Total=4422 [2024-11-20 17:54:51,609 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand has 67 states, 67 states have (on average 2.5671641791044775) internal successors, (172), 67 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:51,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:54:51,797 INFO L93 Difference]: Finished difference Result 275 states and 314 transitions. [2024-11-20 17:54:51,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-11-20 17:54:51,798 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.5671641791044775) internal successors, (172), 67 states have internal predecessors, (172), 0 states have call successors, (0), 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 102 [2024-11-20 17:54:51,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:54:51,799 INFO L225 Difference]: With dead ends: 275 [2024-11-20 17:54:51,799 INFO L226 Difference]: Without dead ends: 216 [2024-11-20 17:54:51,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1233 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1065, Invalid=3357, Unknown=0, NotChecked=0, Total=4422 [2024-11-20 17:54:51,800 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 32 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 17:54:51,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 201 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 17:54:51,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-20 17:54:51,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 202. [2024-11-20 17:54:51,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 1.0597014925373134) internal successors, (213), 201 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:51,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 213 transitions. [2024-11-20 17:54:51,804 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 213 transitions. Word has length 102 [2024-11-20 17:54:51,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:54:51,805 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 213 transitions. [2024-11-20 17:54:51,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 2.5671641791044775) internal successors, (172), 67 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:51,805 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 213 transitions. [2024-11-20 17:54:51,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-20 17:54:51,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:54:51,806 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 31, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:54:51,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-20 17:54:52,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-11-20 17:54:52,011 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-20 17:54:52,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:54:52,011 INFO L85 PathProgramCache]: Analyzing trace with hash -2088378687, now seen corresponding path program 2 times [2024-11-20 17:54:52,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:54:52,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963489596] [2024-11-20 17:54:52,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:54:52,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:54:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:54:52,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1923 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 1901 trivial. 0 not checked. [2024-11-20 17:54:52,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:54:52,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963489596] [2024-11-20 17:54:52,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963489596] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:54:52,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307552596] [2024-11-20 17:54:52,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 17:54:52,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:54:52,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:54:52,172 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 17:54:52,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-20 17:54:52,251 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 17:54:52,251 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:54:52,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 17:54:52,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:54:52,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1923 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1916 trivial. 0 not checked. [2024-11-20 17:54:52,282 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:54:52,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307552596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:54:52,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 17:54:52,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-11-20 17:54:52,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470643133] [2024-11-20 17:54:52,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:54:52,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:54:52,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:54:52,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:54:52,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-20 17:54:52,283 INFO L87 Difference]: Start difference. First operand 202 states and 213 transitions. Second operand has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:52,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:54:52,315 INFO L93 Difference]: Finished difference Result 202 states and 213 transitions. [2024-11-20 17:54:52,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:54:52,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 172 [2024-11-20 17:54:52,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:54:52,316 INFO L225 Difference]: With dead ends: 202 [2024-11-20 17:54:52,316 INFO L226 Difference]: Without dead ends: 0 [2024-11-20 17:54:52,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-20 17:54:52,317 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 10 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:54:52,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 102 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:54:52,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-20 17:54:52,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-20 17:54:52,320 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-11-20 17:54:52,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-20 17:54:52,320 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 172 [2024-11-20 17:54:52,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:54:52,320 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 17:54:52,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:54:52,320 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-20 17:54:52,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-20 17:54:52,322 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2024-11-20 17:54:52,323 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2024-11-20 17:54:52,323 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2024-11-20 17:54:52,323 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2024-11-20 17:54:52,323 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2024-11-20 17:54:52,323 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2024-11-20 17:54:52,323 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2024-11-20 17:54:52,324 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2024-11-20 17:54:52,324 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2024-11-20 17:54:52,324 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2024-11-20 17:54:52,324 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2024-11-20 17:54:52,324 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2024-11-20 17:54:52,324 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2024-11-20 17:54:52,324 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2024-11-20 17:54:52,324 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2024-11-20 17:54:52,325 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2024-11-20 17:54:52,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-20 17:54:52,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:54:52,532 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:54:52,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-20 17:54:52,582 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 17:54:52,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:54:52 BoogieIcfgContainer [2024-11-20 17:54:52,596 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 17:54:52,596 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 17:54:52,596 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 17:54:52,596 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 17:54:52,597 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:54:44" (3/4) ... [2024-11-20 17:54:52,598 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 17:54:52,604 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-20 17:54:52,604 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-20 17:54:52,605 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-20 17:54:52,605 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 17:54:52,681 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 17:54:52,682 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 17:54:52,682 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 17:54:52,682 INFO L158 Benchmark]: Toolchain (without parser) took 9233.71ms. Allocated memory was 174.1MB in the beginning and 243.3MB in the end (delta: 69.2MB). Free memory was 118.1MB in the beginning and 154.2MB in the end (delta: -36.1MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. [2024-11-20 17:54:52,683 INFO L158 Benchmark]: CDTParser took 0.71ms. Allocated memory is still 174.1MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 17:54:52,683 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.19ms. Allocated memory is still 174.1MB. Free memory was 118.1MB in the beginning and 105.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 17:54:52,685 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.37ms. Allocated memory is still 174.1MB. Free memory was 105.6MB in the beginning and 103.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 17:54:52,686 INFO L158 Benchmark]: Boogie Preprocessor took 29.12ms. Allocated memory is still 174.1MB. Free memory was 103.8MB in the beginning and 101.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 17:54:52,686 INFO L158 Benchmark]: RCFGBuilder took 317.66ms. Allocated memory is still 174.1MB. Free memory was 101.8MB in the beginning and 87.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 17:54:52,686 INFO L158 Benchmark]: TraceAbstraction took 8567.53ms. Allocated memory was 174.1MB in the beginning and 243.3MB in the end (delta: 69.2MB). Free memory was 86.7MB in the beginning and 159.5MB in the end (delta: -72.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 17:54:52,686 INFO L158 Benchmark]: Witness Printer took 85.99ms. Allocated memory is still 243.3MB. Free memory was 159.5MB in the beginning and 154.2MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 17:54:52,687 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.71ms. Allocated memory is still 174.1MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 191.19ms. Allocated memory is still 174.1MB. Free memory was 118.1MB in the beginning and 105.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.37ms. Allocated memory is still 174.1MB. Free memory was 105.6MB in the beginning and 103.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.12ms. Allocated memory is still 174.1MB. Free memory was 103.8MB in the beginning and 101.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 317.66ms. Allocated memory is still 174.1MB. Free memory was 101.8MB in the beginning and 87.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8567.53ms. Allocated memory was 174.1MB in the beginning and 243.3MB in the end (delta: 69.2MB). Free memory was 86.7MB in the beginning and 159.5MB in the end (delta: -72.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 85.99ms. Allocated memory is still 243.3MB. Free memory was 159.5MB in the beginning and 154.2MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 55 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 8.5s, OverallIterations: 21, TraceHistogramMax: 31, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 190 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 190 mSDsluCounter, 2711 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1927 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1051 IncrementalHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 784 mSDtfsCounter, 1051 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 894 GetRequests, 707 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1565 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=202occurred in iteration=20, InterpolantAutomatonStates: 189, 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, 21 MinimizatonAttempts, 97 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1618 NumberOfCodeBlocks, 1396 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1805 ConstructedInterpolants, 0 QuantifiedInterpolants, 2635 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1286 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 39 InterpolantComputations, 17 PerfectInterpolantSequences, 6266/7401 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 16 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (((0 <= (2147483649 + x)) && (x <= 99999)) && (0 <= (y + 2147483648))) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((0 < j) || (j == 0)) - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: (0 < (2147483650 + x)) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (0 < i) RESULT: Ultimate proved your program to be correct! [2024-11-20 17:54:52,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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