/usr/bin/java -Xmx7000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dynamic-abstractions-e2ee32c-m [2023-09-07 10:25:25,361 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-09-07 10:25:25,439 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2023-09-07 10:25:25,447 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-09-07 10:25:25,448 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-09-07 10:25:25,448 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-09-07 10:25:25,476 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-07 10:25:25,476 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-07 10:25:25,477 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-07 10:25:25,480 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-07 10:25:25,481 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-07 10:25:25,481 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-07 10:25:25,482 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-09-07 10:25:25,483 INFO L153 SettingsManager]: * Use SBE=true [2023-09-07 10:25:25,483 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-07 10:25:25,483 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-07 10:25:25,483 INFO L153 SettingsManager]: * sizeof long=4 [2023-09-07 10:25:25,484 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-07 10:25:25,484 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-09-07 10:25:25,484 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-09-07 10:25:25,484 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-07 10:25:25,484 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-07 10:25:25,485 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-07 10:25:25,485 INFO L153 SettingsManager]: * sizeof long double=12 [2023-09-07 10:25:25,485 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-09-07 10:25:25,485 INFO L153 SettingsManager]: * Use constant arrays=true [2023-09-07 10:25:25,486 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-07 10:25:25,486 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-07 10:25:25,486 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-09-07 10:25:25,486 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-07 10:25:25,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-07 10:25:25,487 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-07 10:25:25,488 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-07 10:25:25,488 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-07 10:25:25,488 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-07 10:25:25,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-07 10:25:25,488 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-07 10:25:25,488 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-09-07 10:25:25,488 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-07 10:25:25,489 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2023-09-07 10:25:25,489 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.traceabstraction: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2023-09-07 10:25:25,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-07 10:25:25,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-07 10:25:25,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-07 10:25:25,755 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-07 10:25:25,757 INFO L274 PluginConnector]: CDTParser initialized [2023-09-07 10:25:25,758 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c [2023-09-07 10:25:26,924 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-07 10:25:27,093 INFO L384 CDTParser]: Found 1 translation units. [2023-09-07 10:25:27,093 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c [2023-09-07 10:25:27,100 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44eff8043/576aa7245250425d9e6329d30e50b962/FLAGc9c8ab2a9 [2023-09-07 10:25:27,117 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44eff8043/576aa7245250425d9e6329d30e50b962 [2023-09-07 10:25:27,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-07 10:25:27,121 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-07 10:25:27,122 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-07 10:25:27,122 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-07 10:25:27,129 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-07 10:25:27,130 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:25:27" (1/1) ... [2023-09-07 10:25:27,130 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@135fea2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:25:27, skipping insertion in model container [2023-09-07 10:25:27,131 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:25:27" (1/1) ... [2023-09-07 10:25:27,161 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-09-07 10:25:27,324 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c[2835,2848] [2023-09-07 10:25:27,331 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-07 10:25:27,339 INFO L202 MainTranslator]: Completed pre-run [2023-09-07 10:25:27,358 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c[2835,2848] [2023-09-07 10:25:27,362 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-07 10:25:27,369 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-07 10:25:27,370 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-07 10:25:27,375 INFO L206 MainTranslator]: Completed translation [2023-09-07 10:25:27,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:25:27 WrapperNode [2023-09-07 10:25:27,376 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-07 10:25:27,377 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-07 10:25:27,377 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-07 10:25:27,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-07 10:25:27,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:25:27" (1/1) ... [2023-09-07 10:25:27,392 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:25:27" (1/1) ... [2023-09-07 10:25:27,422 INFO L138 Inliner]: procedures = 25, calls = 58, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 289 [2023-09-07 10:25:27,422 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-07 10:25:27,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-07 10:25:27,423 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-07 10:25:27,423 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-07 10:25:27,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:25:27" (1/1) ... [2023-09-07 10:25:27,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:25:27" (1/1) ... [2023-09-07 10:25:27,435 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:25:27" (1/1) ... [2023-09-07 10:25:27,435 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:25:27" (1/1) ... [2023-09-07 10:25:27,443 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:25:27" (1/1) ... [2023-09-07 10:25:27,446 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:25:27" (1/1) ... [2023-09-07 10:25:27,448 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:25:27" (1/1) ... [2023-09-07 10:25:27,450 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:25:27" (1/1) ... [2023-09-07 10:25:27,453 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-07 10:25:27,454 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-07 10:25:27,454 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-07 10:25:27,454 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-07 10:25:27,455 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:25:27" (1/1) ... [2023-09-07 10:25:27,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-07 10:25:27,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 10:25:27,489 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-07 10:25:27,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-07 10:25:27,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-07 10:25:27,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-07 10:25:27,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-07 10:25:27,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-07 10:25:27,516 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-07 10:25:27,516 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-07 10:25:27,516 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-07 10:25:27,516 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-07 10:25:27,516 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-09-07 10:25:27,516 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-09-07 10:25:27,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-07 10:25:27,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-07 10:25:27,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-07 10:25:27,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-09-07 10:25:27,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-07 10:25:27,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-07 10:25:27,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-07 10:25:27,518 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-07 10:25:27,602 INFO L236 CfgBuilder]: Building ICFG [2023-09-07 10:25:27,603 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-07 10:25:27,965 INFO L277 CfgBuilder]: Performing block encoding [2023-09-07 10:25:28,178 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-07 10:25:28,179 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-09-07 10:25:28,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:25:28 BoogieIcfgContainer [2023-09-07 10:25:28,181 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-07 10:25:28,184 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-07 10:25:28,184 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-09-07 10:25:28,187 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-09-07 10:25:28,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 10:25:27" (1/3) ... [2023-09-07 10:25:28,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd93436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:25:28, skipping insertion in model container [2023-09-07 10:25:28,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:25:27" (2/3) ... [2023-09-07 10:25:28,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd93436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:25:28, skipping insertion in model container [2023-09-07 10:25:28,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:25:28" (3/3) ... [2023-09-07 10:25:28,192 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2023-09-07 10:25:28,199 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-07 10:25:28,207 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-07 10:25:28,207 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-09-07 10:25:28,207 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-07 10:25:28,268 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-09-07 10:25:28,312 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 10:25:28,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-09-07 10:25:28,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 10:25:28,313 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-09-07 10:25:28,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-09-07 10:25:28,343 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-09-07 10:25:28,348 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2023-09-07 10:25:28,353 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@6d72daa0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 10:25:28,353 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-09-07 10:25:28,620 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 10:25:28,628 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 10:25:28,628 INFO L85 PathProgramCache]: Analyzing trace with hash 27590413, now seen corresponding path program 1 times [2023-09-07 10:25:28,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 10:25:28,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748604655] [2023-09-07 10:25:28,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 10:25:28,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 10:25:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 10:25:28,965 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-09-07 10:25:28,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 10:25:28,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748604655] [2023-09-07 10:25:28,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748604655] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-07 10:25:28,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-07 10:25:28,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-07 10:25:28,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335134569] [2023-09-07 10:25:28,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-07 10:25:28,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-07 10:25:28,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 10:25:29,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-07 10:25:29,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-07 10:25:29,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 10:25:29,015 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 10:25:29,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-07 10:25:29,016 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 10:25:29,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 10:25:29,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-07 10:25:29,088 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 10:25:29,088 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 10:25:29,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1304401930, now seen corresponding path program 1 times [2023-09-07 10:25:29,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 10:25:29,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914873478] [2023-09-07 10:25:29,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 10:25:29,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 10:25:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 10:25:29,593 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-09-07 10:25:29,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 10:25:29,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914873478] [2023-09-07 10:25:29,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914873478] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-07 10:25:29,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-07 10:25:29,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-09-07 10:25:29,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616792358] [2023-09-07 10:25:29,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-07 10:25:29,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-09-07 10:25:29,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 10:25:29,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-09-07 10:25:29,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-09-07 10:25:29,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 10:25:29,602 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 10:25:29,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.333333333333334) internal successors, (138), 9 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-07 10:25:29,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 10:25:29,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 10:25:29,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 10:25:29,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-07 10:25:29,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-07 10:25:29,864 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 10:25:29,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 10:25:29,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1136339999, now seen corresponding path program 1 times [2023-09-07 10:25:29,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 10:25:29,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523342783] [2023-09-07 10:25:29,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 10:25:29,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 10:25:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 10:25:30,248 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-09-07 10:25:30,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 10:25:30,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523342783] [2023-09-07 10:25:30,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523342783] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 10:25:30,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546287428] [2023-09-07 10:25:30,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 10:25:30,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 10:25:30,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 10:25:30,295 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) [2023-09-07 10:25:30,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-09-07 10:25:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 10:25:30,450 INFO L262 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 6 conjunts are in the unsatisfiable core [2023-09-07 10:25:30,457 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 10:25:30,635 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-09-07 10:25:30,635 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 10:25:30,862 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-09-07 10:25:30,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546287428] provided 1 perfect and 1 imperfect interpolant sequences [2023-09-07 10:25:30,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-09-07 10:25:30,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-09-07 10:25:30,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828216859] [2023-09-07 10:25:30,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-07 10:25:30,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-07 10:25:30,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 10:25:30,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-07 10:25:30,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-09-07 10:25:30,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 10:25:30,865 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 10:25:30,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-07 10:25:30,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 10:25:30,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-09-07 10:25:30,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 10:25:30,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 10:25:30,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-07 10:25:30,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-07 10:25:30,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-09-07 10:25:31,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-09-07 10:25:31,187 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 10:25:31,187 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 10:25:31,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1025710565, now seen corresponding path program 1 times [2023-09-07 10:25:31,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 10:25:31,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638504331] [2023-09-07 10:25:31,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 10:25:31,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 10:25:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 10:25:31,577 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-09-07 10:25:31,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 10:25:31,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638504331] [2023-09-07 10:25:31,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638504331] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 10:25:31,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895825086] [2023-09-07 10:25:31,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 10:25:31,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 10:25:31,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 10:25:31,588 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) [2023-09-07 10:25:31,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-09-07 10:25:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 10:25:31,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 10 conjunts are in the unsatisfiable core [2023-09-07 10:25:31,740 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 10:25:31,981 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-09-07 10:25:31,981 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 10:25:32,272 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-09-07 10:25:32,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895825086] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-07 10:25:32,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-07 10:25:32,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2023-09-07 10:25:32,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619764109] [2023-09-07 10:25:32,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-07 10:25:32,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-09-07 10:25:32,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 10:25:32,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-09-07 10:25:32,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2023-09-07 10:25:32,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 10:25:32,275 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 10:25:32,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.24) internal successors, (206), 25 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-07 10:25:32,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 10:25:32,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-09-07 10:25:32,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-09-07 10:25:32,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 10:25:32,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 10:25:32,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-07 10:25:32,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-07 10:25:32,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-09-07 10:25:32,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-09-07 10:25:32,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 10:25:32,823 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 10:25:32,823 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 10:25:32,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1214248014, now seen corresponding path program 2 times [2023-09-07 10:25:32,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 10:25:32,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591153331] [2023-09-07 10:25:32,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 10:25:32,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 10:25:32,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 10:25:33,182 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-09-07 10:25:33,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 10:25:33,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591153331] [2023-09-07 10:25:33,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591153331] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 10:25:33,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513076201] [2023-09-07 10:25:33,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-07 10:25:33,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 10:25:33,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 10:25:33,184 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) [2023-09-07 10:25:33,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-09-07 10:25:33,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-07 10:25:33,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-07 10:25:33,610 INFO L262 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 8 conjunts are in the unsatisfiable core [2023-09-07 10:25:33,613 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 10:25:33,733 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-09-07 10:25:33,733 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 10:25:33,843 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-09-07 10:25:33,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513076201] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-07 10:25:33,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-07 10:25:33,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2023-09-07 10:25:33,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472654725] [2023-09-07 10:25:33,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-07 10:25:33,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-09-07 10:25:33,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 10:25:33,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-09-07 10:25:33,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2023-09-07 10:25:33,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 10:25:33,846 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 10:25:33,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 13.095238095238095) internal successors, (275), 21 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-07 10:25:33,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 10:25:33,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-09-07 10:25:33,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-09-07 10:25:33,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-09-07 10:25:33,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 10:25:34,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 10:25:34,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-07 10:25:34,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-07 10:25:34,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-09-07 10:25:34,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-09-07 10:25:34,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-09-07 10:25:34,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 10:25:34,713 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 10:25:34,714 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 10:25:34,714 INFO L85 PathProgramCache]: Analyzing trace with hash -883506476, now seen corresponding path program 3 times [2023-09-07 10:25:34,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 10:25:34,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559313733] [2023-09-07 10:25:34,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 10:25:34,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 10:25:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 10:25:35,137 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-09-07 10:25:35,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 10:25:35,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559313733] [2023-09-07 10:25:35,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559313733] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 10:25:35,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671544826] [2023-09-07 10:25:35,138 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-07 10:25:35,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 10:25:35,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 10:25:35,139 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) [2023-09-07 10:25:35,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-09-07 10:25:35,558 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-09-07 10:25:35,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-07 10:25:35,561 INFO L262 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 14 conjunts are in the unsatisfiable core [2023-09-07 10:25:35,564 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 10:25:35,835 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-09-07 10:25:35,836 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 10:25:36,194 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-09-07 10:25:36,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671544826] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-07 10:25:36,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-07 10:25:36,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 36 [2023-09-07 10:25:36,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343835874] [2023-09-07 10:25:36,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-07 10:25:36,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-09-07 10:25:36,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 10:25:36,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-09-07 10:25:36,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1080, Unknown=0, NotChecked=0, Total=1260 [2023-09-07 10:25:36,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 10:25:36,198 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 10:25:36,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 8.083333333333334) internal successors, (291), 36 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-07 10:25:36,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 10:25:36,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-09-07 10:25:36,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-09-07 10:25:36,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-09-07 10:25:36,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-09-07 10:25:36,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 10:25:36,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 10:25:36,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-07 10:25:36,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-07 10:25:36,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-09-07 10:25:36,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-09-07 10:25:36,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-09-07 10:25:36,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-09-07 10:25:37,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 10:25:37,076 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 10:25:37,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 10:25:37,076 INFO L85 PathProgramCache]: Analyzing trace with hash 299385725, now seen corresponding path program 4 times [2023-09-07 10:25:37,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 10:25:37,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565859797] [2023-09-07 10:25:37,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 10:25:37,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 10:25:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 10:25:37,606 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-09-07 10:25:37,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 10:25:37,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565859797] [2023-09-07 10:25:37,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565859797] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 10:25:37,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820499326] [2023-09-07 10:25:37,607 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-09-07 10:25:37,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 10:25:37,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 10:25:37,608 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) [2023-09-07 10:25:37,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-09-07 10:25:37,737 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-09-07 10:25:37,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-07 10:25:37,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 14 conjunts are in the unsatisfiable core [2023-09-07 10:25:37,742 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 10:25:38,109 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-09-07 10:25:38,110 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 10:25:38,510 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-09-07 10:25:38,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820499326] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-07 10:25:38,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-07 10:25:38,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 34 [2023-09-07 10:25:38,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510012036] [2023-09-07 10:25:38,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-07 10:25:38,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-09-07 10:25:38,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 10:25:38,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-09-07 10:25:38,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=918, Unknown=0, NotChecked=0, Total=1122 [2023-09-07 10:25:38,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 10:25:38,516 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 10:25:38,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.411764705882353) internal successors, (252), 34 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-07 10:25:38,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 10:25:38,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-09-07 10:25:38,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-09-07 10:25:38,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-09-07 10:25:38,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-09-07 10:25:38,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-09-07 10:25:38,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 10:25:39,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 10:25:39,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-07 10:25:39,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-07 10:25:39,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-09-07 10:25:39,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-09-07 10:25:39,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-09-07 10:25:39,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-09-07 10:25:39,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-09-07 10:25:39,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 10:25:39,536 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 10:25:39,536 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 10:25:39,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1566356163, now seen corresponding path program 5 times [2023-09-07 10:25:39,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 10:25:39,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496388511] [2023-09-07 10:25:39,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 10:25:39,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 10:25:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-07 10:25:39,830 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-07 10:25:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-07 10:25:40,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-07 10:25:40,001 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-07 10:25:40,002 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-09-07 10:25:40,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-07 10:25:40,007 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2023-09-07 10:25:40,008 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was UNSAFE (1/4) [2023-09-07 10:25:40,011 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-07 10:25:40,011 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-07 10:25:40,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 10:25:40 BasicIcfg [2023-09-07 10:25:40,134 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-07 10:25:40,135 INFO L158 Benchmark]: Toolchain (without parser) took 13014.38ms. Allocated memory was 221.2MB in the beginning and 319.8MB in the end (delta: 98.6MB). Free memory was 176.1MB in the beginning and 110.6MB in the end (delta: 65.6MB). Peak memory consumption was 164.6MB. Max. memory is 7.0GB. [2023-09-07 10:25:40,135 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 153.1MB. Free memory is still 108.0MB. There was no memory consumed. Max. memory is 7.0GB. [2023-09-07 10:25:40,135 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.81ms. Allocated memory is still 221.2MB. Free memory was 175.8MB in the beginning and 163.9MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 7.0GB. [2023-09-07 10:25:40,136 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.21ms. Allocated memory is still 221.2MB. Free memory was 163.9MB in the beginning and 161.2MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 7.0GB. [2023-09-07 10:25:40,136 INFO L158 Benchmark]: Boogie Preprocessor took 30.31ms. Allocated memory is still 221.2MB. Free memory was 161.2MB in the beginning and 159.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. [2023-09-07 10:25:40,136 INFO L158 Benchmark]: RCFGBuilder took 727.37ms. Allocated memory is still 221.2MB. Free memory was 159.1MB in the beginning and 154.6MB in the end (delta: 4.5MB). Peak memory consumption was 32.6MB. Max. memory is 7.0GB. [2023-09-07 10:25:40,136 INFO L158 Benchmark]: TraceAbstraction took 11950.75ms. Allocated memory was 221.2MB in the beginning and 319.8MB in the end (delta: 98.6MB). Free memory was 154.0MB in the beginning and 110.6MB in the end (delta: 43.5MB). Peak memory consumption was 142.5MB. Max. memory is 7.0GB. [2023-09-07 10:25:40,138 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.12ms. Allocated memory is still 153.1MB. Free memory is still 108.0MB. There was no memory consumed. Max. memory is 7.0GB. * CACSL2BoogieTranslator took 254.81ms. Allocated memory is still 221.2MB. Free memory was 175.8MB in the beginning and 163.9MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 7.0GB. * Boogie Procedure Inliner took 45.21ms. Allocated memory is still 221.2MB. Free memory was 163.9MB in the beginning and 161.2MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 7.0GB. * Boogie Preprocessor took 30.31ms. Allocated memory is still 221.2MB. Free memory was 161.2MB in the beginning and 159.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. * RCFGBuilder took 727.37ms. Allocated memory is still 221.2MB. Free memory was 159.1MB in the beginning and 154.6MB in the end (delta: 4.5MB). Peak memory consumption was 32.6MB. Max. memory is 7.0GB. * TraceAbstraction took 11950.75ms. Allocated memory was 221.2MB in the beginning and 319.8MB in the end (delta: 98.6MB). Free memory was 154.0MB in the beginning and 110.6MB in the end (delta: 43.5MB). Peak memory consumption was 142.5MB. Max. memory is 7.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 12135, independent: 10458, independent conditional: 10458, independent unconditional: 0, dependent: 1677, dependent conditional: 1677, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10590, independent: 10458, independent conditional: 10458, independent unconditional: 0, dependent: 132, dependent conditional: 132, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10590, independent: 10458, independent conditional: 10458, independent unconditional: 0, dependent: 132, dependent conditional: 132, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11022, independent: 10458, independent conditional: 0, independent unconditional: 10458, dependent: 564, dependent conditional: 432, dependent unconditional: 132, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11022, independent: 10458, independent conditional: 0, independent unconditional: 10458, dependent: 564, dependent conditional: 0, dependent unconditional: 564, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11022, independent: 10458, independent conditional: 0, independent unconditional: 10458, dependent: 564, dependent conditional: 0, dependent unconditional: 564, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 314, independent: 311, independent conditional: 0, independent unconditional: 311, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 314, independent: 311, independent conditional: 0, independent unconditional: 311, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 53, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 11022, independent: 10147, independent conditional: 0, independent unconditional: 10147, dependent: 561, dependent conditional: 0, dependent unconditional: 561, unknown: 314, unknown conditional: 0, unknown unconditional: 314] , Statistics on independence cache: Total cache size (in pairs): 314, Positive cache size: 311, Positive conditional cache size: 0, Positive unconditional cache size: 311, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 432, Maximal queried relation: 7, Independence queries for same thread: 1545 - CounterExampleResult [Line: 106]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L40] 0 int* A; VAL [A={0:0}] [L41] 0 int* B; VAL [A={0:0}, B={0:0}] [L42] 0 int res1, res2, M, N; VAL [A={0:0}, B={0:0}, M=0, N=0, res1=0, res2=0] [L87] 0 pthread_t t1, t2, t3; VAL [A={0:0}, B={0:0}, M=0, N=0, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L90] 0 M = __VERIFIER_nondet_int() VAL [A={0:0}, B={0:0}, M=2, N=0, __VERIFIER_nondet_int()=2, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L91] 0 N = __VERIFIER_nondet_int() VAL [A={0:0}, B={0:0}, M=2, N=3, __VERIFIER_nondet_int()=3, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L92] CALL, EXPR 0 create_fresh_int_array(N) [L112] CALL 0 assume_abort_if_not(size >= 0) [L37] COND FALSE 0 !(!cond) VAL [A={0:0}, B={0:0}, M=2, N=3, \old(cond)=1, cond=1, res1=0, res2=0] [L112] RET 0 assume_abort_if_not(size >= 0) [L113] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L37] COND FALSE 0 !(!cond) VAL [A={0:0}, B={0:0}, M=2, N=3, \old(cond)=1, cond=1, res1=0, res2=0] [L113] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L115] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={-4:0}, malloc(sizeof(int) * (size_t)size)={-4:0}, res1=0, res2=0, size=3] [L116] 0 int i = 0; VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={-4:0}, i=0, res1=0, res2=0, size=3] [L116] COND TRUE 0 i < size VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={-4:0}, i=0, res1=0, res2=0, size=3] [L117] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, __VERIFIER_nondet_int()=-10, arr={-4:0}, i=0, res1=0, res2=0, size=3] [L116] 0 i++ VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={-4:0}, i=1, res1=0, res2=0, size=3] [L116] COND TRUE 0 i < size VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={-4:0}, i=1, res1=0, res2=0, size=3] [L117] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, __VERIFIER_nondet_int()=2147483645, arr={-4:0}, i=1, res1=0, res2=0, size=3] [L116] 0 i++ VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={-4:0}, i=2, res1=0, res2=0, size=3] [L116] COND TRUE 0 i < size VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={-4:0}, i=2, res1=0, res2=0, size=3] [L117] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, __VERIFIER_nondet_int()=13, arr={-4:0}, i=2, res1=0, res2=0, size=3] [L116] 0 i++ VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={-4:0}, i=3, res1=0, res2=0, size=3] [L116] COND FALSE 0 !(i < size) VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={-4:0}, i=3, res1=0, res2=0, size=3] [L119] 0 return arr; VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, \result={-4:0}, arr={-4:0}, res1=0, res2=0, size=3] [L92] RET, EXPR 0 create_fresh_int_array(N) [L92] 0 A = create_fresh_int_array(N) VAL [A={-4:0}, B={0:0}, M=2, N=3, create_fresh_int_array(N)={-4:0}, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L93] CALL, EXPR 0 create_fresh_int_array(N) [L112] CALL 0 assume_abort_if_not(size >= 0) [L37] COND FALSE 0 !(!cond) VAL [A={-4:0}, B={0:0}, M=2, N=3, \old(cond)=1, cond=1, res1=0, res2=0] [L112] RET 0 assume_abort_if_not(size >= 0) [L113] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L37] COND FALSE 0 !(!cond) VAL [A={-4:0}, B={0:0}, M=2, N=3, \old(cond)=1, cond=1, res1=0, res2=0] [L113] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L115] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); VAL [A={-4:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, malloc(sizeof(int) * (size_t)size)={3:0}, res1=0, res2=0, size=3] [L116] 0 int i = 0; VAL [A={-4:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=0, res1=0, res2=0, size=3] [L116] COND TRUE 0 i < size VAL [A={-4:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=0, res1=0, res2=0, size=3] [L117] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={-4:0}, B={0:0}, M=2, N=3, \old(size)=3, __VERIFIER_nondet_int()=0, arr={3:0}, i=0, res1=0, res2=0, size=3] [L116] 0 i++ VAL [A={-4:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=1, res1=0, res2=0, size=3] [L116] COND TRUE 0 i < size VAL [A={-4:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=1, res1=0, res2=0, size=3] [L117] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={-4:0}, B={0:0}, M=2, N=3, \old(size)=3, __VERIFIER_nondet_int()=-11, arr={3:0}, i=1, res1=0, res2=0, size=3] [L116] 0 i++ VAL [A={-4:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=2, res1=0, res2=0, size=3] [L116] COND TRUE 0 i < size VAL [A={-4:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=2, res1=0, res2=0, size=3] [L117] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={-4:0}, B={0:0}, M=2, N=3, \old(size)=3, __VERIFIER_nondet_int()=0, arr={3:0}, i=2, res1=0, res2=0, size=3] [L116] 0 i++ VAL [A={-4:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=3, res1=0, res2=0, size=3] [L116] COND FALSE 0 !(i < size) VAL [A={-4:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=3, res1=0, res2=0, size=3] [L119] 0 return arr; VAL [A={-4:0}, B={0:0}, M=2, N=3, \old(size)=3, \result={3:0}, arr={3:0}, res1=0, res2=0, size=3] [L93] RET, EXPR 0 create_fresh_int_array(N) [L93] 0 B = create_fresh_int_array(N) VAL [A={-4:0}, B={3:0}, M=2, N=3, create_fresh_int_array(N)={3:0}, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L95] CALL 0 assume_abort_if_not(M >= 0 && M < N) [L37] COND FALSE 0 !(!cond) VAL [A={-4:0}, B={3:0}, M=2, N=3, \old(cond)=1, cond=1, res1=0, res2=0] [L95] RET 0 assume_abort_if_not(M >= 0 && M < N) [L98] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={-4:0}, B={3:0}, M=2, N=3, pthread_create(&t1, 0, thread1, 0)=-3, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L99] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={-4:0}, B={3:0}, M=2, N=3, pthread_create(&t2, 0, thread2, 0)=-2, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L100] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [A={-4:0}, B={3:0}, M=2, N=3, pthread_create(&t3, 0, thread3, 0)=-1, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L101] 0 \read(t1) VAL [A={-4:0}, B={3:0}, M=2, N=3, \read(t1)=-3, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L48] 1 int i=0; VAL [A={-4:0}, B={3:0}, M=2, N=3, i=0, res1=0, res2=0] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L37] COND FALSE 1 !(!cond) [L123] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 1 !(!cond) [L124] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 1 return a + b; [L50] RET, EXPR 1 plus(A[i], B[i]) [L50] CALL, EXPR 1 plus(res1, plus(A[i], B[i])) [L123] CALL 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L37] COND FALSE 1 !(!cond) [L123] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 1 !(!cond) [L124] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 1 return a + b; [L50] RET, EXPR 1 plus(res1, plus(A[i], B[i])) [L50] 1 int tmp = plus(res1, plus(A[i], B[i])); [L53] 1 res1 = tmp VAL [A={-4:0}, B={3:0}, M=2, N=3, i=0, res1=-10, res2=0, tmp=-10] [L48] 1 i++ VAL [A={-4:0}, B={3:0}, M=2, N=3, i=1, res1=-10, res2=0, tmp=-10] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L37] COND FALSE 1 !(!cond) [L123] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 1 !(!cond) [L124] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 1 return a + b; [L50] RET, EXPR 1 plus(A[i], B[i]) [L50] CALL, EXPR 1 plus(res1, plus(A[i], B[i])) [L123] CALL 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L37] COND FALSE 1 !(!cond) [L123] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 1 !(!cond) [L124] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 1 return a + b; [L50] RET, EXPR 1 plus(res1, plus(A[i], B[i])) [L50] 1 int tmp = plus(res1, plus(A[i], B[i])); [L53] 1 res1 = tmp VAL [A={-4:0}, B={3:0}, M=2, N=3, i=1, res1=2147483624, res2=0, tmp=2147483624] [L48] 1 i++ VAL [A={-4:0}, B={3:0}, M=2, N=3, i=2, res1=2147483624, res2=0, tmp=2147483624] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L37] COND FALSE 1 !(!cond) [L123] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 1 !(!cond) [L124] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 1 return a + b; [L50] RET, EXPR 1 plus(A[i], B[i]) [L50] CALL, EXPR 1 plus(res1, plus(A[i], B[i])) [L123] CALL 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L37] COND FALSE 1 !(!cond) [L123] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 1 !(!cond) [L124] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 1 return a + b; [L50] RET, EXPR 1 plus(res1, plus(A[i], B[i])) [L50] 1 int tmp = plus(res1, plus(A[i], B[i])); [L53] 1 res1 = tmp VAL [A={-4:0}, B={3:0}, M=2, N=3, i=2, res1=2147483637, res2=0, tmp=2147483637] [L48] 1 i++ VAL [A={-4:0}, B={3:0}, M=2, N=3, i=3, res1=2147483637, res2=0, tmp=2147483637] [L48] COND FALSE 1 !(i= 0 || a >= -2147483648 - b) [L37] COND FALSE 2 !(!cond) [L123] RET 2 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 2 !(!cond) [L124] RET 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 2 return a + b; [L63] RET, EXPR 2 plus(A[i], B[i]) [L63] CALL, EXPR 2 plus(res2, plus(A[i], B[i])) [L123] CALL 2 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L37] COND FALSE 2 !(!cond) [L123] RET 2 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 2 !(!cond) [L124] RET 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 2 return a + b; [L63] RET, EXPR 2 plus(res2, plus(A[i], B[i])) [L63] 2 int tmp = plus(res2, plus(A[i], B[i])); [L74] 3 int i=M; VAL [A={-4:0}, B={3:0}, M=2, N=3, i=2, res1=2147483637, res2=0] [L74] COND TRUE 3 i= 0 || a >= -2147483648 - b) [L37] COND FALSE 3 !(!cond) [L123] RET 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 3 !(!cond) [L124] RET 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 3 return a + b; [L76] RET, EXPR 3 plus(A[i], B[i]) [L76] CALL, EXPR 3 plus(res2, plus(A[i], B[i])) [L123] CALL 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L37] COND FALSE 3 !(!cond) [L123] RET 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 3 !(!cond) [L124] RET 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 3 return a + b; [L76] RET, EXPR 3 plus(res2, plus(A[i], B[i])) [L76] 3 int tmp = plus(res2, plus(A[i], B[i])); [L66] 2 res2 = tmp VAL [A={-4:0}, B={3:0}, M=2, N=3, i=0, res1=2147483637, res2=-10, tmp=-10] [L61] 2 i++ VAL [A={-4:0}, B={3:0}, M=2, N=3, i=1, res1=2147483637, res2=-10, tmp=-10] [L61] COND TRUE 2 i= 0 || a >= -2147483648 - b) [L37] COND FALSE 2 !(!cond) [L123] RET 2 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 2 !(!cond) [L124] RET 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 2 return a + b; [L63] RET, EXPR 2 plus(A[i], B[i]) [L63] CALL, EXPR 2 plus(res2, plus(A[i], B[i])) [L123] CALL 2 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L37] COND FALSE 2 !(!cond) [L123] RET 2 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 2 !(!cond) [L124] RET 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 2 return a + b; [L63] RET, EXPR 2 plus(res2, plus(A[i], B[i])) [L63] 2 int tmp = plus(res2, plus(A[i], B[i])); [L66] 2 res2 = tmp VAL [A={-4:0}, B={3:0}, M=2, N=3, i=1, res1=2147483637, res2=2147483647, tmp=2147483647] [L61] 2 i++ VAL [A={-4:0}, B={3:0}, M=2, N=3, i=2, res1=2147483637, res2=2147483647, tmp=2147483647] [L61] COND FALSE 2 !(i