/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -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-channel-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-e23131f-m [2024-05-03 08:15:27,480 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-03 08:15:27,537 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-03 08:15:27,541 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-03 08:15:27,542 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-03 08:15:27,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-03 08:15:27,565 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-03 08:15:27,565 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-03 08:15:27,566 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-03 08:15:27,566 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-03 08:15:27,566 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-03 08:15:27,567 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-03 08:15:27,567 INFO L153 SettingsManager]: * Use SBE=true [2024-05-03 08:15:27,567 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-03 08:15:27,567 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-03 08:15:27,568 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-03 08:15:27,571 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-03 08:15:27,574 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-03 08:15:27,575 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-03 08:15:27,575 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-03 08:15:27,577 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-03 08:15:27,577 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-03 08:15:27,577 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-03 08:15:27,577 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-03 08:15:27,578 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-03 08:15:27,578 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-03 08:15:27,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-03 08:15:27,578 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-03 08:15:27,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-03 08:15:27,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-03 08:15:27,580 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-03 08:15:27,580 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-03 08:15:27,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-03 08:15:27,580 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-03 08:15:27,580 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-03 08:15:27,581 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-03 08:15:27,581 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-03 08:15:27,581 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-03 08:15:27,581 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-03 08:15:27,581 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/UGemCutter-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 [2024-05-03 08:15:27,786 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-03 08:15:27,820 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-03 08:15:27,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-03 08:15:27,823 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-03 08:15:27,823 INFO L274 PluginConnector]: CDTParser initialized [2024-05-03 08:15:27,824 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c [2024-05-03 08:15:28,973 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-03 08:15:29,159 INFO L384 CDTParser]: Found 1 translation units. [2024-05-03 08:15:29,159 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c [2024-05-03 08:15:29,165 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/759969e5d/4db22eb44f7f41838588a719185d7cd4/FLAGae1a752d9 [2024-05-03 08:15:29,175 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/759969e5d/4db22eb44f7f41838588a719185d7cd4 [2024-05-03 08:15:29,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-03 08:15:29,178 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-03 08:15:29,179 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-03 08:15:29,179 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-03 08:15:29,183 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-03 08:15:29,183 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 08:15:29" (1/1) ... [2024-05-03 08:15:29,184 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53112fe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 08:15:29, skipping insertion in model container [2024-05-03 08:15:29,184 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 08:15:29" (1/1) ... [2024-05-03 08:15:29,201 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-03 08:15:29,331 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c[2947,2960] [2024-05-03 08:15:29,338 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-03 08:15:29,346 INFO L202 MainTranslator]: Completed pre-run [2024-05-03 08:15:29,361 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c[2947,2960] [2024-05-03 08:15:29,363 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-03 08:15:29,375 INFO L206 MainTranslator]: Completed translation [2024-05-03 08:15:29,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 08:15:29 WrapperNode [2024-05-03 08:15:29,375 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-03 08:15:29,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-03 08:15:29,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-03 08:15:29,376 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-03 08:15:29,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 08:15:29" (1/1) ... [2024-05-03 08:15:29,403 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 08:15:29" (1/1) ... [2024-05-03 08:15:29,422 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 155 [2024-05-03 08:15:29,423 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-03 08:15:29,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-03 08:15:29,423 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-03 08:15:29,423 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-03 08:15:29,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 08:15:29" (1/1) ... [2024-05-03 08:15:29,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 08:15:29" (1/1) ... [2024-05-03 08:15:29,433 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 08:15:29" (1/1) ... [2024-05-03 08:15:29,433 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 08:15:29" (1/1) ... [2024-05-03 08:15:29,439 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 08:15:29" (1/1) ... [2024-05-03 08:15:29,442 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 08:15:29" (1/1) ... [2024-05-03 08:15:29,451 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 08:15:29" (1/1) ... [2024-05-03 08:15:29,452 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 08:15:29" (1/1) ... [2024-05-03 08:15:29,454 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-03 08:15:29,455 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-03 08:15:29,455 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-03 08:15:29,455 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-03 08:15:29,456 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 08:15:29" (1/1) ... [2024-05-03 08:15:29,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-03 08:15:29,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 08:15:29,482 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-03 08:15:29,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-03 08:15:29,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-03 08:15:29,595 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-03 08:15:29,595 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-03 08:15:29,595 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-03 08:15:29,595 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-03 08:15:29,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-03 08:15:29,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-03 08:15:29,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-03 08:15:29,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-03 08:15:29,596 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-03 08:15:29,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-03 08:15:29,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-03 08:15:29,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-03 08:15:29,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-03 08:15:29,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-03 08:15:29,597 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-03 08:15:29,664 INFO L241 CfgBuilder]: Building ICFG [2024-05-03 08:15:29,666 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-03 08:15:29,846 INFO L282 CfgBuilder]: Performing block encoding [2024-05-03 08:15:29,905 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-03 08:15:29,905 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-05-03 08:15:29,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 08:15:29 BoogieIcfgContainer [2024-05-03 08:15:29,906 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-03 08:15:29,908 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-03 08:15:29,908 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-03 08:15:29,910 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-03 08:15:29,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.05 08:15:29" (1/3) ... [2024-05-03 08:15:29,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3227f427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 08:15:29, skipping insertion in model container [2024-05-03 08:15:29,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 08:15:29" (2/3) ... [2024-05-03 08:15:29,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3227f427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 08:15:29, skipping insertion in model container [2024-05-03 08:15:29,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 08:15:29" (3/3) ... [2024-05-03 08:15:29,912 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-channel-sum.wvr.c [2024-05-03 08:15:29,918 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-03 08:15:29,925 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-03 08:15:29,925 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-03 08:15:29,926 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-03 08:15:29,985 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-03 08:15:30,019 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 08:15:30,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-03 08:15:30,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 08:15:30,023 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-03 08:15:30,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-03 08:15:30,053 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-03 08:15:30,058 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-03 08:15:30,063 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=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;@88cec6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 08:15:30,063 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-03 08:15:30,180 INFO L78 Accepts]: Start accepts. Automaton has currently 345 states, but on-demand construction may add more states Word has length 115 [2024-05-03 08:15:30,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 08:15:30,182 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 08:15:30,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 08:15:30,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1928406056, now seen corresponding path program 1 times [2024-05-03 08:15:30,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 08:15:30,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370244690] [2024-05-03 08:15:30,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 08:15:30,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 08:15:30,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 08:15:30,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-03 08:15:30,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 08:15:30,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370244690] [2024-05-03 08:15:30,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370244690] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 08:15:30,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 08:15:30,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-03 08:15:30,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714522647] [2024-05-03 08:15:30,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 08:15:30,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-03 08:15:30,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 08:15:30,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-03 08:15:30,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-03 08:15:30,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:15:30,531 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 08:15:30,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 57.0) internal successors, (114), 2 states have internal predecessors, (114), 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-05-03 08:15:30,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:15:30,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:15:30,579 INFO L78 Accepts]: Start accepts. Automaton has currently 345 states, but on-demand construction may add more states Word has length 111 [2024-05-03 08:15:30,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 08:15:30,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-03 08:15:30,581 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 08:15:30,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 08:15:30,581 INFO L85 PathProgramCache]: Analyzing trace with hash -927735608, now seen corresponding path program 1 times [2024-05-03 08:15:30,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 08:15:30,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149214541] [2024-05-03 08:15:30,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 08:15:30,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 08:15:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 08:15:31,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 08:15:31,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 08:15:31,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149214541] [2024-05-03 08:15:31,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149214541] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 08:15:31,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 08:15:31,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-03 08:15:31,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822192412] [2024-05-03 08:15:31,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 08:15:31,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-03 08:15:31,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 08:15:31,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-03 08:15:31,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-03 08:15:31,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:15:31,043 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 08:15:31,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 08:15:31,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:15:31,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:15:31,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:15:31,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:15:31,152 INFO L78 Accepts]: Start accepts. Automaton has currently 353 states, but on-demand construction may add more states Word has length 119 [2024-05-03 08:15:31,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 08:15:31,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-03 08:15:31,153 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 08:15:31,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 08:15:31,154 INFO L85 PathProgramCache]: Analyzing trace with hash -295388219, now seen corresponding path program 1 times [2024-05-03 08:15:31,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 08:15:31,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368775391] [2024-05-03 08:15:31,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 08:15:31,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 08:15:31,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 08:15:31,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-03 08:15:31,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 08:15:31,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368775391] [2024-05-03 08:15:31,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368775391] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 08:15:31,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 08:15:31,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-03 08:15:31,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384676782] [2024-05-03 08:15:31,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 08:15:31,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-03 08:15:31,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 08:15:31,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-03 08:15:31,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-05-03 08:15:31,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:15:31,418 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 08:15:31,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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-05-03 08:15:31,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:15:31,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:15:31,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:15:31,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:15:31,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:15:31,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-03 08:15:31,454 INFO L78 Accepts]: Start accepts. Automaton has currently 127 states, but on-demand construction may add more states Word has length 96 [2024-05-03 08:15:31,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 08:15:31,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-03 08:15:31,455 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 08:15:31,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 08:15:31,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1301160792, now seen corresponding path program 1 times [2024-05-03 08:15:31,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 08:15:31,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278567457] [2024-05-03 08:15:31,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 08:15:31,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 08:15:31,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 08:15:31,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-03 08:15:31,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 08:15:31,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278567457] [2024-05-03 08:15:31,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278567457] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 08:15:31,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 08:15:31,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-03 08:15:31,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702627871] [2024-05-03 08:15:31,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 08:15:31,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-03 08:15:31,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 08:15:31,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-03 08:15:31,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-03 08:15:31,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:15:31,611 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 08:15:31,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 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-05-03 08:15:31,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:15:31,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:15:31,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-03 08:15:31,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:15:31,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:15:31,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:15:31,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-03 08:15:31,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:15:31,765 INFO L78 Accepts]: Start accepts. Automaton has currently 586 states, but on-demand construction may add more states Word has length 119 [2024-05-03 08:15:31,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 08:15:31,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-03 08:15:31,766 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 08:15:31,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 08:15:31,768 INFO L85 PathProgramCache]: Analyzing trace with hash -982199529, now seen corresponding path program 2 times [2024-05-03 08:15:31,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 08:15:31,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941183703] [2024-05-03 08:15:31,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 08:15:31,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 08:15:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 08:15:32,717 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 08:15:32,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 08:15:32,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941183703] [2024-05-03 08:15:32,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941183703] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 08:15:32,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526385264] [2024-05-03 08:15:32,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-03 08:15:32,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 08:15:32,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 08:15:32,733 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 08:15:32,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-03 08:15:32,842 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-03 08:15:32,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 08:15:32,844 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 44 conjunts are in the unsatisfiable core [2024-05-03 08:15:32,853 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 08:15:33,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-05-03 08:15:33,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-03 08:15:33,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-03 08:15:34,107 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 08:15:34,108 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 08:15:35,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 08:15:35,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 50 [2024-05-03 08:15:35,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 08:15:35,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 316 treesize of output 292 [2024-05-03 08:15:35,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 08:15:35,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 92 [2024-05-03 08:15:35,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 08:15:35,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 79 [2024-05-03 08:15:35,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 08:15:35,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 51 [2024-05-03 08:15:35,597 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-03 08:15:35,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 324 treesize of output 296 [2024-05-03 08:15:35,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 08:15:35,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 84 [2024-05-03 08:15:35,617 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-03 08:15:35,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 75 [2024-05-03 08:15:36,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 08:15:36,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526385264] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 08:15:36,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 08:15:36,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26, 23] total 60 [2024-05-03 08:15:36,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416811371] [2024-05-03 08:15:36,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 08:15:36,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-05-03 08:15:36,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 08:15:36,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-05-03 08:15:36,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=613, Invalid=2902, Unknown=25, NotChecked=0, Total=3540 [2024-05-03 08:15:36,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:15:36,115 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 08:15:36,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 4.983333333333333) internal successors, (299), 60 states have internal predecessors, (299), 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-05-03 08:15:36,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:15:36,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:15:36,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-03 08:15:36,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:15:36,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:15:37,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:15:37,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:15:37,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-03 08:15:37,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:15:37,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-05-03 08:15:37,986 INFO L78 Accepts]: Start accepts. Automaton has currently 744 states, but on-demand construction may add more states Word has length 142 [2024-05-03 08:15:37,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 08:15:38,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-03 08:15:38,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 08:15:38,193 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 08:15:38,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 08:15:38,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1749994290, now seen corresponding path program 3 times [2024-05-03 08:15:38,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 08:15:38,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203862723] [2024-05-03 08:15:38,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 08:15:38,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 08:15:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 08:15:38,376 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-03 08:15:38,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 08:15:38,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203862723] [2024-05-03 08:15:38,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203862723] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 08:15:38,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 08:15:38,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-03 08:15:38,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902960035] [2024-05-03 08:15:38,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 08:15:38,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-03 08:15:38,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 08:15:38,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-03 08:15:38,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-05-03 08:15:38,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:15:38,378 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 08:15:38,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 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-05-03 08:15:38,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:15:38,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:15:38,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-03 08:15:38,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:15:38,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-05-03 08:15:38,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:15:38,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:15:38,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:15:38,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-03 08:15:38,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:15:38,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-05-03 08:15:38,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:15:38,526 INFO L78 Accepts]: Start accepts. Automaton has currently 1106 states, but on-demand construction may add more states Word has length 150 [2024-05-03 08:15:38,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 08:15:38,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-03 08:15:38,527 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 08:15:38,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 08:15:38,527 INFO L85 PathProgramCache]: Analyzing trace with hash 897361147, now seen corresponding path program 4 times [2024-05-03 08:15:38,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 08:15:38,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896295325] [2024-05-03 08:15:38,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 08:15:38,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 08:15:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 08:15:38,683 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-05-03 08:15:38,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 08:15:38,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896295325] [2024-05-03 08:15:38,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896295325] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 08:15:38,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 08:15:38,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-03 08:15:38,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664426193] [2024-05-03 08:15:38,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 08:15:38,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-03 08:15:38,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 08:15:38,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-03 08:15:38,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-03 08:15:38,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:15:38,689 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 08:15:38,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 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-05-03 08:15:38,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:15:38,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:15:38,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-03 08:15:38,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:15:38,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-05-03 08:15:38,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:15:38,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:15:38,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:15:38,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:15:38,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-03 08:15:38,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:15:38,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-05-03 08:15:38,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:15:38,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-03 08:15:38,743 INFO L78 Accepts]: Start accepts. Automaton has currently 1008 states, but on-demand construction may add more states Word has length 150 [2024-05-03 08:15:38,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 08:15:38,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-03 08:15:38,744 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 08:15:38,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 08:15:38,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1225905734, now seen corresponding path program 1 times [2024-05-03 08:15:38,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 08:15:38,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589461048] [2024-05-03 08:15:38,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 08:15:38,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 08:15:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 08:15:40,473 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 08:15:40,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 08:15:40,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589461048] [2024-05-03 08:15:40,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589461048] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 08:15:40,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030436456] [2024-05-03 08:15:40,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 08:15:40,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 08:15:40,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 08:15:40,474 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 08:15:40,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-03 08:15:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 08:15:40,560 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 54 conjunts are in the unsatisfiable core [2024-05-03 08:15:40,564 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 08:15:42,217 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 08:15:42,219 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 08:15:43,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 08:15:43,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 60 [2024-05-03 08:15:44,037 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 08:15:44,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030436456] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 08:15:44,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 08:15:44,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 26] total 80 [2024-05-03 08:15:44,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569810383] [2024-05-03 08:15:44,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 08:15:44,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2024-05-03 08:15:44,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 08:15:44,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2024-05-03 08:15:44,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=816, Invalid=5504, Unknown=0, NotChecked=0, Total=6320 [2024-05-03 08:15:44,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:15:44,041 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 08:15:44,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 4.8375) internal successors, (387), 80 states have internal predecessors, (387), 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-05-03 08:15:44,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:15:44,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:15:44,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-03 08:15:44,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:15:44,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-05-03 08:15:44,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:15:44,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-03 08:15:44,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:15:46,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:15:46,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:15:46,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-03 08:15:46,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:15:46,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-05-03 08:15:46,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:15:46,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-03 08:15:46,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-05-03 08:15:46,773 INFO L78 Accepts]: Start accepts. Automaton has currently 1453 states, but on-demand construction may add more states Word has length 181 [2024-05-03 08:15:46,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 08:15:46,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-03 08:15:46,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 08:15:46,982 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 08:15:46,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 08:15:46,982 INFO L85 PathProgramCache]: Analyzing trace with hash 295866322, now seen corresponding path program 2 times [2024-05-03 08:15:46,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 08:15:46,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109601272] [2024-05-03 08:15:46,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 08:15:46,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 08:15:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 08:15:49,351 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 08:15:49,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 08:15:49,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109601272] [2024-05-03 08:15:49,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109601272] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 08:15:49,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106704366] [2024-05-03 08:15:49,352 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-03 08:15:49,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 08:15:49,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 08:15:49,364 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 08:15:49,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-03 08:15:49,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-03 08:15:49,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 08:15:49,453 INFO L262 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 66 conjunts are in the unsatisfiable core [2024-05-03 08:15:49,457 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 08:15:51,685 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 4 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 08:15:51,686 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 08:15:53,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 08:15:53,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 114 [2024-05-03 08:15:54,632 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 08:15:54,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106704366] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 08:15:54,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 08:15:54,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 37, 36] total 102 [2024-05-03 08:15:54,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258234011] [2024-05-03 08:15:54,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 08:15:54,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-05-03 08:15:54,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 08:15:54,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-05-03 08:15:54,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1314, Invalid=8988, Unknown=0, NotChecked=0, Total=10302 [2024-05-03 08:15:54,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:15:54,642 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 08:15:54,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 4.647058823529412) internal successors, (474), 102 states have internal predecessors, (474), 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-05-03 08:15:54,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:15:54,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:15:54,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-03 08:15:54,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:15:54,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-05-03 08:15:54,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:15:54,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-03 08:15:54,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2024-05-03 08:15:54,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:16:00,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:16:00,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:16:00,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-03 08:16:00,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:16:00,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-05-03 08:16:00,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:16:00,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-03 08:16:00,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-05-03 08:16:00,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-05-03 08:16:00,018 INFO L78 Accepts]: Start accepts. Automaton has currently 1898 states, but on-demand construction may add more states Word has length 212 [2024-05-03 08:16:00,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 08:16:00,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-03 08:16:00,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 08:16:00,225 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 08:16:00,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 08:16:00,225 INFO L85 PathProgramCache]: Analyzing trace with hash -452612257, now seen corresponding path program 3 times [2024-05-03 08:16:00,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 08:16:00,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424166534] [2024-05-03 08:16:00,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 08:16:00,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 08:16:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 08:16:03,391 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 19 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 08:16:03,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 08:16:03,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424166534] [2024-05-03 08:16:03,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424166534] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 08:16:03,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783918630] [2024-05-03 08:16:03,392 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-03 08:16:03,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 08:16:03,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 08:16:03,393 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 08:16:03,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-05-03 08:16:03,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-05-03 08:16:03,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 08:16:03,594 INFO L262 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 111 conjunts are in the unsatisfiable core [2024-05-03 08:16:03,599 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 08:16:04,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-05-03 08:16:05,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-03 08:16:05,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-03 08:16:08,428 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 194 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 08:16:08,428 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 08:16:16,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 08:16:16,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 242 treesize of output 158 [2024-05-03 08:16:16,502 INFO L349 Elim1Store]: treesize reduction 88, result has 51.4 percent of original size [2024-05-03 08:16:16,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 1030 treesize of output 984 [2024-05-03 08:16:16,536 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:16:16,538 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:16:16,539 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:16:16,539 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:16:16,540 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:16:16,542 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:16:16,544 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:16:16,545 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:16:16,545 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:16:16,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 08:16:16,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 18 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 339 treesize of output 378 [2024-05-03 08:16:16,786 INFO L349 Elim1Store]: treesize reduction 88, result has 51.4 percent of original size [2024-05-03 08:16:16,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 337 treesize of output 323 [2024-05-03 08:16:21,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 08:16:21,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 243 treesize of output 159 [2024-05-03 08:16:21,517 INFO L349 Elim1Store]: treesize reduction 164, result has 9.4 percent of original size [2024-05-03 08:16:21,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 1038 treesize of output 916 [2024-05-03 08:16:21,538 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:16:21,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 08:16:21,540 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:16:21,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 08:16:21,541 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:16:21,541 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:16:21,542 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:16:21,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 08:16:21,558 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:16:21,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 08:16:21,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 339 treesize of output 286 [2024-05-03 08:16:21,622 INFO L349 Elim1Store]: treesize reduction 164, result has 9.4 percent of original size [2024-05-03 08:16:21,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 337 treesize of output 247 [2024-05-03 08:16:23,671 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 194 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 08:16:23,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783918630] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 08:16:23,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 08:16:23,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 61, 56] total 158 [2024-05-03 08:16:23,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400979143] [2024-05-03 08:16:23,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 08:16:23,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 158 states [2024-05-03 08:16:23,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 08:16:23,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2024-05-03 08:16:23,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3765, Invalid=20987, Unknown=54, NotChecked=0, Total=24806 [2024-05-03 08:16:23,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:16:23,716 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 08:16:23,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 158 states, 158 states have (on average 3.6962025316455698) internal successors, (584), 158 states have internal predecessors, (584), 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-05-03 08:16:23,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:16:23,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:16:23,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-03 08:16:23,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:16:23,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-05-03 08:16:23,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:16:23,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-03 08:16:23,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-05-03 08:16:23,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2024-05-03 08:16:23,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:16:23,987 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse22 (* c_~front~0 4)) (.cse21 (* c_~back~0 4))) (let ((.cse64 (+ c_~queue~0.offset .cse21 4)) (.cse61 (+ c_~queue~0.offset .cse21)) (.cse63 (+ c_~queue~0.offset .cse22)) (.cse46 (select |c_#memory_int| c_~queue~0.base)) (.cse60 (+ c_~queue~0.offset .cse21 8))) (let ((.cse49 (mod |c_thread2Thread1of1ForFork1_~flag~0#1| 256)) (.cse18 (+ c_~front~0 1)) (.cse2 (< c_~back~0 c_~front~0)) (.cse57 (+ c_~back~0 3)) (.cse58 (select .cse46 .cse60)) (.cse4 (select .cse46 (+ c_~queue~0.offset .cse22 8))) (.cse5 (select .cse46 .cse63)) (.cse6 (select .cse46 (+ c_~queue~0.offset .cse22 4))) (.cse93 (select .cse46 .cse61)) (.cse96 (+ c_~back~0 2)) (.cse97 (select .cse46 .cse64)) (.cse15 (+ c_~back~0 1)) (.cse74 (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1)) (.cse47 (* 4 |c_thread1Thread1of1ForFork0_#t~post2#1|))) (let ((.cse45 (select .cse46 (+ c_~queue~0.offset 4 .cse47))) (.cse43 (< c_~back~0 .cse74)) (.cse25 (< .cse15 0)) (.cse26 (not (= (+ .cse97 1) 0))) (.cse27 (< c_~n~0 .cse96)) (.cse29 (not (= .cse93 1))) (.cse54 (+ c_~queue~0.offset .cse21 12)) (.cse70 (let ((.cse98 (+ c_~sum~0 .cse4 .cse5 .cse6))) (and (<= 0 .cse98) (<= .cse98 1)))) (.cse0 (not (= (+ .cse58 1) 0))) (.cse1 (not (= .cse97 1))) (.cse7 (< c_~n~0 .cse57)) (.cse9 (< .cse96 0)) (.cse48 (let ((.cse95 (+ c_~sum~0 .cse5))) (and (<= .cse95 1) (<= 0 .cse95)))) (.cse23 (< c_~n~0 (+ c_~back~0 4))) (.cse53 (and (or .cse2 (< c_~sum~0 2)) (or .cse2 (< 0 (+ c_~sum~0 1))) (or .cse2 (= c_~back~0 c_~front~0)))) (.cse50 (let ((.cse94 (+ c_~sum~0 .cse5 .cse6))) (and (<= .cse94 1) (<= 0 .cse94)))) (.cse30 (< c_~n~0 .cse15)) (.cse31 (< c_~back~0 .cse18)) (.cse32 (= .cse49 0)) (.cse24 (< c_~back~0 0)) (.cse8 (not (= (+ .cse93 1) 0)))) (and (or .cse0 .cse1 .cse2 (let ((.cse3 (+ c_~sum~0 .cse4 .cse5 c_~element~0 .cse6))) (and (<= .cse3 1) (<= 0 .cse3))) .cse7 .cse8 .cse9) (or (let ((.cse11 (+ .cse21 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse12 (+ .cse21 12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse13 (+ .cse21 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse17 (+ .cse22 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse14 (+ .cse21 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4))) (and (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_197) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_198) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse10 .cse11) 1)) (not (= (+ (select .cse10 .cse12) 1) 0)) (not (= (select .cse10 .cse13) 1)) (not (= (+ (select .cse10 .cse14) 1) 0)) (forall ((v_~front~0_22 Int)) (or (< .cse15 v_~front~0_22) (< (let ((.cse16 (* v_~front~0_22 4))) (+ c_~sum~0 (select .cse10 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| .cse16)) (select .cse10 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4 .cse16)) (select .cse10 .cse17) (select .cse10 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| .cse16)))) 2) (< v_~front~0_22 .cse18)))))) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (let ((.cse19 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_197) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_198) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse19 .cse11) 1)) (not (= (+ (select .cse19 .cse12) 1) 0)) (not (= (select .cse19 .cse13) 1)) (forall ((v_~front~0_22 Int)) (or (< 0 (let ((.cse20 (* v_~front~0_22 4))) (+ c_~sum~0 (select .cse19 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| .cse20)) (select .cse19 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4 .cse20)) (select .cse19 .cse17) (select .cse19 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| .cse20)) 1))) (< .cse15 v_~front~0_22) (< v_~front~0_22 .cse18))) (not (= (+ (select .cse19 .cse14) 1) 0))))))) .cse23 .cse24) (or .cse25 .cse26 .cse2 .cse27 (let ((.cse28 (+ c_~sum~0 .cse5 c_~element~0 .cse6))) (and (<= 0 .cse28) (<= .cse28 1))) .cse29) (or .cse30 .cse31 .cse32 (let ((.cse33 (+ c_~sum~0 .cse6 |c_thread1Thread1of1ForFork0_#t~mem1#1|))) (and (<= 0 .cse33) (<= .cse33 1))) .cse24 .cse8) (or .cse23 (let ((.cse35 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse21 4)) (.cse37 (+ .cse22 |c_ULTIMATE.start_main_#t~ret10#1.offset|)) (.cse38 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse21 8)) (.cse39 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse21 12)) (.cse40 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse21))) (and (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (let ((.cse34 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_197) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_198) |c_ULTIMATE.start_main_#t~ret10#1.base|))) (or (not (= (+ (select .cse34 .cse35) 1) 0)) (forall ((v_~front~0_22 Int)) (or (< .cse15 v_~front~0_22) (< (let ((.cse36 (* v_~front~0_22 4))) (+ c_~sum~0 (select .cse34 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| 8 .cse36)) (select .cse34 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse36)) (select .cse34 .cse37) (select .cse34 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| 4 .cse36)))) 2) (< v_~front~0_22 .cse18))) (not (= (select .cse34 .cse38) 1)) (not (= (+ (select .cse34 .cse39) 1) 0)) (not (= (select .cse34 .cse40) 1))))) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (let ((.cse41 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_197) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_198) |c_ULTIMATE.start_main_#t~ret10#1.base|))) (or (not (= (+ (select .cse41 .cse35) 1) 0)) (forall ((v_~front~0_22 Int)) (or (< .cse15 v_~front~0_22) (< 0 (let ((.cse42 (* v_~front~0_22 4))) (+ c_~sum~0 (select .cse41 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| 8 .cse42)) (select .cse41 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse42)) (select .cse41 .cse37) (select .cse41 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| 4 .cse42)) 1))) (< v_~front~0_22 .cse18))) (not (= (select .cse41 .cse38) 1)) (not (= (+ (select .cse41 .cse39) 1) 0)) (not (= (select .cse41 .cse40) 1))))))) .cse24) (or .cse43 .cse25 .cse26 .cse27 (let ((.cse44 (+ c_~sum~0 .cse45 c_~element~0 (select .cse46 (+ c_~queue~0.offset 8 .cse47))))) (and (<= 0 .cse44) (<= .cse44 1))) .cse29) (or .cse30 .cse2 .cse48 .cse24 .cse8 (< 0 .cse49)) (or .cse50 .cse25 .cse26 .cse2 .cse32 .cse27) (or .cse0 .cse1 (and (forall ((v_~front~0_22 Int)) (or (< c_~back~0 v_~front~0_22) (< 0 (let ((.cse51 (* v_~front~0_22 4))) (+ c_~sum~0 (select .cse46 (+ c_~queue~0.offset 8 .cse51)) (select .cse46 (+ c_~queue~0.offset .cse51)) (select .cse46 (+ c_~queue~0.offset 4 .cse51)) |c_thread1Thread1of1ForFork0_#t~mem1#1| 1))) (< v_~front~0_22 .cse18))) (forall ((v_~front~0_22 Int)) (or (< c_~back~0 v_~front~0_22) (< (let ((.cse52 (* v_~front~0_22 4))) (+ c_~sum~0 (select .cse46 (+ c_~queue~0.offset 8 .cse52)) (select .cse46 (+ c_~queue~0.offset .cse52)) (select .cse46 (+ c_~queue~0.offset 4 .cse52)) |c_thread1Thread1of1ForFork0_#t~mem1#1|)) 2) (< v_~front~0_22 .cse18)))) .cse7 .cse8 .cse9) (or (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post18#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse23 .cse53 .cse24) (or (not (= (+ (select .cse46 .cse54) 1) 0)) (and (forall ((v_~front~0_22 Int)) (or (< .cse15 v_~front~0_22) (< 0 (let ((.cse55 (* v_~front~0_22 4))) (+ c_~sum~0 .cse5 (select .cse46 (+ c_~queue~0.offset 8 .cse55)) (select .cse46 (+ c_~queue~0.offset .cse55)) (select .cse46 (+ c_~queue~0.offset 4 .cse55)) 1))) (< v_~front~0_22 .cse18))) (forall ((v_~front~0_22 Int)) (or (< (let ((.cse56 (* v_~front~0_22 4))) (+ c_~sum~0 .cse5 (select .cse46 (+ c_~queue~0.offset 8 .cse56)) (select .cse46 (+ c_~queue~0.offset .cse56)) (select .cse46 (+ c_~queue~0.offset 4 .cse56)))) 2) (< .cse15 v_~front~0_22) (< v_~front~0_22 .cse18)))) (< .cse57 0) .cse26 .cse23 (not (= .cse58 1))) (or .cse23 (and (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (let ((.cse59 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_197) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_198) c_~queue~0.base))) (or (not (= (+ (select .cse59 .cse54) 1) 0)) (not (= (select .cse59 .cse60) 1)) (not (= (select .cse59 .cse61) 1)) (forall ((v_~front~0_22 Int)) (or (< (let ((.cse62 (* v_~front~0_22 4))) (+ c_~sum~0 (select .cse59 (+ c_~queue~0.offset .cse62)) (select .cse59 (+ c_~queue~0.offset 4 .cse62)) (select .cse59 .cse63) (select .cse59 (+ c_~queue~0.offset 8 .cse62)))) 2) (< .cse15 v_~front~0_22) (< v_~front~0_22 .cse18))) (not (= (+ (select .cse59 .cse64) 1) 0))))) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (let ((.cse65 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_197) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_198) c_~queue~0.base))) (or (not (= (+ (select .cse65 .cse54) 1) 0)) (not (= (select .cse65 .cse60) 1)) (not (= (select .cse65 .cse61) 1)) (not (= (+ (select .cse65 .cse64) 1) 0)) (forall ((v_~front~0_22 Int)) (or (< 0 (let ((.cse66 (* v_~front~0_22 4))) (+ c_~sum~0 (select .cse65 (+ c_~queue~0.offset .cse66)) (select .cse65 (+ c_~queue~0.offset 4 .cse66)) (select .cse65 .cse63) (select .cse65 (+ c_~queue~0.offset 8 .cse66)) 1))) (< .cse15 v_~front~0_22) (< v_~front~0_22 .cse18))))))) .cse24) (or .cse25 .cse31 .cse26 .cse27 (let ((.cse67 (+ c_~sum~0 .cse4 .cse6 |c_thread1Thread1of1ForFork0_#t~mem1#1|))) (and (<= .cse67 1) (<= 0 .cse67))) .cse29) (or .cse0 .cse1 (and (forall ((v_~front~0_22 Int)) (or (< c_~back~0 v_~front~0_22) (< 0 (let ((.cse68 (* v_~front~0_22 4))) (+ c_~sum~0 c_~element~0 (select .cse46 (+ c_~queue~0.offset 8 .cse68)) (select .cse46 (+ c_~queue~0.offset .cse68)) (select .cse46 (+ c_~queue~0.offset 4 .cse68)) 1))) (< v_~front~0_22 .cse18))) (forall ((v_~front~0_22 Int)) (or (< c_~back~0 v_~front~0_22) (< (let ((.cse69 (* v_~front~0_22 4))) (+ c_~sum~0 c_~element~0 (select .cse46 (+ c_~queue~0.offset 8 .cse69)) (select .cse46 (+ c_~queue~0.offset .cse69)) (select .cse46 (+ c_~queue~0.offset 4 .cse69)))) 2) (< v_~front~0_22 .cse18)))) .cse7 .cse8 .cse9) (or (< 4 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse23 .cse53 .cse24) (or .cse50 .cse25 .cse26 .cse2 .cse27 .cse29) (or .cse25 .cse31 .cse26 .cse27 .cse70 .cse29) (or .cse30 (let ((.cse71 (+ c_~sum~0 .cse5 c_~element~0))) (and (<= 0 .cse71) (<= .cse71 1))) .cse2 .cse32 .cse24 .cse8) (or (let ((.cse72 (+ c_~sum~0 .cse45 c_~element~0))) (and (<= .cse72 1) (<= 0 .cse72))) .cse43 .cse30 .cse32 .cse24 .cse8) (or .cse0 .cse1 .cse7 .cse8 .cse9 (and (forall ((v_~front~0_22 Int)) (or (< c_~back~0 v_~front~0_22) (< (let ((.cse73 (* v_~front~0_22 4))) (+ c_~sum~0 c_~element~0 (select .cse46 (+ c_~queue~0.offset 8 .cse73)) (select .cse46 (+ c_~queue~0.offset .cse73)) (select .cse46 (+ c_~queue~0.offset 4 .cse73)))) 2) (< v_~front~0_22 .cse74))) (forall ((v_~front~0_22 Int)) (or (< c_~back~0 v_~front~0_22) (< 0 (let ((.cse75 (* v_~front~0_22 4))) (+ c_~sum~0 c_~element~0 (select .cse46 (+ c_~queue~0.offset 8 .cse75)) (select .cse46 (+ c_~queue~0.offset .cse75)) (select .cse46 (+ c_~queue~0.offset 4 .cse75)) 1))) (< v_~front~0_22 .cse74))))) (or .cse25 .cse31 (let ((.cse76 (+ c_~sum~0 .cse4 c_~element~0 .cse6))) (and (<= 0 .cse76) (<= .cse76 1))) .cse26 .cse27 .cse29) (or .cse23 .cse24 (and (forall ((v_ArrVal_198 (Array Int Int))) (let ((.cse77 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_198) c_~queue~0.base))) (or (not (= (+ (select .cse77 .cse64) 1) 0)) (forall ((v_~front~0_22 Int)) (or (< .cse15 v_~front~0_22) (< 0 (let ((.cse78 (* v_~front~0_22 4))) (+ (select .cse77 (+ c_~queue~0.offset 4 .cse78)) c_~sum~0 (select .cse77 (+ c_~queue~0.offset 8 .cse78)) (select .cse77 (+ c_~queue~0.offset .cse78)) (select .cse77 .cse63) 1))) (< v_~front~0_22 .cse18))) (not (= (select .cse77 .cse61) 1)) (not (= (select .cse77 .cse60) 1)) (not (= (+ 1 (select .cse77 .cse54)) 0))))) (forall ((v_ArrVal_198 (Array Int Int))) (let ((.cse79 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_198) c_~queue~0.base))) (or (not (= (+ (select .cse79 .cse64) 1) 0)) (not (= (select .cse79 .cse61) 1)) (not (= (select .cse79 .cse60) 1)) (forall ((v_~front~0_22 Int)) (or (< (let ((.cse80 (* v_~front~0_22 4))) (+ (select .cse79 (+ c_~queue~0.offset 4 .cse80)) c_~sum~0 (select .cse79 (+ c_~queue~0.offset 8 .cse80)) (select .cse79 (+ c_~queue~0.offset .cse80)) (select .cse79 .cse63))) 2) (< .cse15 v_~front~0_22) (< v_~front~0_22 .cse18))) (not (= (+ 1 (select .cse79 .cse54)) 0))))))) (or .cse0 .cse1 .cse2 .cse7 .cse70 .cse9) (or .cse30 .cse31 .cse32 .cse24 (let ((.cse81 (+ c_~sum~0 c_~element~0 .cse6))) (and (<= 0 .cse81) (<= .cse81 1))) .cse8) (or (and (forall ((v_~front~0_22 Int)) (or (< c_~back~0 v_~front~0_22) (< 0 (let ((.cse82 (* v_~front~0_22 4))) (+ c_~sum~0 .cse5 (select .cse46 (+ c_~queue~0.offset 8 .cse82)) (select .cse46 (+ c_~queue~0.offset .cse82)) (select .cse46 (+ c_~queue~0.offset 4 .cse82)) 1))) (< v_~front~0_22 .cse18))) (forall ((v_~front~0_22 Int)) (or (< (let ((.cse83 (* v_~front~0_22 4))) (+ c_~sum~0 .cse5 (select .cse46 (+ c_~queue~0.offset 8 .cse83)) (select .cse46 (+ c_~queue~0.offset .cse83)) (select .cse46 (+ c_~queue~0.offset 4 .cse83)))) 2) (< c_~back~0 v_~front~0_22) (< v_~front~0_22 .cse18)))) .cse0 .cse1 .cse7 .cse8 .cse9) (or (< (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse23 .cse53 .cse24) (or .cse30 .cse2 .cse32 .cse48 .cse24 .cse8) (or (let ((.cse85 (+ .cse21 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse86 (+ .cse21 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse88 (+ .cse22 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse89 (+ .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse90 (+ .cse21 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (let ((.cse84 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_197) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_198) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse84 .cse85) 1)) (not (= (+ (select .cse84 .cse86) 1) 0)) (forall ((v_~front~0_22 Int)) (or (< .cse15 v_~front~0_22) (< (let ((.cse87 (* v_~front~0_22 4))) (+ c_~sum~0 (select .cse84 (+ .cse87 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse84 .cse88) (select .cse84 (+ 4 .cse87 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse84 (+ 8 .cse87 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) 2) (< v_~front~0_22 .cse18))) (not (= (select .cse84 .cse89) 1)) (not (= (+ (select .cse84 .cse90) 1) 0))))) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (let ((.cse91 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_197) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_198) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse91 .cse85) 1)) (not (= (+ (select .cse91 .cse86) 1) 0)) (forall ((v_~front~0_22 Int)) (or (< .cse15 v_~front~0_22) (< 0 (let ((.cse92 (* v_~front~0_22 4))) (+ c_~sum~0 (select .cse91 (+ .cse92 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse91 .cse88) (select .cse91 (+ 4 .cse92 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse91 (+ 8 .cse92 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))) (< v_~front~0_22 .cse18))) (not (= (select .cse91 .cse89) 1)) (not (= (+ (select .cse91 .cse90) 1) 0))))))) .cse23 .cse24) (or .cse23 .cse53 .cse24 (< 4 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (= c_~sum~0 0) (or .cse50 .cse30 .cse31 .cse32 .cse24 .cse8)))))) is different from false [2024-05-03 08:16:31,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-03 08:16:37,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-03 08:16:39,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-03 08:16:44,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-03 08:16:45,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-03 08:16:56,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-03 08:16:58,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-03 08:17:01,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-03 08:17:12,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-03 08:17:15,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-03 08:17:19,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-03 08:17:47,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:17:47,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:17:47,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-03 08:17:47,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:17:47,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-05-03 08:17:47,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:17:47,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-03 08:17:47,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-05-03 08:17:47,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-05-03 08:17:47,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2024-05-03 08:17:47,177 INFO L78 Accepts]: Start accepts. Automaton has currently 2449 states, but on-demand construction may add more states Word has length 243 [2024-05-03 08:17:47,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 08:17:47,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-05-03 08:17:47,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-05-03 08:17:47,385 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 08:17:47,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 08:17:47,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1972667341, now seen corresponding path program 4 times [2024-05-03 08:17:47,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 08:17:47,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029973184] [2024-05-03 08:17:47,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 08:17:47,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 08:17:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 08:17:51,274 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 27 proven. 291 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 08:17:51,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 08:17:51,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029973184] [2024-05-03 08:17:51,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029973184] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 08:17:51,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531777783] [2024-05-03 08:17:51,275 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-03 08:17:51,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 08:17:51,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 08:17:51,278 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 08:17:51,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-05-03 08:17:51,394 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-03 08:17:51,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 08:17:51,396 INFO L262 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 103 conjunts are in the unsatisfiable core [2024-05-03 08:17:51,400 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 08:17:55,357 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 8 proven. 310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 08:17:55,358 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 08:17:59,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 08:17:59,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 176 treesize of output 284 [2024-05-03 08:18:01,365 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 0 proven. 318 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 08:18:01,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531777783] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 08:18:01,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 08:18:01,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 55, 54] total 156 [2024-05-03 08:18:01,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845739187] [2024-05-03 08:18:01,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 08:18:01,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 156 states [2024-05-03 08:18:01,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 08:18:01,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2024-05-03 08:18:01,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3042, Invalid=21138, Unknown=0, NotChecked=0, Total=24180 [2024-05-03 08:18:01,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:18:01,372 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 08:18:01,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 156 states, 156 states have (on average 4.230769230769231) internal successors, (660), 156 states have internal predecessors, (660), 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-05-03 08:18:01,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:18:01,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:18:01,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-03 08:18:01,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:18:01,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-05-03 08:18:01,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:18:01,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-03 08:18:01,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-05-03 08:18:01,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2024-05-03 08:18:01,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 203 states. [2024-05-03 08:18:01,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:18:16,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:18:16,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:18:16,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-03 08:18:16,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:18:16,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-05-03 08:18:16,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:18:16,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-03 08:18:16,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-05-03 08:18:16,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-05-03 08:18:16,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2024-05-03 08:18:16,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2024-05-03 08:18:16,042 INFO L78 Accepts]: Start accepts. Automaton has currently 2894 states, but on-demand construction may add more states Word has length 274 [2024-05-03 08:18:16,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 08:18:16,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-05-03 08:18:16,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 08:18:16,249 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 08:18:16,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 08:18:16,249 INFO L85 PathProgramCache]: Analyzing trace with hash 427492804, now seen corresponding path program 5 times [2024-05-03 08:18:16,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 08:18:16,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727980132] [2024-05-03 08:18:16,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 08:18:16,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 08:18:16,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 08:18:22,000 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 142 proven. 329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 08:18:22,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 08:18:22,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727980132] [2024-05-03 08:18:22,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727980132] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 08:18:22,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274566941] [2024-05-03 08:18:22,000 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-03 08:18:22,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 08:18:22,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 08:18:22,002 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 08:18:22,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-05-03 08:18:22,173 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2024-05-03 08:18:22,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 08:18:22,177 INFO L262 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 126 conjunts are in the unsatisfiable core [2024-05-03 08:18:22,181 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 08:18:29,098 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 8 proven. 463 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 08:18:29,098 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 08:18:35,779 INFO L349 Elim1Store]: treesize reduction 150, result has 57.0 percent of original size [2024-05-03 08:18:35,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 211 treesize of output 250 [2024-05-03 08:18:38,730 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 0 proven. 471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 08:18:38,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274566941] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 08:18:38,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 08:18:38,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 75, 67] total 201 [2024-05-03 08:18:38,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781804336] [2024-05-03 08:18:38,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 08:18:38,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 201 states [2024-05-03 08:18:38,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 08:18:38,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 201 interpolants. [2024-05-03 08:18:38,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5550, Invalid=34650, Unknown=0, NotChecked=0, Total=40200 [2024-05-03 08:18:38,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:18:38,747 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 08:18:38,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 201 states, 201 states have (on average 3.800995024875622) internal successors, (764), 201 states have internal predecessors, (764), 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-05-03 08:18:38,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:18:38,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:18:38,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-03 08:18:38,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:18:38,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-05-03 08:18:38,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:18:38,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-03 08:18:38,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-05-03 08:18:38,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2024-05-03 08:18:38,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 209 states. [2024-05-03 08:18:38,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 110 states. [2024-05-03 08:18:38,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:19:29,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 08:19:29,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:19:29,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-03 08:19:29,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:19:29,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-05-03 08:19:29,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 08:19:29,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-03 08:19:29,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-05-03 08:19:29,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-05-03 08:19:29,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2024-05-03 08:19:29,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2024-05-03 08:19:29,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 223 states. [2024-05-03 08:19:29,583 INFO L78 Accepts]: Start accepts. Automaton has currently 3346 states, but on-demand construction may add more states Word has length 305 [2024-05-03 08:19:29,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 08:19:29,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-05-03 08:19:29,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-05-03 08:19:29,794 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 08:19:29,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 08:19:29,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1974968072, now seen corresponding path program 6 times [2024-05-03 08:19:29,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 08:19:29,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599457496] [2024-05-03 08:19:29,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 08:19:29,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 08:19:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 08:19:35,841 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 210 proven. 445 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 08:19:35,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 08:19:35,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599457496] [2024-05-03 08:19:35,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599457496] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 08:19:35,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127163218] [2024-05-03 08:19:35,842 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-03 08:19:35,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 08:19:35,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 08:19:35,843 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 08:19:35,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-05-03 08:19:36,380 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2024-05-03 08:19:36,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 08:19:36,384 INFO L262 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 150 conjunts are in the unsatisfiable core [2024-05-03 08:19:36,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 08:19:37,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-05-03 08:19:37,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-05-03 08:19:38,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-05-03 08:19:38,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-03 08:19:38,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-03 08:19:53,364 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:19:53,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 08:19:53,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 08:19:53,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 08:19:53,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 08:19:53,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 08:19:53,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 08:19:53,371 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:19:53,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 08:19:53,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 08:19:53,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 08:19:53,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 08:19:53,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 08:19:53,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 08:19:53,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 08:19:53,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 08:19:53,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 08:19:53,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 08:19:53,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 08:19:53,390 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:19:53,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 08:19:53,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 08:19:53,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 08:19:53,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 08:19:53,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 08:19:53,588 INFO L349 Elim1Store]: treesize reduction 82, result has 69.2 percent of original size [2024-05-03 08:19:53,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 27 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 132 treesize of output 223 [2024-05-03 08:19:55,235 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 0 proven. 655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 08:19:55,235 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 08:21:42,209 INFO L349 Elim1Store]: treesize reduction 52, result has 49.5 percent of original size [2024-05-03 08:21:42,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 613 treesize of output 299 [2024-05-03 08:21:43,899 INFO L349 Elim1Store]: treesize reduction 372, result has 62.9 percent of original size [2024-05-03 08:21:43,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 1742 treesize of output 2120 [2024-05-03 08:21:44,055 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,064 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,065 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,065 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,072 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,072 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,073 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,073 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,076 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,076 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,076 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,077 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,077 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,078 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,088 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,088 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,089 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,091 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,096 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,098 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,110 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,110 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,111 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,111 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,118 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,119 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,119 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,120 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,120 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,122 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,130 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,138 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,138 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,139 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,139 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,142 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,142 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,143 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,145 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,146 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,148 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-03 08:21:44,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 08:21:44,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 14 select indices, 14 select index equivalence classes, 51 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 40 case distinctions, treesize of input 560 treesize of output 844 [2024-05-03 08:21:45,854 INFO L349 Elim1Store]: treesize reduction 372, result has 50.2 percent of original size [2024-05-03 08:21:45,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 563 treesize of output 757 [2024-05-03 08:24:08,870 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-05-03 08:24:08,871 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-05-03 08:24:08,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2024-05-03 08:24:08,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-05-03 08:24:09,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 08:24:09,072 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2024-05-03 08:24:09,076 INFO L158 Benchmark]: Toolchain (without parser) took 519898.37ms. Allocated memory was 360.7MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 288.6MB in the beginning and 1.1GB in the end (delta: -811.5MB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2024-05-03 08:24:09,076 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 180.4MB. Free memory is still 145.7MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-03 08:24:09,077 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.72ms. Allocated memory is still 360.7MB. Free memory was 288.4MB in the beginning and 276.3MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-05-03 08:24:09,077 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.80ms. Allocated memory is still 360.7MB. Free memory was 276.3MB in the beginning and 274.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-03 08:24:09,077 INFO L158 Benchmark]: Boogie Preprocessor took 30.84ms. Allocated memory is still 360.7MB. Free memory was 274.3MB in the beginning and 272.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-03 08:24:09,077 INFO L158 Benchmark]: RCFGBuilder took 451.09ms. Allocated memory is still 360.7MB. Free memory was 272.7MB in the beginning and 308.9MB in the end (delta: -36.2MB). Peak memory consumption was 7.5MB. Max. memory is 8.0GB. [2024-05-03 08:24:09,077 INFO L158 Benchmark]: TraceAbstraction took 519168.32ms. Allocated memory was 360.7MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 307.9MB in the beginning and 1.1GB in the end (delta: -792.3MB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2024-05-03 08:24:09,079 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.09ms. Allocated memory is still 180.4MB. Free memory is still 145.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 196.72ms. Allocated memory is still 360.7MB. Free memory was 288.4MB in the beginning and 276.3MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.80ms. Allocated memory is still 360.7MB. Free memory was 276.3MB in the beginning and 274.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.84ms. Allocated memory is still 360.7MB. Free memory was 274.3MB in the beginning and 272.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 451.09ms. Allocated memory is still 360.7MB. Free memory was 272.7MB in the beginning and 308.9MB in the end (delta: -36.2MB). Peak memory consumption was 7.5MB. Max. memory is 8.0GB. * TraceAbstraction took 519168.32ms. Allocated memory was 360.7MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 307.9MB in the beginning and 1.1GB in the end (delta: -792.3MB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-05-03 08:24:09,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 Received shutdown request...