./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test18_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/ldv-memsafety/memleaks_test18_1.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 12544117846b274bd1cb12a6694f8fda1d77f0b1327b2e9a353cfe44563b100a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 11:21:29,438 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:21:29,502 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 11:21:29,508 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:21:29,509 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:21:29,540 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:21:29,541 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:21:29,541 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:21:29,542 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:21:29,543 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:21:29,543 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:21:29,543 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:21:29,544 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:21:29,544 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:21:29,545 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:21:29,545 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:21:29,545 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:21:29,546 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 11:21:29,549 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:21:29,550 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 11:21:29,550 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:21:29,550 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:21:29,551 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:21:29,551 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:21:29,551 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:21:29,552 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:21:29,552 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:21:29,552 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 11:21:29,552 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:21:29,553 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:21:29,553 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:21:29,553 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:21:29,554 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:21:29,554 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:21:29,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:21:29,555 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:21:29,555 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:21:29,556 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:21:29,556 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:21:29,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:21:29,557 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:21:29,557 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:21:29,557 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:21:29,558 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:21:29,558 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 -> 12544117846b274bd1cb12a6694f8fda1d77f0b1327b2e9a353cfe44563b100a [2024-11-09 11:21:29,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:21:29,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:21:29,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:21:29,863 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:21:29,863 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:21:29,864 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test18_1.i [2024-11-09 11:21:31,348 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:21:31,623 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:21:31,624 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test18_1.i [2024-11-09 11:21:31,647 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6038a3881/00dbd8bae5664c7eacb9ddce98924e2c/FLAGca45be124 [2024-11-09 11:21:31,660 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6038a3881/00dbd8bae5664c7eacb9ddce98924e2c [2024-11-09 11:21:31,662 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:21:31,663 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:21:31,666 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:21:31,666 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:21:31,672 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:21:31,673 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:21:31" (1/1) ... [2024-11-09 11:21:31,676 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f13e32a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:21:31, skipping insertion in model container [2024-11-09 11:21:31,676 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:21:31" (1/1) ... [2024-11-09 11:21:31,721 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:21:32,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:21:32,187 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:21:32,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:21:32,306 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:21:32,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:21:32 WrapperNode [2024-11-09 11:21:32,307 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:21:32,308 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:21:32,308 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:21:32,308 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:21:32,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:21:32" (1/1) ... [2024-11-09 11:21:32,340 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:21:32" (1/1) ... [2024-11-09 11:21:32,370 INFO L138 Inliner]: procedures = 164, calls = 72, calls flagged for inlining = 21, calls inlined = 3, statements flattened = 50 [2024-11-09 11:21:32,371 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:21:32,372 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:21:32,372 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:21:32,372 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:21:32,384 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:21:32" (1/1) ... [2024-11-09 11:21:32,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:21:32" (1/1) ... [2024-11-09 11:21:32,387 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:21:32" (1/1) ... [2024-11-09 11:21:32,408 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-09 11:21:32,409 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:21:32" (1/1) ... [2024-11-09 11:21:32,409 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:21:32" (1/1) ... [2024-11-09 11:21:32,417 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:21:32" (1/1) ... [2024-11-09 11:21:32,420 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:21:32" (1/1) ... [2024-11-09 11:21:32,424 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:21:32" (1/1) ... [2024-11-09 11:21:32,427 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:21:32" (1/1) ... [2024-11-09 11:21:32,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:21:32,434 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:21:32,434 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:21:32,434 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:21:32,435 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:21:32" (1/1) ... [2024-11-09 11:21:32,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:21:32,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:21:32,469 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-09 11:21:32,472 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-09 11:21:32,525 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-09 11:21:32,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-09 11:21:32,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 11:21:32,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 11:21:32,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 11:21:32,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 11:21:32,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 11:21:32,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 11:21:32,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 11:21:32,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 11:21:32,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 11:21:32,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:21:32,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:21:32,639 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:21:32,640 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:21:32,764 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-09 11:21:32,766 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:21:32,780 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:21:32,781 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 11:21:32,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:21:32 BoogieIcfgContainer [2024-11-09 11:21:32,782 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:21:32,783 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:21:32,784 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:21:32,787 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:21:32,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:21:31" (1/3) ... [2024-11-09 11:21:32,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fcbf8af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:21:32, skipping insertion in model container [2024-11-09 11:21:32,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:21:32" (2/3) ... [2024-11-09 11:21:32,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fcbf8af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:21:32, skipping insertion in model container [2024-11-09 11:21:32,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:21:32" (3/3) ... [2024-11-09 11:21:32,789 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test18_1.i [2024-11-09 11:21:32,807 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:21:32,808 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-09 11:21:32,875 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:21:32,880 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;@5ea750ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:21:32,880 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-09 11:21:32,884 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:21:32,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 11:21:32,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:21:32,890 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:21:32,891 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 11:21:32,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:21:32,896 INFO L85 PathProgramCache]: Analyzing trace with hash 200136568, now seen corresponding path program 1 times [2024-11-09 11:21:32,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:21:32,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650820247] [2024-11-09 11:21:32,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:21:32,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:21:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:33,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:21:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:33,301 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-09 11:21:33,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:21:33,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650820247] [2024-11-09 11:21:33,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650820247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:21:33,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:21:33,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:21:33,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905578229] [2024-11-09 11:21:33,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:21:33,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:21:33,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:21:33,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:21:33,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:21:33,341 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:21:33,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:21:33,572 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2024-11-09 11:21:33,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:21:33,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-09 11:21:33,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:21:33,583 INFO L225 Difference]: With dead ends: 67 [2024-11-09 11:21:33,583 INFO L226 Difference]: Without dead ends: 47 [2024-11-09 11:21:33,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:21:33,591 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 31 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:21:33,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 102 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:21:33,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-09 11:21:33,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2024-11-09 11:21:33,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:21:33,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2024-11-09 11:21:33,628 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 11 [2024-11-09 11:21:33,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:21:33,628 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2024-11-09 11:21:33,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:21:33,629 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2024-11-09 11:21:33,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 11:21:33,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:21:33,631 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:21:33,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:21:33,631 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 11:21:33,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:21:33,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1822623141, now seen corresponding path program 1 times [2024-11-09 11:21:33,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:21:33,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759556299] [2024-11-09 11:21:33,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:21:33,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:21:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:33,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:21:33,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:33,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:21:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:33,842 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:21:33,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:21:33,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759556299] [2024-11-09 11:21:33,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759556299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:21:33,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:21:33,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:21:33,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696223154] [2024-11-09 11:21:33,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:21:33,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:21:33,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:21:33,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:21:33,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:21:33,856 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:21:33,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:21:33,935 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2024-11-09 11:21:33,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:21:33,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-11-09 11:21:33,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:21:33,938 INFO L225 Difference]: With dead ends: 41 [2024-11-09 11:21:33,938 INFO L226 Difference]: Without dead ends: 39 [2024-11-09 11:21:33,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:21:33,941 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:21:33,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 90 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:21:33,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-09 11:21:33,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2024-11-09 11:21:33,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 32 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:21:33,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-11-09 11:21:33,955 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 19 [2024-11-09 11:21:33,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:21:33,956 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-11-09 11:21:33,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:21:33,956 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-11-09 11:21:33,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 11:21:33,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:21:33,957 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:21:33,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 11:21:33,958 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 11:21:33,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:21:33,960 INFO L85 PathProgramCache]: Analyzing trace with hash -838035494, now seen corresponding path program 1 times [2024-11-09 11:21:33,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:21:33,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896976612] [2024-11-09 11:21:33,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:21:33,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:21:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:34,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:21:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:34,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:21:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:34,152 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-09 11:21:34,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:21:34,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896976612] [2024-11-09 11:21:34,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896976612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:21:34,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:21:34,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 11:21:34,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605456065] [2024-11-09 11:21:34,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:21:34,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:21:34,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:21:34,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:21:34,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:21:34,157 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:21:34,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:21:34,205 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2024-11-09 11:21:34,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:21:34,206 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-09 11:21:34,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:21:34,208 INFO L225 Difference]: With dead ends: 55 [2024-11-09 11:21:34,208 INFO L226 Difference]: Without dead ends: 43 [2024-11-09 11:21:34,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:21:34,210 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 3 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:21:34,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 144 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:21:34,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-09 11:21:34,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-09 11:21:34,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 32 states have (on average 1.3125) internal successors, (42), 36 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 11:21:34,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2024-11-09 11:21:34,225 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 22 [2024-11-09 11:21:34,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:21:34,225 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2024-11-09 11:21:34,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:21:34,226 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2024-11-09 11:21:34,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 11:21:34,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:21:34,227 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:21:34,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 11:21:34,228 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 11:21:34,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:21:34,229 INFO L85 PathProgramCache]: Analyzing trace with hash -789372421, now seen corresponding path program 1 times [2024-11-09 11:21:34,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:21:34,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970242975] [2024-11-09 11:21:34,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:21:34,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:21:34,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:34,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:21:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:34,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:21:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:34,365 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:21:34,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:21:34,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970242975] [2024-11-09 11:21:34,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970242975] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:21:34,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316225350] [2024-11-09 11:21:34,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:21:34,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:21:34,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:21:34,369 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-09 11:21:34,371 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-09 11:21:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:34,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:21:34,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:21:34,535 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:21:34,536 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:21:34,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316225350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:21:34,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:21:34,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-11-09 11:21:34,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636654909] [2024-11-09 11:21:34,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:21:34,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:21:34,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:21:34,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:21:34,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:21:34,538 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:21:34,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:21:34,586 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2024-11-09 11:21:34,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:21:34,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2024-11-09 11:21:34,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:21:34,587 INFO L225 Difference]: With dead ends: 43 [2024-11-09 11:21:34,587 INFO L226 Difference]: Without dead ends: 41 [2024-11-09 11:21:34,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:21:34,589 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 80 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-09 11:21:34,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 80 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:21:34,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-09 11:21:34,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-09 11:21:34,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.25) internal successors, (40), 34 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 11:21:34,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2024-11-09 11:21:34,595 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 22 [2024-11-09 11:21:34,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:21:34,596 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-11-09 11:21:34,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:21:34,596 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2024-11-09 11:21:34,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 11:21:34,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:21:34,597 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:21:34,618 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-09 11:21:34,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:21:34,802 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 11:21:34,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:21:34,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1034548999, now seen corresponding path program 1 times [2024-11-09 11:21:34,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:21:34,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132166519] [2024-11-09 11:21:34,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:21:34,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:21:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:34,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:21:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:34,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:21:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:34,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:21:34,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:21:34,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132166519] [2024-11-09 11:21:34,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132166519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:21:34,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:21:34,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:21:34,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003882965] [2024-11-09 11:21:34,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:21:34,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:21:34,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:21:34,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:21:34,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:21:34,891 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:21:34,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:21:34,947 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2024-11-09 11:21:34,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:21:34,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2024-11-09 11:21:34,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:21:34,949 INFO L225 Difference]: With dead ends: 48 [2024-11-09 11:21:34,949 INFO L226 Difference]: Without dead ends: 39 [2024-11-09 11:21:34,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:21:34,950 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 4 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:21:34,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 93 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:21:34,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-09 11:21:34,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2024-11-09 11:21:34,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.25) internal successors, (35), 31 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 11:21:34,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2024-11-09 11:21:34,958 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 22 [2024-11-09 11:21:34,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:21:34,959 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2024-11-09 11:21:34,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:21:34,959 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2024-11-09 11:21:34,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 11:21:34,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:21:34,960 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:21:34,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 11:21:34,962 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 11:21:34,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:21:34,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1299258798, now seen corresponding path program 1 times [2024-11-09 11:21:34,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:21:34,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650990028] [2024-11-09 11:21:34,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:21:34,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:21:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:35,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:21:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:35,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:21:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:35,053 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:21:35,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:21:35,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650990028] [2024-11-09 11:21:35,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650990028] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:21:35,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073274708] [2024-11-09 11:21:35,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:21:35,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:21:35,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:21:35,056 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-09 11:21:35,058 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-09 11:21:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:35,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 11:21:35,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:21:35,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:21:35,168 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:21:35,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073274708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:21:35,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:21:35,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-09 11:21:35,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924329794] [2024-11-09 11:21:35,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:21:35,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:21:35,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:21:35,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:21:35,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:21:35,170 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:21:35,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:21:35,183 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2024-11-09 11:21:35,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:21:35,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-11-09 11:21:35,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:21:35,187 INFO L225 Difference]: With dead ends: 37 [2024-11-09 11:21:35,187 INFO L226 Difference]: Without dead ends: 36 [2024-11-09 11:21:35,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:21:35,188 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 5 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:21:35,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 39 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:21:35,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-09 11:21:35,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-09 11:21:35,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 11:21:35,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2024-11-09 11:21:35,194 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 23 [2024-11-09 11:21:35,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:21:35,194 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2024-11-09 11:21:35,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:21:35,194 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2024-11-09 11:21:35,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 11:21:35,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:21:35,195 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:21:35,211 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-09 11:21:35,396 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,SelfDestructingSolverStorable5 [2024-11-09 11:21:35,396 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 11:21:35,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:21:35,397 INFO L85 PathProgramCache]: Analyzing trace with hash -26339835, now seen corresponding path program 1 times [2024-11-09 11:21:35,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:21:35,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221797117] [2024-11-09 11:21:35,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:21:35,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:21:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:35,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:21:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:35,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:21:35,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:35,471 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 11:21:35,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:21:35,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221797117] [2024-11-09 11:21:35,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221797117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:21:35,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:21:35,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:21:35,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297393960] [2024-11-09 11:21:35,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:21:35,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:21:35,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:21:35,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:21:35,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:21:35,474 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:21:35,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:21:35,502 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2024-11-09 11:21:35,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:21:35,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-09 11:21:35,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:21:35,505 INFO L225 Difference]: With dead ends: 36 [2024-11-09 11:21:35,505 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 11:21:35,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:21:35,506 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:21:35,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 90 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:21:35,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 11:21:35,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-09 11:21:35,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 11:21:35,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2024-11-09 11:21:35,513 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 26 [2024-11-09 11:21:35,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:21:35,513 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2024-11-09 11:21:35,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:21:35,514 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2024-11-09 11:21:35,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 11:21:35,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:21:35,516 INFO L215 NwaCegarLoop]: trace histogram [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-09 11:21:35,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 11:21:35,516 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 11:21:35,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:21:35,516 INFO L85 PathProgramCache]: Analyzing trace with hash -816534798, now seen corresponding path program 1 times [2024-11-09 11:21:35,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:21:35,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779857600] [2024-11-09 11:21:35,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:21:35,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:21:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:35,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:21:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:35,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:21:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:35,642 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:21:35,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:21:35,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779857600] [2024-11-09 11:21:35,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779857600] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:21:35,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581189551] [2024-11-09 11:21:35,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:21:35,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:21:35,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:21:35,650 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-09 11:21:35,651 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-09 11:21:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:35,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:21:35,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:21:35,820 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:21:35,820 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:21:35,896 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:21:35,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581189551] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:21:35,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:21:35,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2024-11-09 11:21:35,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364662728] [2024-11-09 11:21:35,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:21:35,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 11:21:35,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:21:35,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 11:21:35,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-09 11:21:35,902 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 13 states have internal predecessors, (40), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 11:21:36,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:21:36,028 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2024-11-09 11:21:36,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 11:21:36,029 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 13 states have internal predecessors, (40), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 27 [2024-11-09 11:21:36,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:21:36,030 INFO L225 Difference]: With dead ends: 61 [2024-11-09 11:21:36,030 INFO L226 Difference]: Without dead ends: 54 [2024-11-09 11:21:36,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-11-09 11:21:36,031 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 39 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:21:36,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 114 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:21:36,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-09 11:21:36,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2024-11-09 11:21:36,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 11:21:36,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2024-11-09 11:21:36,042 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 27 [2024-11-09 11:21:36,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:21:36,042 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2024-11-09 11:21:36,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 13 states have internal predecessors, (40), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 11:21:36,043 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2024-11-09 11:21:36,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 11:21:36,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:21:36,045 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:21:36,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 11:21:36,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:21:36,250 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 11:21:36,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:21:36,250 INFO L85 PathProgramCache]: Analyzing trace with hash 623192612, now seen corresponding path program 1 times [2024-11-09 11:21:36,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:21:36,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296053812] [2024-11-09 11:21:36,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:21:36,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:21:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:36,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:21:36,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:36,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:21:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:36,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 11:21:36,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:36,372 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:21:36,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:21:36,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296053812] [2024-11-09 11:21:36,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296053812] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:21:36,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985711091] [2024-11-09 11:21:36,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:21:36,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:21:36,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:21:36,375 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-09 11:21:36,376 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-09 11:21:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:36,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:21:36,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:21:36,521 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:21:36,522 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:21:36,592 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:21:36,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985711091] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:21:36,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:21:36,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2024-11-09 11:21:36,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058929845] [2024-11-09 11:21:36,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:21:36,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 11:21:36,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:21:36,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 11:21:36,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-09 11:21:36,594 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 13 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:21:36,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:21:36,709 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2024-11-09 11:21:36,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 11:21:36,709 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 31 [2024-11-09 11:21:36,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:21:36,711 INFO L225 Difference]: With dead ends: 69 [2024-11-09 11:21:36,712 INFO L226 Difference]: Without dead ends: 68 [2024-11-09 11:21:36,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-09 11:21:36,713 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:21:36,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 132 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:21:36,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-09 11:21:36,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2024-11-09 11:21:36,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 50 states have internal predecessors, (61), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (12), 10 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-09 11:21:36,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2024-11-09 11:21:36,729 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 31 [2024-11-09 11:21:36,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:21:36,729 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2024-11-09 11:21:36,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:21:36,730 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2024-11-09 11:21:36,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 11:21:36,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:21:36,733 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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-09 11:21:36,749 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-09 11:21:36,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:21:36,934 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 11:21:36,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:21:36,934 INFO L85 PathProgramCache]: Analyzing trace with hash -623004543, now seen corresponding path program 1 times [2024-11-09 11:21:36,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:21:36,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150873105] [2024-11-09 11:21:36,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:21:36,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:21:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:37,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:21:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:37,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:21:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:37,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 11:21:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:37,053 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:21:37,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:21:37,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150873105] [2024-11-09 11:21:37,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150873105] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:21:37,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360020421] [2024-11-09 11:21:37,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:21:37,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:21:37,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:21:37,061 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-09 11:21:37,064 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-09 11:21:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:37,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 11:21:37,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:21:37,201 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:21:37,202 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:21:37,301 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:21:37,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360020421] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:21:37,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:21:37,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2024-11-09 11:21:37,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090943778] [2024-11-09 11:21:37,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:21:37,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 11:21:37,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:21:37,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 11:21:37,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-09 11:21:37,303 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 15 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:21:37,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:21:37,416 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2024-11-09 11:21:37,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 11:21:37,417 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2024-11-09 11:21:37,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:21:37,418 INFO L225 Difference]: With dead ends: 68 [2024-11-09 11:21:37,418 INFO L226 Difference]: Without dead ends: 55 [2024-11-09 11:21:37,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-09 11:21:37,419 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:21:37,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 120 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:21:37,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-09 11:21:37,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2024-11-09 11:21:37,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:21:37,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2024-11-09 11:21:37,427 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 34 [2024-11-09 11:21:37,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:21:37,427 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2024-11-09 11:21:37,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:21:37,428 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2024-11-09 11:21:37,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 11:21:37,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:21:37,429 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:21:37,454 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-09 11:21:37,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 11:21:37,634 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 11:21:37,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:21:37,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1169010951, now seen corresponding path program 2 times [2024-11-09 11:21:37,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:21:37,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871833136] [2024-11-09 11:21:37,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:21:37,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:21:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:37,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:21:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:37,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:21:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:37,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 11:21:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:37,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 11:21:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:37,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 11:21:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:37,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 11:21:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:37,920 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-09 11:21:37,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:21:37,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871833136] [2024-11-09 11:21:37,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871833136] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:21:37,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487036279] [2024-11-09 11:21:37,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:21:37,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:21:37,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:21:37,924 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-09 11:21:37,925 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-09 11:21:38,039 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:21:38,039 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:21:38,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 11:21:38,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:21:38,129 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-09 11:21:38,130 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:21:38,349 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-09 11:21:38,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487036279] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:21:38,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:21:38,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 24 [2024-11-09 11:21:38,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642289858] [2024-11-09 11:21:38,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:21:38,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 11:21:38,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:21:38,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 11:21:38,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2024-11-09 11:21:38,355 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 25 states, 24 states have (on average 3.25) internal successors, (78), 24 states have internal predecessors, (78), 12 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 11:21:38,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:21:38,514 INFO L93 Difference]: Finished difference Result 90 states and 118 transitions. [2024-11-09 11:21:38,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 11:21:38,514 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.25) internal successors, (78), 24 states have internal predecessors, (78), 12 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 64 [2024-11-09 11:21:38,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:21:38,516 INFO L225 Difference]: With dead ends: 90 [2024-11-09 11:21:38,518 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 11:21:38,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2024-11-09 11:21:38,519 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 3 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:21:38,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 84 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:21:38,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 11:21:38,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2024-11-09 11:21:38,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 11:21:38,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2024-11-09 11:21:38,532 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 64 [2024-11-09 11:21:38,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:21:38,533 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2024-11-09 11:21:38,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.25) internal successors, (78), 24 states have internal predecessors, (78), 12 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 11:21:38,533 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2024-11-09 11:21:38,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-09 11:21:38,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:21:38,536 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:21:38,553 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-09 11:21:38,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:21:38,737 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 11:21:38,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:21:38,737 INFO L85 PathProgramCache]: Analyzing trace with hash 735614119, now seen corresponding path program 3 times [2024-11-09 11:21:38,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:21:38,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533327425] [2024-11-09 11:21:38,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:21:38,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:21:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:39,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:21:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:39,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:21:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:39,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 11:21:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:39,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 11:21:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:39,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 11:21:39,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:39,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 11:21:39,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:39,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 11:21:39,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:39,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 11:21:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:39,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 11:21:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:39,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 11:21:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:39,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 11:21:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:39,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-09 11:21:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:21:39,637 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 321 proven. 64 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 11:21:39,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:21:39,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533327425] [2024-11-09 11:21:39,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533327425] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:21:39,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133214514] [2024-11-09 11:21:39,638 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 11:21:39,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:21:39,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:21:39,640 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-09 11:21:39,641 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-09 11:21:39,754 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 11:21:39,754 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:21:39,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:21:39,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:21:39,894 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2024-11-09 11:21:39,894 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:21:40,088 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2024-11-09 11:21:40,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133214514] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:21:40,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:21:40,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 4, 4] total 30 [2024-11-09 11:21:40,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052340818] [2024-11-09 11:21:40,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:21:40,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 11:21:40,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:21:40,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 11:21:40,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2024-11-09 11:21:40,093 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand has 30 states, 30 states have (on average 3.433333333333333) internal successors, (103), 29 states have internal predecessors, (103), 15 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-09 11:21:40,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:21:40,810 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2024-11-09 11:21:40,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-09 11:21:40,810 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.433333333333333) internal successors, (103), 29 states have internal predecessors, (103), 15 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) Word has length 130 [2024-11-09 11:21:40,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:21:40,811 INFO L225 Difference]: With dead ends: 94 [2024-11-09 11:21:40,811 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 11:21:40,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=590, Invalid=2602, Unknown=0, NotChecked=0, Total=3192 [2024-11-09 11:21:40,814 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 3 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 11:21:40,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 296 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 11:21:40,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 11:21:40,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 11:21:40,815 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-09 11:21:40,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 11:21:40,815 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 130 [2024-11-09 11:21:40,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:21:40,816 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 11:21:40,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.433333333333333) internal successors, (103), 29 states have internal predecessors, (103), 15 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-09 11:21:40,816 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 11:21:40,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 11:21:40,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-09 11:21:40,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-09 11:21:40,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-09 11:21:40,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-09 11:21:40,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-09 11:21:40,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-09 11:21:40,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 11:21:41,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:21:41,024 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:21:41,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 11:21:41,271 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 11:21:41,292 WARN L156 FloydHoareUtils]: Requires clause for ldv_malloc contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) Eliminated clause: true [2024-11-09 11:21:41,297 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!base [2024-11-09 11:21:41,298 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 11:21:41,298 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 11:21:41,299 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 11:21:41,299 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 11:21:41,302 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-09 11:21:41,303 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-09 11:21:41,303 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-09 11:21:41,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:21:41 BoogieIcfgContainer [2024-11-09 11:21:41,304 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 11:21:41,305 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 11:21:41,305 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 11:21:41,305 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 11:21:41,306 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:21:32" (3/4) ... [2024-11-09 11:21:41,309 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 11:21:41,312 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2024-11-09 11:21:41,317 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-09 11:21:41,317 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 11:21:41,317 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 11:21:41,408 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 11:21:41,408 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 11:21:41,408 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 11:21:41,409 INFO L158 Benchmark]: Toolchain (without parser) took 9745.63ms. Allocated memory was 153.1MB in the beginning and 243.3MB in the end (delta: 90.2MB). Free memory was 79.6MB in the beginning and 193.6MB in the end (delta: -114.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:21:41,409 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 153.1MB. Free memory is still 105.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:21:41,410 INFO L158 Benchmark]: CACSL2BoogieTranslator took 641.19ms. Allocated memory is still 153.1MB. Free memory was 79.4MB in the beginning and 110.4MB in the end (delta: -31.0MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2024-11-09 11:21:41,410 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.13ms. Allocated memory is still 153.1MB. Free memory was 110.4MB in the beginning and 108.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:21:41,410 INFO L158 Benchmark]: Boogie Preprocessor took 61.03ms. Allocated memory is still 153.1MB. Free memory was 108.3MB in the beginning and 106.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:21:41,410 INFO L158 Benchmark]: RCFGBuilder took 348.01ms. Allocated memory is still 153.1MB. Free memory was 106.2MB in the beginning and 92.8MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 11:21:41,411 INFO L158 Benchmark]: TraceAbstraction took 8520.89ms. Allocated memory was 153.1MB in the beginning and 243.3MB in the end (delta: 90.2MB). Free memory was 92.0MB in the beginning and 197.8MB in the end (delta: -105.9MB). Peak memory consumption was 112.0MB. Max. memory is 16.1GB. [2024-11-09 11:21:41,411 INFO L158 Benchmark]: Witness Printer took 103.73ms. Allocated memory is still 243.3MB. Free memory was 197.8MB in the beginning and 193.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 11:21:41,412 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.16ms. Allocated memory is still 153.1MB. Free memory is still 105.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 641.19ms. Allocated memory is still 153.1MB. Free memory was 79.4MB in the beginning and 110.4MB in the end (delta: -31.0MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.13ms. Allocated memory is still 153.1MB. Free memory was 110.4MB in the beginning and 108.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.03ms. Allocated memory is still 153.1MB. Free memory was 108.3MB in the beginning and 106.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 348.01ms. Allocated memory is still 153.1MB. Free memory was 106.2MB in the beginning and 92.8MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8520.89ms. Allocated memory was 153.1MB in the beginning and 243.3MB in the end (delta: 90.2MB). Free memory was 92.0MB in the beginning and 197.8MB in the end (delta: -105.9MB). Peak memory consumption was 112.0MB. Max. memory is 16.1GB. * Witness Printer took 103.73ms. Allocated memory is still 243.3MB. Free memory was 197.8MB in the beginning and 193.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID * 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: 767]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 767]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 773]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 773]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 773]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 773]: 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 2 procedures, 32 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 8.2s, OverallIterations: 12, TraceHistogramMax: 12, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 129 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 124 mSDsluCounter, 1384 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1062 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1213 IncrementalHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 322 mSDtfsCounter, 1213 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 791 GetRequests, 648 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1044 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=11, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 44 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 762 NumberOfCodeBlocks, 655 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1024 ConstructedInterpolants, 0 QuantifiedInterpolants, 2582 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1100 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 24 InterpolantComputations, 7 PerfectInterpolantSequences, 2062/2494 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 6 specifications checked. All of them hold - InvariantResult [Line: 767]: Loop Invariant Derived loop invariant: ((((((((10 == len) && (i == 3)) || ((10 == len) && (i == 1))) || ((i == 2) && (10 == len))) || (((10 == len) && (5 <= i)) && (i <= 2147483642))) || ((10 == len) && (i == 4))) || ((10 == len) && (i == 0))) || (((i <= 2147483646) && (10 == len)) && (9 <= i))) - InvariantResult [Line: 773]: Loop Invariant Derived loop invariant: (j < 2147483649) - ProcedureContractResult [Line: 525]: Procedure Contract for ldv_malloc Derived contract for procedure ldv_malloc. Ensures: (ldv_global_msg_list == \old(ldv_global_msg_list)) RESULT: Ultimate proved your program to be correct! [2024-11-09 11:21:41,440 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