/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/test-hard1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-a4a1cd3-m [2024-05-30 20:22:05,707 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-30 20:22:05,767 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-30 20:22:05,771 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-30 20:22:05,771 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-30 20:22:05,793 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-30 20:22:05,794 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-30 20:22:05,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-30 20:22:05,795 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-30 20:22:05,799 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-30 20:22:05,799 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-30 20:22:05,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-30 20:22:05,800 INFO L153 SettingsManager]: * Use SBE=true [2024-05-30 20:22:05,801 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-30 20:22:05,801 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-30 20:22:05,802 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-30 20:22:05,802 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-30 20:22:05,802 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-30 20:22:05,802 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-30 20:22:05,803 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-30 20:22:05,803 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-30 20:22:05,803 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-30 20:22:05,804 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-30 20:22:05,804 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-30 20:22:05,804 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-30 20:22:05,804 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-30 20:22:05,804 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-30 20:22:05,804 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-30 20:22:05,804 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-30 20:22:05,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 20:22:05,805 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-30 20:22:05,805 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-30 20:22:05,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-30 20:22:05,805 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-30 20:22:05,805 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-30 20:22:05,805 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-30 20:22:05,806 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-30 20:22:05,806 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-30 20:22:05,806 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-30 20:22:05,806 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-30 20:22:06,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-30 20:22:06,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-30 20:22:06,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-30 20:22:06,080 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-30 20:22:06,081 INFO L274 PluginConnector]: CDTParser initialized [2024-05-30 20:22:06,082 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/test-hard1.wvr.c [2024-05-30 20:22:07,006 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-30 20:22:07,175 INFO L384 CDTParser]: Found 1 translation units. [2024-05-30 20:22:07,175 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-hard1.wvr.c [2024-05-30 20:22:07,181 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1bf49718a/046d9802904d430ebf88b81e8b07aa8e/FLAG0a4ddf353 [2024-05-30 20:22:07,191 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1bf49718a/046d9802904d430ebf88b81e8b07aa8e [2024-05-30 20:22:07,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-30 20:22:07,195 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-30 20:22:07,196 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-30 20:22:07,196 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-30 20:22:07,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-30 20:22:07,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 08:22:07" (1/1) ... [2024-05-30 20:22:07,201 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bda46ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 08:22:07, skipping insertion in model container [2024-05-30 20:22:07,201 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 08:22:07" (1/1) ... [2024-05-30 20:22:07,223 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-30 20:22:07,347 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/test-hard1.wvr.c[3373,3386] [2024-05-30 20:22:07,350 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 20:22:07,356 INFO L202 MainTranslator]: Completed pre-run [2024-05-30 20:22:07,375 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/test-hard1.wvr.c[3373,3386] [2024-05-30 20:22:07,379 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 20:22:07,389 INFO L206 MainTranslator]: Completed translation [2024-05-30 20:22:07,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 08:22:07 WrapperNode [2024-05-30 20:22:07,390 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-30 20:22:07,390 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-30 20:22:07,391 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-30 20:22:07,391 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-30 20:22:07,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 08:22:07" (1/1) ... [2024-05-30 20:22:07,401 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 08:22:07" (1/1) ... [2024-05-30 20:22:07,414 INFO L138 Inliner]: procedures = 24, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 97 [2024-05-30 20:22:07,414 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-30 20:22:07,415 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-30 20:22:07,415 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-30 20:22:07,415 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-30 20:22:07,421 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 08:22:07" (1/1) ... [2024-05-30 20:22:07,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 08:22:07" (1/1) ... [2024-05-30 20:22:07,423 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 08:22:07" (1/1) ... [2024-05-30 20:22:07,423 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 08:22:07" (1/1) ... [2024-05-30 20:22:07,428 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 08:22:07" (1/1) ... [2024-05-30 20:22:07,430 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 08:22:07" (1/1) ... [2024-05-30 20:22:07,431 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 08:22:07" (1/1) ... [2024-05-30 20:22:07,432 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 08:22:07" (1/1) ... [2024-05-30 20:22:07,433 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-30 20:22:07,434 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-30 20:22:07,434 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-30 20:22:07,434 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-30 20:22:07,435 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 08:22:07" (1/1) ... [2024-05-30 20:22:07,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 20:22:07,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 20:22:07,483 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-30 20:22:07,488 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-30 20:22:07,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-30 20:22:07,518 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-30 20:22:07,518 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-30 20:22:07,518 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-30 20:22:07,519 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-30 20:22:07,519 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-30 20:22:07,519 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-30 20:22:07,519 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-05-30 20:22:07,519 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-05-30 20:22:07,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-30 20:22:07,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-30 20:22:07,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-30 20:22:07,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-30 20:22:07,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-30 20:22:07,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-30 20:22:07,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-30 20:22:07,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-30 20:22:07,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-30 20:22:07,521 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-30 20:22:07,602 INFO L241 CfgBuilder]: Building ICFG [2024-05-30 20:22:07,604 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-30 20:22:07,798 INFO L282 CfgBuilder]: Performing block encoding [2024-05-30 20:22:07,851 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-30 20:22:07,851 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2024-05-30 20:22:07,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 08:22:07 BoogieIcfgContainer [2024-05-30 20:22:07,851 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-30 20:22:07,854 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-30 20:22:07,855 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-30 20:22:07,857 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-30 20:22:07,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.05 08:22:07" (1/3) ... [2024-05-30 20:22:07,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d9cd5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 08:22:07, skipping insertion in model container [2024-05-30 20:22:07,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 08:22:07" (2/3) ... [2024-05-30 20:22:07,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d9cd5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 08:22:07, skipping insertion in model container [2024-05-30 20:22:07,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 08:22:07" (3/3) ... [2024-05-30 20:22:07,859 INFO L112 eAbstractionObserver]: Analyzing ICFG test-hard1.wvr.c [2024-05-30 20:22:07,872 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-30 20:22:07,881 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-30 20:22:07,881 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-30 20:22:07,881 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-30 20:22:07,935 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-05-30 20:22:07,966 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 20:22:07,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 20:22:07,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 20:22:07,971 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-30 20:22:07,974 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-30 20:22:08,006 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 20:22:08,011 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 20:22:08,015 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;@62280ab5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 20:22:08,016 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 20:22:08,848 INFO L78 Accepts]: Start accepts. Automaton has currently 346 states, but on-demand construction may add more states Word has length 119 [2024-05-30 20:22:08,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 20:22:08,849 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 20:22:08,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 20:22:08,853 INFO L85 PathProgramCache]: Analyzing trace with hash 258051786, now seen corresponding path program 1 times [2024-05-30 20:22:08,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 20:22:08,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226499291] [2024-05-30 20:22:08,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 20:22:08,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 20:22:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 20:22:09,141 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-05-30 20:22:09,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 20:22:09,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226499291] [2024-05-30 20:22:09,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226499291] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 20:22:09,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 20:22:09,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 20:22:09,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058549825] [2024-05-30 20:22:09,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 20:22:09,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 20:22:09,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 20:22:09,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 20:22:09,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 20:22:09,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:22:09,169 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 20:22:09,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 56.5) internal successors, (113), 2 states have internal predecessors, (113), 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-30 20:22:09,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:22:09,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:22:09,226 INFO L78 Accepts]: Start accepts. Automaton has currently 346 states, but on-demand construction may add more states Word has length 117 [2024-05-30 20:22:09,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 20:22:09,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-30 20:22:09,228 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 20:22:09,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 20:22:09,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1283439068, now seen corresponding path program 1 times [2024-05-30 20:22:09,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 20:22:09,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542574214] [2024-05-30 20:22:09,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 20:22:09,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 20:22:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 20:22:09,882 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-30 20:22:09,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 20:22:09,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542574214] [2024-05-30 20:22:09,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542574214] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 20:22:09,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206775575] [2024-05-30 20:22:09,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 20:22:09,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 20:22:09,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 20:22:09,886 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-30 20:22:09,904 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-30 20:22:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 20:22:10,003 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-30 20:22:10,010 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 20:22:10,129 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-30 20:22:10,130 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 20:22:10,189 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-30 20:22:10,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206775575] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 20:22:10,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 20:22:10,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-05-30 20:22:10,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572283746] [2024-05-30 20:22:10,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 20:22:10,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-30 20:22:10,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 20:22:10,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-30 20:22:10,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-05-30 20:22:10,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:22:10,196 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 20:22:10,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 9 states have internal predecessors, (136), 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-30 20:22:10,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:22:10,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:22:10,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:22:10,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-30 20:22:10,370 INFO L78 Accepts]: Start accepts. Automaton has currently 353 states, but on-demand construction may add more states Word has length 120 [2024-05-30 20:22:10,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 20:22:10,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-30 20:22:10,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-05-30 20:22:10,578 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 20:22:10,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 20:22:10,579 INFO L85 PathProgramCache]: Analyzing trace with hash 522762587, now seen corresponding path program 2 times [2024-05-30 20:22:10,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 20:22:10,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363835176] [2024-05-30 20:22:10,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 20:22:10,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 20:22:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 20:22:10,848 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-30 20:22:10,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 20:22:10,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363835176] [2024-05-30 20:22:10,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363835176] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 20:22:10,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459306753] [2024-05-30 20:22:10,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 20:22:10,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 20:22:10,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 20:22:10,851 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-30 20:22:10,877 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-30 20:22:10,952 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 20:22:10,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 20:22:10,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-30 20:22:10,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 20:22:11,010 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-30 20:22:11,010 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 20:22:11,058 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-30 20:22:11,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459306753] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 20:22:11,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 20:22:11,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-05-30 20:22:11,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100296785] [2024-05-30 20:22:11,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 20:22:11,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-30 20:22:11,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 20:22:11,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-30 20:22:11,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-05-30 20:22:11,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:22:11,066 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 20:22:11,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 9 states have internal predecessors, (136), 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-30 20:22:11,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:22:11,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-30 20:22:11,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:22:11,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:22:11,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-30 20:22:11,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-30 20:22:11,229 INFO L78 Accepts]: Start accepts. Automaton has currently 458 states, but on-demand construction may add more states Word has length 123 [2024-05-30 20:22:11,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 20:22:11,238 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-30 20:22:11,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 20:22:11,441 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 20:22:11,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 20:22:11,441 INFO L85 PathProgramCache]: Analyzing trace with hash 23878576, now seen corresponding path program 3 times [2024-05-30 20:22:11,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 20:22:11,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432194590] [2024-05-30 20:22:11,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 20:22:11,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 20:22:11,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 20:22:13,476 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 20:22:13,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 20:22:13,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432194590] [2024-05-30 20:22:13,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432194590] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 20:22:13,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593183806] [2024-05-30 20:22:13,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 20:22:13,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 20:22:13,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 20:22:13,478 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-30 20:22:13,496 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-30 20:22:13,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-05-30 20:22:13,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 20:22:13,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 38 conjunts are in the unsatisfiable core [2024-05-30 20:22:13,717 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 20:22:18,114 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 20:22:18,115 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 20:22:51,345 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 20:22:51,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593183806] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 20:22:51,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 20:22:51,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 25, 25] total 58 [2024-05-30 20:22:51,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058497501] [2024-05-30 20:22:51,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 20:22:51,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-05-30 20:22:51,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 20:22:51,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-05-30 20:22:51,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=524, Invalid=2779, Unknown=3, NotChecked=0, Total=3306 [2024-05-30 20:22:51,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:22:51,349 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 20:22:51,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 4.275862068965517) internal successors, (248), 58 states have internal predecessors, (248), 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-30 20:22:51,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:22:51,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-30 20:22:51,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-30 20:22:51,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:22:53,483 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (not (= c_~n2~0 4))) (.cse6 (* c_~m~0 4)) (.cse22 (* (- 1) (mod c_~p1~0 4294967296))) (.cse2 (* c_~m~0 2)) (.cse23 (* (div c_~p1~0 4294967296) 4294967296)) (.cse4 (not (= 2 c_~n2~0)))) (let ((.cse0 (* c_~m~0 3)) (.cse24 (or (< (+ (* (div (+ .cse22 .cse2 4294967295 c_~p2~0) 4294967296) 4294967296) c_~p1~0) (+ .cse2 c_~p2~0 .cse23 1)) .cse4)) (.cse33 (or .cse5 (< (+ c_~p1~0 (* (div (+ .cse22 4294967295 .cse6 c_~p2~0) 4294967296) 4294967296)) (+ .cse6 c_~p2~0 .cse23 1))))) (let ((.cse15 (* (- 4) c_~p1~0)) (.cse10 (* (- 2) c_~p1~0)) (.cse18 (* 3 c_~p1~0)) (.cse21 (not (= 2 c_~n1~0))) (.cse8 (or (< 0 c_~n1~0) (and .cse24 .cse33))) (.cse32 (or (let ((.cse40 (+ c_~m~0 c_~p1~0))) (let ((.cse38 (* (- 1) (mod .cse40 4294967296))) (.cse39 (* (div .cse40 4294967296) 4294967296))) (and (or .cse5 (< (+ c_~p1~0 (* 4294967296 (div (+ .cse38 4294967295 .cse6 c_~p2~0) 4294967296))) (+ .cse0 .cse39 c_~p2~0 1))) (or .cse4 (< (+ (* (div (+ .cse38 .cse2 4294967295 c_~p2~0) 4294967296) 4294967296) c_~p1~0) (+ c_~m~0 .cse39 c_~p2~0 1)))))) (not (= c_~n1~0 1)))) (.cse34 (or (let ((.cse37 (+ .cse0 c_~p1~0))) (let ((.cse35 (* (- 1) (mod .cse37 4294967296))) (.cse36 (* (div .cse37 4294967296) 4294967296))) (and (or (< (+ (* (div (+ .cse35 .cse2 4294967295 c_~p2~0) 4294967296) 4294967296) c_~m~0 c_~p1~0) (+ .cse36 c_~p2~0 1)) .cse4) (or .cse5 (< (+ c_~p1~0 (* 4294967296 (div (+ .cse35 4294967295 .cse6 c_~p2~0) 4294967296))) (+ .cse36 c_~m~0 c_~p2~0 1)))))) (not (= 3 c_~n1~0))))) (and (or (not (= 5 c_~n1~0)) (let ((.cse7 (+ (* c_~m~0 5) c_~p1~0))) (let ((.cse1 (* (- 1) (mod .cse7 4294967296))) (.cse3 (+ (* (div .cse7 4294967296) 4294967296) c_~p2~0 1))) (and (or (< (+ .cse0 c_~p1~0 (* (div (+ .cse1 .cse2 4294967295 c_~p2~0) 4294967296) 4294967296)) .cse3) .cse4) (or .cse5 (< (+ c_~m~0 c_~p1~0 (* (div (+ .cse1 4294967295 .cse6 c_~p2~0) 4294967296) 4294967296)) .cse3)))))) .cse8 (or (let ((.cse11 (* c_~p1~0 4294967293)) (.cse13 (* (- 3) c_~p1~0))) (and (or (forall ((v_~p1~0_57 Int)) (let ((.cse12 (* v_~p1~0_57 4))) (< (let ((.cse9 (* 2 v_~p1~0_57))) (+ .cse9 (* (div (+ .cse10 4294967295 .cse9 (* (mod (+ .cse11 .cse12) 4294967296) (- 1)) c_~p2~0) 4294967296) 4294967296))) (+ (* (div (+ .cse12 .cse13) 4294967296) 4294967296) c_~p1~0 c_~p2~0 1)))) .cse4) (or .cse5 (forall ((v_~p1~0_57 Int)) (let ((.cse14 (* v_~p1~0_57 4))) (< (+ (* (div (+ .cse14 4294967295 (* (mod (+ .cse11 .cse14) 4294967296) (- 1)) .cse15 c_~p2~0) 4294967296) 4294967296) c_~p1~0) (+ (* (div (+ .cse14 .cse13) 4294967296) 4294967296) c_~p2~0 1))))))) (not (= 4 c_~n1~0))) (or (let ((.cse16 (* 4294967295 c_~p1~0)) (.cse19 (* (- 1) c_~p1~0))) (and (or .cse5 (forall ((v_~p1~0_57 Int)) (let ((.cse17 (* 2 v_~p1~0_57))) (< (+ (* 4294967296 (div (+ (* v_~p1~0_57 4) 4294967295 .cse15 c_~p2~0 (* (- 1) (mod (+ .cse16 .cse17) 4294967296))) 4294967296)) .cse18) (+ (* (div (+ .cse17 .cse19) 4294967296) 4294967296) .cse17 c_~p2~0 1))))) (or .cse4 (forall ((v_~p1~0_57 Int)) (let ((.cse20 (* 2 v_~p1~0_57))) (< (+ (* (div (+ .cse10 4294967295 .cse20 c_~p2~0 (* (- 1) (mod (+ .cse16 .cse20) 4294967296))) 4294967296) 4294967296) c_~p1~0) (+ (* (div (+ .cse20 .cse19) 4294967296) 4294967296) c_~p2~0 1))))))) .cse21) (or (< (+ (* (div (+ .cse22 c_~m~0 4294967295 c_~p2~0) 4294967296) 4294967296) c_~p1~0) (+ c_~m~0 c_~p2~0 .cse23 1)) (not (= c_~n2~0 1))) .cse24 (or (not (= 6 c_~n1~0)) (let ((.cse26 (* 4294967291 c_~p1~0)) (.cse27 (* (- 5) c_~p1~0))) (and (or (forall ((v_~p1~0_57 Int)) (let ((.cse25 (* 6 v_~p1~0_57))) (< (+ (* 2 v_~p1~0_57) (* (div (+ (* (- 1) (mod (+ .cse25 .cse26) 4294967296)) (* v_~p1~0_57 4) 4294967295 .cse15 c_~p2~0) 4294967296) 4294967296)) (+ c_~p1~0 (* (div (+ .cse27 .cse25) 4294967296) 4294967296) c_~p2~0 1)))) .cse5) (or (forall ((v_~p1~0_57 Int)) (let ((.cse28 (* 6 v_~p1~0_57))) (< (+ (* v_~p1~0_57 4) (* (div (+ .cse10 (* (- 1) (mod (+ .cse28 .cse26) 4294967296)) 4294967295 (* 2 v_~p1~0_57) c_~p2~0) 4294967296) 4294967296)) (+ .cse18 (* (div (+ .cse27 .cse28) 4294967296) 4294967296) c_~p2~0 1)))) .cse4)))) (or .cse21 (let ((.cse31 (+ .cse2 c_~p1~0))) (let ((.cse29 (* (- 1) (mod .cse31 4294967296))) (.cse30 (* (div .cse31 4294967296) 4294967296))) (and (or .cse5 (< (+ (* 4294967296 (div (+ 4294967295 .cse6 c_~p2~0 .cse29) 4294967296)) c_~p1~0) (+ .cse30 .cse2 c_~p2~0 1))) (or .cse4 (< (+ (* (div (+ .cse2 4294967295 c_~p2~0 .cse29) 4294967296) 4294967296) c_~p1~0) (+ .cse30 c_~p2~0 1))))))) (or (< (+ c_~p1~0 (* 4294967296 (div (+ .cse22 4294967295 .cse0 c_~p2~0) 4294967296))) (+ .cse0 c_~p2~0 .cse23 1)) (not (= 3 c_~n2~0))) .cse32 .cse33 .cse34 (or (and .cse8 .cse32 .cse34) (= (mod c_thread2Thread1of1ForFork1_~cond~1 256) 0)))))) is different from false [2024-05-30 20:23:03,866 WARN L293 SmtUtils]: Spent 8.98s on a formula simplification. DAG size of input: 60 DAG size of output: 38 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 20:23:09,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 20:24:04,473 WARN L293 SmtUtils]: Spent 32.45s on a formula simplification. DAG size of input: 158 DAG size of output: 152 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 20:25:18,458 WARN L293 SmtUtils]: Spent 50.82s on a formula simplification. DAG size of input: 178 DAG size of output: 173 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 20:26:27,794 WARN L293 SmtUtils]: Spent 39.24s on a formula simplification. DAG size of input: 160 DAG size of output: 157 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 20:26:30,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 20:27:06,144 WARN L293 SmtUtils]: Spent 27.43s on a formula simplification. DAG size of input: 259 DAG size of output: 244 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 20:27:08,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 20:27:37,524 WARN L293 SmtUtils]: Spent 6.82s on a formula simplification. DAG size of input: 119 DAG size of output: 119 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 20:28:07,561 WARN L293 SmtUtils]: Spent 10.76s on a formula simplification. DAG size of input: 220 DAG size of output: 220 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 20:28:12,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 20:28:14,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 20:28:16,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 20:28:33,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 20:28:35,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 20:28:37,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 20:28:39,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-05-30 20:28:40,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-05-30 20:29:11,476 WARN L293 SmtUtils]: Spent 28.61s on a formula simplification. DAG size of input: 145 DAG size of output: 145 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 20:29:29,060 WARN L293 SmtUtils]: Spent 15.22s on a formula simplification. DAG size of input: 141 DAG size of output: 141 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 20:29:31,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 20:29:33,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 20:29:35,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 20:29:37,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 20:29:39,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 20:29:39,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:29:39,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-30 20:29:39,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-30 20:29:39,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-30 20:29:39,851 INFO L78 Accepts]: Start accepts. Automaton has currently 521 states, but on-demand construction may add more states Word has length 126 [2024-05-30 20:29:39,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 20:29:39,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-05-30 20:29:40,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 20:29:40,057 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 20:29:40,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 20:29:40,057 INFO L85 PathProgramCache]: Analyzing trace with hash 2029136051, now seen corresponding path program 4 times [2024-05-30 20:29:40,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 20:29:40,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026232433] [2024-05-30 20:29:40,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 20:29:40,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 20:29:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 20:29:40,813 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-30 20:29:40,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 20:29:40,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026232433] [2024-05-30 20:29:40,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026232433] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 20:29:40,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480924795] [2024-05-30 20:29:40,814 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-30 20:29:40,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 20:29:40,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 20:29:40,815 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-30 20:29:40,817 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-30 20:29:40,916 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-30 20:29:40,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 20:29:40,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 21 conjunts are in the unsatisfiable core [2024-05-30 20:29:40,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 20:29:41,384 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-05-30 20:29:41,385 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 20:29:41,853 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 25 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-05-30 20:29:41,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480924795] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 20:29:41,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 20:29:41,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 38 [2024-05-30 20:29:41,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064912380] [2024-05-30 20:29:41,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 20:29:41,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-05-30 20:29:41,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 20:29:41,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-05-30 20:29:41,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=1124, Unknown=0, NotChecked=0, Total=1406 [2024-05-30 20:29:41,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:29:41,855 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 20:29:41,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 6.7105263157894735) internal successors, (255), 38 states have internal predecessors, (255), 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-30 20:29:41,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:29:41,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-30 20:29:41,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-30 20:29:41,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-05-30 20:29:41,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:29:45,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:29:45,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-30 20:29:45,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-30 20:29:45,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-30 20:29:45,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-05-30 20:29:45,276 INFO L78 Accepts]: Start accepts. Automaton has currently 570 states, but on-demand construction may add more states Word has length 144 [2024-05-30 20:29:45,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 20:29:45,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-05-30 20:29:45,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 20:29:45,492 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 20:29:45,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 20:29:45,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1424845859, now seen corresponding path program 5 times [2024-05-30 20:29:45,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 20:29:45,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106145503] [2024-05-30 20:29:45,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 20:29:45,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 20:29:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 20:29:45,751 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-05-30 20:29:45,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 20:29:45,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106145503] [2024-05-30 20:29:45,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106145503] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 20:29:45,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 20:29:45,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-30 20:29:45,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749929398] [2024-05-30 20:29:45,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 20:29:45,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-30 20:29:45,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 20:29:45,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-30 20:29:45,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-30 20:29:45,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:29:45,754 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 20:29:45,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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-30 20:29:45,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:29:45,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-30 20:29:45,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-30 20:29:45,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-05-30 20:29:45,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-05-30 20:29:45,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:29:47,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 20:29:50,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 20:29:52,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 20:30:45,729 WARN L293 SmtUtils]: Spent 22.52s on a formula simplification. DAG size of input: 246 DAG size of output: 246 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 20:31:13,642 WARN L293 SmtUtils]: Spent 17.48s on a formula simplification. DAG size of input: 242 DAG size of output: 242 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 20:31:15,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 20:31:17,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 20:31:17,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:31:17,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-30 20:31:17,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-30 20:31:17,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-05-30 20:31:17,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-05-30 20:31:17,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 20:31:17,652 INFO L78 Accepts]: Start accepts. Automaton has currently 307 states, but on-demand construction may add more states Word has length 141 [2024-05-30 20:31:17,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 20:31:17,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-30 20:31:17,652 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 20:31:17,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 20:31:17,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1335807606, now seen corresponding path program 1 times [2024-05-30 20:31:17,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 20:31:17,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761225324] [2024-05-30 20:31:17,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 20:31:17,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 20:31:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 20:31:18,866 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 32 proven. 70 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-05-30 20:31:18,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 20:31:18,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761225324] [2024-05-30 20:31:18,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761225324] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 20:31:18,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055726548] [2024-05-30 20:31:18,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 20:31:18,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 20:31:18,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 20:31:18,869 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-30 20:31:18,870 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-30 20:31:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 20:31:18,974 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 42 conjunts are in the unsatisfiable core [2024-05-30 20:31:18,976 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 20:31:20,143 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 37 proven. 65 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-05-30 20:31:20,144 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 20:31:21,583 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 40 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 20:31:21,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055726548] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 20:31:21,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 20:31:21,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22, 29] total 74 [2024-05-30 20:31:21,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973158005] [2024-05-30 20:31:21,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 20:31:21,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2024-05-30 20:31:21,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 20:31:21,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2024-05-30 20:31:21,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=776, Invalid=4626, Unknown=0, NotChecked=0, Total=5402 [2024-05-30 20:31:21,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:31:21,587 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 20:31:21,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 4.121621621621622) internal successors, (305), 74 states have internal predecessors, (305), 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-30 20:31:21,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:31:21,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-30 20:31:21,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-30 20:31:21,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-05-30 20:31:21,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-05-30 20:31:21,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 20:31:21,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:31:25,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:31:25,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-30 20:31:25,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-30 20:31:25,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-05-30 20:31:25,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-05-30 20:31:25,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 20:31:25,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2024-05-30 20:31:25,768 INFO L78 Accepts]: Start accepts. Automaton has currently 352 states, but on-demand construction may add more states Word has length 156 [2024-05-30 20:31:25,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 20:31:25,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-05-30 20:31:25,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 20:31:25,969 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 20:31:25,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 20:31:25,970 INFO L85 PathProgramCache]: Analyzing trace with hash 580281757, now seen corresponding path program 6 times [2024-05-30 20:31:25,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 20:31:25,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016253601] [2024-05-30 20:31:25,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 20:31:25,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 20:31:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 20:31:26,140 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-05-30 20:31:26,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 20:31:26,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016253601] [2024-05-30 20:31:26,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016253601] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 20:31:26,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 20:31:26,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-30 20:31:26,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627399534] [2024-05-30 20:31:26,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 20:31:26,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-30 20:31:26,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 20:31:26,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-30 20:31:26,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-30 20:31:26,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:31:26,142 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 20:31:26,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 20:31:26,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:31:26,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-30 20:31:26,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-30 20:31:26,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-05-30 20:31:26,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-05-30 20:31:26,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 20:31:26,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 101 states. [2024-05-30 20:31:26,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:31:27,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:31:27,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-30 20:31:27,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-30 20:31:27,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-05-30 20:31:27,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-05-30 20:31:27,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 20:31:27,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2024-05-30 20:31:27,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 20:31:27,568 INFO L78 Accepts]: Start accepts. Automaton has currently 347 states, but on-demand construction may add more states Word has length 153 [2024-05-30 20:31:27,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 20:31:27,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-30 20:31:27,569 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 20:31:27,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 20:31:27,569 INFO L85 PathProgramCache]: Analyzing trace with hash 997965454, now seen corresponding path program 7 times [2024-05-30 20:31:27,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 20:31:27,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431951887] [2024-05-30 20:31:27,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 20:31:27,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 20:31:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 20:31:28,956 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 73 proven. 94 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 20:31:28,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 20:31:28,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431951887] [2024-05-30 20:31:28,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431951887] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 20:31:28,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476143964] [2024-05-30 20:31:28,956 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-05-30 20:31:28,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 20:31:28,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 20:31:28,957 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-30 20:31:28,983 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-30 20:31:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 20:31:29,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 29 conjunts are in the unsatisfiable core [2024-05-30 20:31:29,065 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 20:31:30,979 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 38 proven. 128 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-30 20:31:30,979 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 20:31:31,775 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 89 proven. 77 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-30 20:31:31,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476143964] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 20:31:31,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 20:31:31,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24, 25] total 67 [2024-05-30 20:31:31,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923993386] [2024-05-30 20:31:31,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 20:31:31,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2024-05-30 20:31:31,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 20:31:31,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2024-05-30 20:31:31,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=758, Invalid=3664, Unknown=0, NotChecked=0, Total=4422 [2024-05-30 20:31:31,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:31:31,778 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 20:31:31,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 4.865671641791045) internal successors, (326), 67 states have internal predecessors, (326), 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-30 20:31:31,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:31:31,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-30 20:31:31,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-30 20:31:31,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-05-30 20:31:31,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-05-30 20:31:31,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 20:31:31,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 101 states. [2024-05-30 20:31:31,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 20:31:31,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:31:40,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 20:31:45,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:31:45,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-30 20:31:45,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-30 20:31:45,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-05-30 20:31:45,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-05-30 20:31:45,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 20:31:45,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2024-05-30 20:31:45,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 20:31:45,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-05-30 20:31:45,434 INFO L78 Accepts]: Start accepts. Automaton has currently 399 states, but on-demand construction may add more states Word has length 165 [2024-05-30 20:31:45,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 20:31:45,443 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-30 20:31:45,640 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,SelfDestructingSolverStorable8 [2024-05-30 20:31:45,641 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 20:31:45,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 20:31:45,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1224108594, now seen corresponding path program 8 times [2024-05-30 20:31:45,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 20:31:45,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948937791] [2024-05-30 20:31:45,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 20:31:45,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 20:31:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 20:31:50,743 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 15 proven. 259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 20:31:50,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 20:31:50,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948937791] [2024-05-30 20:31:50,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948937791] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 20:31:50,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317052574] [2024-05-30 20:31:50,743 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 20:31:50,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 20:31:50,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 20:31:50,744 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-30 20:31:50,745 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-30 20:31:50,917 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 20:31:50,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 20:31:50,919 INFO L262 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 62 conjunts are in the unsatisfiable core [2024-05-30 20:31:50,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 20:31:55,069 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 274 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 20:31:55,069 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 20:32:19,497 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 274 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 20:32:19,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317052574] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 20:32:19,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 20:32:19,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 43, 41] total 125 [2024-05-30 20:32:19,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312545129] [2024-05-30 20:32:19,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 20:32:19,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 125 states [2024-05-30 20:32:19,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 20:32:19,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2024-05-30 20:32:19,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2282, Invalid=13218, Unknown=0, NotChecked=0, Total=15500 [2024-05-30 20:32:19,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:32:19,502 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 20:32:19,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 125 states, 125 states have (on average 2.96) internal successors, (370), 125 states have internal predecessors, (370), 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-30 20:32:19,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:32:19,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-30 20:32:19,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-30 20:32:19,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-05-30 20:32:19,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-05-30 20:32:19,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 20:32:19,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 101 states. [2024-05-30 20:32:19,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 20:32:19,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-05-30 20:32:19,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:32:33,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 20:32:47,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 20:32:49,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 20:33:00,666 WARN L293 SmtUtils]: Spent 5.79s on a formula simplification. DAG size of input: 159 DAG size of output: 132 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 20:33:02,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 20:33:04,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 20:33:16,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 20:33:21,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 20:33:29,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 20:33:31,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 20:33:33,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 20:33:36,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 20:33:48,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 20:33:50,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 20:34:54,204 WARN L293 SmtUtils]: Spent 54.71s on a formula simplification. DAG size of input: 592 DAG size of output: 292 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 20:34:56,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 20:34:58,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 20:35:00,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 20:35:03,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 20:35:05,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 20:35:07,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-30 20:36:21,993 WARN L293 SmtUtils]: Spent 1.15m on a formula simplification. DAG size of input: 596 DAG size of output: 296 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 20:36:24,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2024-05-30 20:36:29,634 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 20:36:29,642 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 20:36:29,648 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 20:36:30,657 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-30 20:36:30,659 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 [2024-05-30 20:36:30,835 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-05-30 20:36:30,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-30 20:36:30,845 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while executing Executor. [2024-05-30 20:36:30,847 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-30 20:36:30,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2024-05-30 20:36:30,850 INFO L445 BasicCegarLoop]: Path program histogram: [8, 1, 1] [2024-05-30 20:36:30,852 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/5) [2024-05-30 20:36:30,853 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-30 20:36:30,853 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-30 20:36:30,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.05 08:36:30 BasicIcfg [2024-05-30 20:36:30,854 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-30 20:36:30,855 INFO L158 Benchmark]: Toolchain (without parser) took 863659.54ms. Allocated memory was 182.5MB in the beginning and 678.4MB in the end (delta: 496.0MB). Free memory was 108.5MB in the beginning and 349.7MB in the end (delta: -241.2MB). Peak memory consumption was 255.9MB. Max. memory is 8.0GB. [2024-05-30 20:36:30,855 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 150.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-30 20:36:30,855 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.98ms. Allocated memory is still 182.5MB. Free memory was 108.3MB in the beginning and 96.0MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-05-30 20:36:30,855 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.10ms. Allocated memory is still 182.5MB. Free memory was 96.0MB in the beginning and 94.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-30 20:36:30,855 INFO L158 Benchmark]: Boogie Preprocessor took 18.64ms. Allocated memory is still 182.5MB. Free memory was 94.2MB in the beginning and 92.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-30 20:36:30,855 INFO L158 Benchmark]: RCFGBuilder took 417.16ms. Allocated memory was 182.5MB in the beginning and 326.1MB in the end (delta: 143.7MB). Free memory was 92.6MB in the beginning and 283.8MB in the end (delta: -191.3MB). Peak memory consumption was 17.6MB. Max. memory is 8.0GB. [2024-05-30 20:36:30,856 INFO L158 Benchmark]: TraceAbstraction took 862999.89ms. Allocated memory was 326.1MB in the beginning and 678.4MB in the end (delta: 352.3MB). Free memory was 282.8MB in the beginning and 349.7MB in the end (delta: -66.9MB). Peak memory consumption was 285.4MB. Max. memory is 8.0GB. [2024-05-30 20:36:30,856 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.11ms. Allocated memory is still 182.5MB. Free memory is still 150.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 193.98ms. Allocated memory is still 182.5MB. Free memory was 108.3MB in the beginning and 96.0MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.10ms. Allocated memory is still 182.5MB. Free memory was 96.0MB in the beginning and 94.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.64ms. Allocated memory is still 182.5MB. Free memory was 94.2MB in the beginning and 92.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 417.16ms. Allocated memory was 182.5MB in the beginning and 326.1MB in the end (delta: 143.7MB). Free memory was 92.6MB in the beginning and 283.8MB in the end (delta: -191.3MB). Peak memory consumption was 17.6MB. Max. memory is 8.0GB. * TraceAbstraction took 862999.89ms. Allocated memory was 326.1MB in the beginning and 678.4MB in the end (delta: 352.3MB). Free memory was 282.8MB in the beginning and 349.7MB in the end (delta: -66.9MB). Peak memory consumption was 285.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7457, independent: 6721, independent conditional: 6721, independent unconditional: 0, dependent: 733, dependent conditional: 733, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6934, independent: 6721, independent conditional: 6721, independent unconditional: 0, dependent: 210, dependent conditional: 210, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6934, independent: 6721, independent conditional: 6721, independent unconditional: 0, dependent: 210, dependent conditional: 210, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7984, independent: 6721, independent conditional: 31, independent unconditional: 6690, dependent: 1260, dependent conditional: 1016, dependent unconditional: 244, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7984, independent: 6721, independent conditional: 31, independent unconditional: 6690, dependent: 1260, dependent conditional: 388, dependent unconditional: 872, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7984, independent: 6721, independent conditional: 31, independent unconditional: 6690, dependent: 1260, dependent conditional: 388, dependent unconditional: 872, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 325, independent: 249, independent conditional: 14, independent unconditional: 235, dependent: 74, dependent conditional: 66, dependent unconditional: 8, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 325, independent: 235, independent conditional: 0, independent unconditional: 235, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 90, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 74, dependent conditional: 66, dependent unconditional: 8, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 90, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 74, dependent conditional: 66, dependent unconditional: 8, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3885, independent: 116, independent conditional: 116, independent unconditional: 0, dependent: 1752, dependent conditional: 1007, dependent unconditional: 745, unknown: 2018, unknown conditional: 2018, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7984, independent: 6472, independent conditional: 17, independent unconditional: 6455, dependent: 1186, dependent conditional: 322, dependent unconditional: 864, unknown: 326, unknown conditional: 83, unknown unconditional: 243] , Statistics on independence cache: Total cache size (in pairs): 323, Positive cache size: 249, Positive conditional cache size: 14, Positive unconditional cache size: 235, Negative cache size: 74, Negative conditional cache size: 66, Negative unconditional cache size: 8, Unknown cache size: 2, Unknown conditional cache size: 2, Unknown unconditional cache size: 0, Eliminated conditions: 628, Maximal queried relation: 10, Independence queries for same thread: 523 - StatisticsResult: Visitor Statistics States: 234, Transitions: 319, Traversal time: 0.8s - StatisticsResult: Visitor Statistics States: 234, Transitions: 291, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 237, Transitions: 294, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 340, Transitions: 427, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 375, Transitions: 466, Traversal time: 408.5s - StatisticsResult: Visitor Statistics States: 407, Transitions: 483, Traversal time: 3.4s - StatisticsResult: Visitor Statistics States: 146, Transitions: 150, Traversal time: 91.9s - StatisticsResult: Visitor Statistics States: 161, Transitions: 168, Traversal time: 4.2s - StatisticsResult: Visitor Statistics States: 157, Transitions: 163, Traversal time: 1.4s - StatisticsResult: Visitor Statistics States: 169, Transitions: 175, Traversal time: 13.7s - StatisticsResult: Visitor Statistics States: 100, Transitions: 99, Traversal time: 251.3s - TimeoutResultAtElement [Line: 139]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 9 procedures, 159 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 862.9s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 8, EmptinessCheckTime: 775.7s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 377, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 84.0s InterpolantComputationTime, 2309 NumberOfCodeBlocks, 2309 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 3230 ConstructedInterpolants, 66 QuantifiedInterpolants, 57099 SizeOfPredicates, 108 NumberOfNonLiveVariables, 2170 ConjunctsInSsa, 204 ConjunctsInUnsatCore, 24 InterpolantComputations, 3 PerfectInterpolantSequences, 784/2224 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown