/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 11:12:59,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 11:12:59,982 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-21 11:12:59,985 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 11:12:59,986 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 11:13:00,006 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 11:13:00,007 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 11:13:00,007 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 11:13:00,007 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 11:13:00,010 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 11:13:00,010 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 11:13:00,011 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 11:13:00,011 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 11:13:00,012 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 11:13:00,012 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 11:13:00,013 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 11:13:00,013 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 11:13:00,013 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 11:13:00,013 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 11:13:00,013 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 11:13:00,013 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 11:13:00,014 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 11:13:00,014 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 11:13:00,014 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 11:13:00,014 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 11:13:00,014 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 11:13:00,014 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 11:13:00,015 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 11:13:00,015 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 11:13:00,015 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 11:13:00,016 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 11:13:00,016 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 11:13:00,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 11:13:00,016 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 11:13:00,016 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 11:13:00,017 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 11:13:00,017 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 11:13:00,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 11:13:00,017 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 11:13:00,017 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 11:13:00,017 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 11:13:00,017 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 11:13:00,017 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 11:13:00,018 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-21 11:13:00,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 11:13:00,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 11:13:00,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 11:13:00,212 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 11:13:00,212 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 11:13:00,213 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2023-12-21 11:13:01,128 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 11:13:01,309 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 11:13:01,309 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2023-12-21 11:13:01,321 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71b7a14c1/446beffb2ecb4f2ca0c191449a6f28ca/FLAG8ba708259 [2023-12-21 11:13:01,716 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71b7a14c1/446beffb2ecb4f2ca0c191449a6f28ca [2023-12-21 11:13:01,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 11:13:01,719 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 11:13:01,719 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 11:13:01,719 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 11:13:01,723 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 11:13:01,723 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 11:13:01" (1/1) ... [2023-12-21 11:13:01,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8b398ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:13:01, skipping insertion in model container [2023-12-21 11:13:01,724 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 11:13:01" (1/1) ... [2023-12-21 11:13:01,756 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 11:13:01,869 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c[642,655] [2023-12-21 11:13:01,891 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 11:13:01,898 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 11:13:01,905 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c[642,655] [2023-12-21 11:13:01,917 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 11:13:01,926 INFO L206 MainTranslator]: Completed translation [2023-12-21 11:13:01,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:13:01 WrapperNode [2023-12-21 11:13:01,927 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 11:13:01,927 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 11:13:01,927 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 11:13:01,927 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 11:13:01,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:13:01" (1/1) ... [2023-12-21 11:13:01,937 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:13:01" (1/1) ... [2023-12-21 11:13:01,951 INFO L138 Inliner]: procedures = 24, calls = 22, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 204 [2023-12-21 11:13:01,951 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 11:13:01,951 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 11:13:01,952 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 11:13:01,952 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 11:13:01,957 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:13:01" (1/1) ... [2023-12-21 11:13:01,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:13:01" (1/1) ... [2023-12-21 11:13:01,959 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:13:01" (1/1) ... [2023-12-21 11:13:01,973 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-21 11:13:01,973 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:13:01" (1/1) ... [2023-12-21 11:13:01,973 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:13:01" (1/1) ... [2023-12-21 11:13:01,976 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:13:01" (1/1) ... [2023-12-21 11:13:01,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:13:01" (1/1) ... [2023-12-21 11:13:01,980 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:13:01" (1/1) ... [2023-12-21 11:13:01,981 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:13:01" (1/1) ... [2023-12-21 11:13:01,982 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 11:13:01,983 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 11:13:01,983 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 11:13:01,983 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 11:13:01,983 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:13:01" (1/1) ... [2023-12-21 11:13:01,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 11:13:01,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:13:02,013 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 11:13:02,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 11:13:02,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 11:13:02,033 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-12-21 11:13:02,033 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-12-21 11:13:02,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 11:13:02,033 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-12-21 11:13:02,033 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-12-21 11:13:02,035 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2023-12-21 11:13:02,035 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2023-12-21 11:13:02,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 11:13:02,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 11:13:02,109 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 11:13:02,110 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 11:13:02,283 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 11:13:02,312 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 11:13:02,312 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-21 11:13:02,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 11:13:02 BoogieIcfgContainer [2023-12-21 11:13:02,312 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 11:13:02,314 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 11:13:02,314 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 11:13:02,316 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 11:13:02,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 11:13:01" (1/3) ... [2023-12-21 11:13:02,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb2b3ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 11:13:02, skipping insertion in model container [2023-12-21 11:13:02,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:13:01" (2/3) ... [2023-12-21 11:13:02,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb2b3ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 11:13:02, skipping insertion in model container [2023-12-21 11:13:02,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 11:13:02" (3/3) ... [2023-12-21 11:13:02,324 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2023-12-21 11:13:02,335 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 11:13:02,336 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 11:13:02,365 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 11:13:02,368 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@14d12fcd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 11:13:02,369 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 11:13:02,371 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 55 states have internal predecessors, (86), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-21 11:13:02,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-21 11:13:02,377 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:13:02,377 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:13:02,377 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:13:02,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:13:02,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1465784770, now seen corresponding path program 1 times [2023-12-21 11:13:02,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:13:02,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160721405] [2023-12-21 11:13:02,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:13:02,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:13:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:02,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:13:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:02,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-21 11:13:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:02,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:13:02,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:13:02,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160721405] [2023-12-21 11:13:02,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160721405] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:13:02,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:13:02,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:13:02,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785785272] [2023-12-21 11:13:02,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:13:02,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:13:02,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:13:02,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:13:02,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:13:02,580 INFO L87 Difference]: Start difference. First operand has 63 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 55 states have internal predecessors, (86), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 11:13:02,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:13:02,718 INFO L93 Difference]: Finished difference Result 186 states and 297 transitions. [2023-12-21 11:13:02,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:13:02,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2023-12-21 11:13:02,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:13:02,728 INFO L225 Difference]: With dead ends: 186 [2023-12-21 11:13:02,728 INFO L226 Difference]: Without dead ends: 123 [2023-12-21 11:13:02,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:13:02,734 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 91 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:13:02,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 213 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:13:02,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-12-21 11:13:02,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117. [2023-12-21 11:13:02,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 103 states have internal predecessors, (145), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2023-12-21 11:13:02,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 169 transitions. [2023-12-21 11:13:02,767 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 169 transitions. Word has length 36 [2023-12-21 11:13:02,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:13:02,768 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 169 transitions. [2023-12-21 11:13:02,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 11:13:02,768 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 169 transitions. [2023-12-21 11:13:02,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-21 11:13:02,770 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:13:02,770 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:13:02,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 11:13:02,770 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:13:02,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:13:02,771 INFO L85 PathProgramCache]: Analyzing trace with hash 76557616, now seen corresponding path program 1 times [2023-12-21 11:13:02,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:13:02,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216211237] [2023-12-21 11:13:02,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:13:02,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:13:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:02,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:13:02,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:02,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:13:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:02,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:13:02,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:13:02,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216211237] [2023-12-21 11:13:02,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216211237] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:13:02,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:13:02,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:13:02,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176201318] [2023-12-21 11:13:02,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:13:02,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:13:02,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:13:02,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:13:02,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:13:02,890 INFO L87 Difference]: Start difference. First operand 117 states and 169 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 11:13:02,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:13:02,977 INFO L93 Difference]: Finished difference Result 351 states and 513 transitions. [2023-12-21 11:13:02,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:13:02,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2023-12-21 11:13:02,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:13:02,980 INFO L225 Difference]: With dead ends: 351 [2023-12-21 11:13:02,980 INFO L226 Difference]: Without dead ends: 240 [2023-12-21 11:13:02,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:13:02,981 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 108 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:13:02,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 189 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:13:02,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2023-12-21 11:13:03,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 217. [2023-12-21 11:13:03,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 188 states have (on average 1.398936170212766) internal successors, (263), 191 states have internal predecessors, (263), 18 states have call successors, (18), 9 states have call predecessors, (18), 10 states have return successors, (28), 16 states have call predecessors, (28), 16 states have call successors, (28) [2023-12-21 11:13:03,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 309 transitions. [2023-12-21 11:13:03,012 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 309 transitions. Word has length 37 [2023-12-21 11:13:03,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:13:03,012 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 309 transitions. [2023-12-21 11:13:03,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 11:13:03,012 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 309 transitions. [2023-12-21 11:13:03,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-21 11:13:03,014 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:13:03,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:13:03,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 11:13:03,014 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:13:03,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:13:03,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1856672701, now seen corresponding path program 1 times [2023-12-21 11:13:03,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:13:03,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419351346] [2023-12-21 11:13:03,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:13:03,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:13:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:03,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:13:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:03,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-21 11:13:03,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:03,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:13:03,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:13:03,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419351346] [2023-12-21 11:13:03,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419351346] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:13:03,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:13:03,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:13:03,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75468192] [2023-12-21 11:13:03,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:13:03,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:13:03,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:13:03,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:13:03,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:13:03,101 INFO L87 Difference]: Start difference. First operand 217 states and 309 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 11:13:03,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:13:03,196 INFO L93 Difference]: Finished difference Result 637 states and 890 transitions. [2023-12-21 11:13:03,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:13:03,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2023-12-21 11:13:03,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:13:03,202 INFO L225 Difference]: With dead ends: 637 [2023-12-21 11:13:03,202 INFO L226 Difference]: Without dead ends: 426 [2023-12-21 11:13:03,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:13:03,208 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 91 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:13:03,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 225 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:13:03,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2023-12-21 11:13:03,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 322. [2023-12-21 11:13:03,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 281 states have (on average 1.395017793594306) internal successors, (392), 286 states have internal predecessors, (392), 24 states have call successors, (24), 15 states have call predecessors, (24), 16 states have return successors, (34), 20 states have call predecessors, (34), 22 states have call successors, (34) [2023-12-21 11:13:03,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 450 transitions. [2023-12-21 11:13:03,248 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 450 transitions. Word has length 38 [2023-12-21 11:13:03,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:13:03,249 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 450 transitions. [2023-12-21 11:13:03,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 11:13:03,249 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 450 transitions. [2023-12-21 11:13:03,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-21 11:13:03,251 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:13:03,251 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:13:03,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 11:13:03,251 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:13:03,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:13:03,252 INFO L85 PathProgramCache]: Analyzing trace with hash -2006311882, now seen corresponding path program 1 times [2023-12-21 11:13:03,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:13:03,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921574997] [2023-12-21 11:13:03,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:13:03,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:13:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:03,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:13:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:03,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-21 11:13:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:03,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-21 11:13:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:03,311 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 11:13:03,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:13:03,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921574997] [2023-12-21 11:13:03,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921574997] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:13:03,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:13:03,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:13:03,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673544380] [2023-12-21 11:13:03,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:13:03,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:13:03,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:13:03,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:13:03,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:13:03,313 INFO L87 Difference]: Start difference. First operand 322 states and 450 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 11:13:03,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:13:03,404 INFO L93 Difference]: Finished difference Result 838 states and 1167 transitions. [2023-12-21 11:13:03,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:13:03,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 53 [2023-12-21 11:13:03,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:13:03,406 INFO L225 Difference]: With dead ends: 838 [2023-12-21 11:13:03,407 INFO L226 Difference]: Without dead ends: 522 [2023-12-21 11:13:03,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:13:03,415 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 76 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:13:03,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 272 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:13:03,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2023-12-21 11:13:03,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 488. [2023-12-21 11:13:03,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 423 states have (on average 1.342789598108747) internal successors, (568), 430 states have internal predecessors, (568), 38 states have call successors, (38), 23 states have call predecessors, (38), 26 states have return successors, (58), 34 states have call predecessors, (58), 36 states have call successors, (58) [2023-12-21 11:13:03,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 664 transitions. [2023-12-21 11:13:03,452 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 664 transitions. Word has length 53 [2023-12-21 11:13:03,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:13:03,453 INFO L495 AbstractCegarLoop]: Abstraction has 488 states and 664 transitions. [2023-12-21 11:13:03,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 11:13:03,453 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 664 transitions. [2023-12-21 11:13:03,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-21 11:13:03,458 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:13:03,458 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:13:03,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 11:13:03,458 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:13:03,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:13:03,459 INFO L85 PathProgramCache]: Analyzing trace with hash -6908331, now seen corresponding path program 1 times [2023-12-21 11:13:03,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:13:03,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469981060] [2023-12-21 11:13:03,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:13:03,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:13:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:03,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:13:03,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:03,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-21 11:13:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:03,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 11:13:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:03,535 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-21 11:13:03,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:13:03,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469981060] [2023-12-21 11:13:03,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469981060] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:13:03,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:13:03,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:13:03,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560899958] [2023-12-21 11:13:03,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:13:03,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:13:03,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:13:03,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:13:03,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:13:03,538 INFO L87 Difference]: Start difference. First operand 488 states and 664 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-21 11:13:03,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:13:03,624 INFO L93 Difference]: Finished difference Result 1067 states and 1443 transitions. [2023-12-21 11:13:03,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:13:03,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 58 [2023-12-21 11:13:03,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:13:03,628 INFO L225 Difference]: With dead ends: 1067 [2023-12-21 11:13:03,629 INFO L226 Difference]: Without dead ends: 665 [2023-12-21 11:13:03,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:13:03,631 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 94 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:13:03,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 201 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:13:03,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2023-12-21 11:13:03,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 616. [2023-12-21 11:13:03,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 535 states have (on average 1.314018691588785) internal successors, (703), 544 states have internal predecessors, (703), 46 states have call successors, (46), 29 states have call predecessors, (46), 34 states have return successors, (72), 42 states have call predecessors, (72), 44 states have call successors, (72) [2023-12-21 11:13:03,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 821 transitions. [2023-12-21 11:13:03,683 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 821 transitions. Word has length 58 [2023-12-21 11:13:03,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:13:03,683 INFO L495 AbstractCegarLoop]: Abstraction has 616 states and 821 transitions. [2023-12-21 11:13:03,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-21 11:13:03,684 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 821 transitions. [2023-12-21 11:13:03,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-21 11:13:03,685 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:13:03,685 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:13:03,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 11:13:03,686 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:13:03,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:13:03,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1580994309, now seen corresponding path program 1 times [2023-12-21 11:13:03,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:13:03,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746448638] [2023-12-21 11:13:03,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:13:03,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:13:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:03,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:13:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:03,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-21 11:13:03,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:03,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:13:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:03,796 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 11:13:03,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:13:03,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746448638] [2023-12-21 11:13:03,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746448638] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:13:03,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985445652] [2023-12-21 11:13:03,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:13:03,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:13:03,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:13:03,802 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 11:13:03,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-21 11:13:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:03,873 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-21 11:13:03,876 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:13:03,937 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:13:03,937 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 11:13:03,964 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-21 11:13:03,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985445652] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 11:13:03,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-21 11:13:03,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 7 [2023-12-21 11:13:03,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120343133] [2023-12-21 11:13:03,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:13:03,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:13:03,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:13:03,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:13:03,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:13:03,965 INFO L87 Difference]: Start difference. First operand 616 states and 821 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 11:13:04,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:13:04,014 INFO L93 Difference]: Finished difference Result 666 states and 883 transitions. [2023-12-21 11:13:04,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 11:13:04,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 59 [2023-12-21 11:13:04,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:13:04,016 INFO L225 Difference]: With dead ends: 666 [2023-12-21 11:13:04,016 INFO L226 Difference]: Without dead ends: 663 [2023-12-21 11:13:04,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-21 11:13:04,017 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 156 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:13:04,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 151 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:13:04,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2023-12-21 11:13:04,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 615. [2023-12-21 11:13:04,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 535 states have (on average 1.3102803738317756) internal successors, (701), 543 states have internal predecessors, (701), 45 states have call successors, (45), 29 states have call predecessors, (45), 34 states have return successors, (72), 42 states have call predecessors, (72), 44 states have call successors, (72) [2023-12-21 11:13:04,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 818 transitions. [2023-12-21 11:13:04,043 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 818 transitions. Word has length 59 [2023-12-21 11:13:04,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:13:04,043 INFO L495 AbstractCegarLoop]: Abstraction has 615 states and 818 transitions. [2023-12-21 11:13:04,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 11:13:04,043 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 818 transitions. [2023-12-21 11:13:04,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-21 11:13:04,044 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:13:04,045 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:13:04,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-21 11:13:04,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-21 11:13:04,250 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:13:04,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:13:04,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1765859992, now seen corresponding path program 1 times [2023-12-21 11:13:04,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:13:04,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035358151] [2023-12-21 11:13:04,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:13:04,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:13:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:04,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:13:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:04,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-21 11:13:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:04,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:13:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:04,299 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 11:13:04,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:13:04,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035358151] [2023-12-21 11:13:04,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035358151] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:13:04,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13623643] [2023-12-21 11:13:04,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:13:04,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:13:04,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:13:04,301 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 11:13:04,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-21 11:13:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:04,360 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-21 11:13:04,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:13:04,573 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:13:04,573 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 11:13:04,631 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-21 11:13:04,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13623643] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 11:13:04,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 11:13:04,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2023-12-21 11:13:04,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035363027] [2023-12-21 11:13:04,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 11:13:04,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 11:13:04,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:13:04,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 11:13:04,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-21 11:13:04,633 INFO L87 Difference]: Start difference. First operand 615 states and 818 transitions. Second operand has 10 states, 10 states have (on average 13.3) internal successors, (133), 9 states have internal predecessors, (133), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-12-21 11:13:05,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:13:05,037 INFO L93 Difference]: Finished difference Result 1960 states and 2646 transitions. [2023-12-21 11:13:05,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-21 11:13:05,038 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.3) internal successors, (133), 9 states have internal predecessors, (133), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 60 [2023-12-21 11:13:05,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:13:05,043 INFO L225 Difference]: With dead ends: 1960 [2023-12-21 11:13:05,043 INFO L226 Difference]: Without dead ends: 1478 [2023-12-21 11:13:05,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2023-12-21 11:13:05,045 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 333 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 11:13:05,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 968 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 11:13:05,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2023-12-21 11:13:05,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 951. [2023-12-21 11:13:05,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 832 states have (on average 1.3004807692307692) internal successors, (1082), 848 states have internal predecessors, (1082), 65 states have call successors, (65), 43 states have call predecessors, (65), 53 states have return successors, (106), 59 states have call predecessors, (106), 64 states have call successors, (106) [2023-12-21 11:13:05,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1253 transitions. [2023-12-21 11:13:05,095 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1253 transitions. Word has length 60 [2023-12-21 11:13:05,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:13:05,095 INFO L495 AbstractCegarLoop]: Abstraction has 951 states and 1253 transitions. [2023-12-21 11:13:05,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.3) internal successors, (133), 9 states have internal predecessors, (133), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-12-21 11:13:05,095 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1253 transitions. [2023-12-21 11:13:05,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-21 11:13:05,097 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:13:05,097 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:13:05,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-21 11:13:05,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-21 11:13:05,303 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:13:05,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:13:05,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1463774967, now seen corresponding path program 1 times [2023-12-21 11:13:05,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:13:05,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63581266] [2023-12-21 11:13:05,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:13:05,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:13:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:05,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:13:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:05,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-21 11:13:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:05,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-21 11:13:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:05,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 11:13:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:05,383 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-21 11:13:05,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:13:05,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63581266] [2023-12-21 11:13:05,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63581266] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:13:05,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357658946] [2023-12-21 11:13:05,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:13:05,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:13:05,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:13:05,385 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 11:13:05,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-21 11:13:05,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:05,491 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 11:13:05,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:13:05,517 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-21 11:13:05,517 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:13:05,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357658946] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:13:05,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:13:05,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-21 11:13:05,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67479437] [2023-12-21 11:13:05,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:13:05,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:13:05,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:13:05,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:13:05,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:13:05,519 INFO L87 Difference]: Start difference. First operand 951 states and 1253 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-21 11:13:05,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:13:05,590 INFO L93 Difference]: Finished difference Result 1583 states and 2100 transitions. [2023-12-21 11:13:05,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:13:05,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 77 [2023-12-21 11:13:05,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:13:05,594 INFO L225 Difference]: With dead ends: 1583 [2023-12-21 11:13:05,594 INFO L226 Difference]: Without dead ends: 843 [2023-12-21 11:13:05,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:13:05,596 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 49 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:13:05,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 168 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:13:05,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2023-12-21 11:13:05,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 828. [2023-12-21 11:13:05,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 725 states have (on average 1.293793103448276) internal successors, (938), 740 states have internal predecessors, (938), 57 states have call successors, (57), 37 states have call predecessors, (57), 45 states have return successors, (92), 50 states have call predecessors, (92), 56 states have call successors, (92) [2023-12-21 11:13:05,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1087 transitions. [2023-12-21 11:13:05,637 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1087 transitions. Word has length 77 [2023-12-21 11:13:05,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:13:05,637 INFO L495 AbstractCegarLoop]: Abstraction has 828 states and 1087 transitions. [2023-12-21 11:13:05,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-21 11:13:05,637 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1087 transitions. [2023-12-21 11:13:05,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-21 11:13:05,638 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:13:05,639 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:13:05,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-21 11:13:05,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:13:05,844 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:13:05,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:13:05,845 INFO L85 PathProgramCache]: Analyzing trace with hash 4825838, now seen corresponding path program 1 times [2023-12-21 11:13:05,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:13:05,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510901361] [2023-12-21 11:13:05,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:13:05,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:13:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:05,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:13:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:05,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-21 11:13:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:05,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 11:13:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:05,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 11:13:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:05,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-21 11:13:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:05,898 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-12-21 11:13:05,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:13:05,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510901361] [2023-12-21 11:13:05,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510901361] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:13:05,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886302685] [2023-12-21 11:13:05,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:13:05,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:13:05,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:13:05,900 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 11:13:05,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-21 11:13:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:05,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 11:13:05,964 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:13:05,987 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-21 11:13:05,987 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:13:05,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886302685] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:13:05,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:13:05,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-21 11:13:05,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358850845] [2023-12-21 11:13:05,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:13:05,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:13:05,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:13:05,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:13:05,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:13:05,989 INFO L87 Difference]: Start difference. First operand 828 states and 1087 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-21 11:13:06,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:13:06,029 INFO L93 Difference]: Finished difference Result 1162 states and 1510 transitions. [2023-12-21 11:13:06,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:13:06,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 91 [2023-12-21 11:13:06,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:13:06,030 INFO L225 Difference]: With dead ends: 1162 [2023-12-21 11:13:06,030 INFO L226 Difference]: Without dead ends: 0 [2023-12-21 11:13:06,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:13:06,034 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 56 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:13:06,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 169 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:13:06,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-21 11:13:06,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-21 11:13:06,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:13:06,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-21 11:13:06,035 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 91 [2023-12-21 11:13:06,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:13:06,035 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-21 11:13:06,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-21 11:13:06,035 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-21 11:13:06,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-21 11:13:06,039 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 11:13:06,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-21 11:13:06,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:13:06,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-21 11:13:07,309 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 67) no Hoare annotation was computed. [2023-12-21 11:13:07,310 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 51) no Hoare annotation was computed. [2023-12-21 11:13:07,310 INFO L899 garLoopResultBuilder]: For program point immediate_notify_threadsEXIT(lines 76 100) no Hoare annotation was computed. [2023-12-21 11:13:07,310 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 76 100) the Hoare annotation is: (let ((.cse3 (= |old(~p_dw_st~0)| ~p_dw_st~0))) (let ((.cse0 (and .cse3 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse1 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse2 (not (= ~q_free~0 0)))) (and (or (not (= ~p_num_write~0 1)) (not (= ~c_dr_pc~0 0)) .cse0 (not (= ~p_dw_pc~0 0)) .cse1 (not (= ~c_num_read~0 0)) .cse2) (or .cse0 .cse1 (not (= ~c_num_read~0 ~p_num_write~0)) (not (= ~q_free~0 1)) (not (= ~c_last_read~0 ~p_last_write~0)) (< |old(~p_dw_st~0)| 2)) (or (not (= 2 |old(~c_dr_st~0)|)) .cse1 .cse2 (and .cse3 (= ~c_dr_st~0 2)) (not (= (+ ~c_num_read~0 1) ~p_num_write~0)))))) [2023-12-21 11:13:07,310 INFO L899 garLoopResultBuilder]: For program point L42-2(lines 42 51) no Hoare annotation was computed. [2023-12-21 11:13:07,310 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 70) no Hoare annotation was computed. [2023-12-21 11:13:07,311 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 96) no Hoare annotation was computed. [2023-12-21 11:13:07,311 INFO L899 garLoopResultBuilder]: For program point L61-2(lines 61 70) no Hoare annotation was computed. [2023-12-21 11:13:07,311 INFO L899 garLoopResultBuilder]: For program point L92-2(lines 76 100) no Hoare annotation was computed. [2023-12-21 11:13:07,311 INFO L899 garLoopResultBuilder]: For program point L53(lines 41 55) no Hoare annotation was computed. [2023-12-21 11:13:07,311 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 88) no Hoare annotation was computed. [2023-12-21 11:13:07,311 INFO L899 garLoopResultBuilder]: For program point L84-2(lines 84 88) no Hoare annotation was computed. [2023-12-21 11:13:07,311 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 48) no Hoare annotation was computed. [2023-12-21 11:13:07,311 INFO L899 garLoopResultBuilder]: For program point L72(lines 60 74) no Hoare annotation was computed. [2023-12-21 11:13:07,311 INFO L899 garLoopResultBuilder]: For program point L224(lines 224 234) no Hoare annotation was computed. [2023-12-21 11:13:07,311 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 220 239) no Hoare annotation was computed. [2023-12-21 11:13:07,311 INFO L899 garLoopResultBuilder]: For program point L236(lines 223 238) no Hoare annotation was computed. [2023-12-21 11:13:07,311 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 220 239) the Hoare annotation is: true [2023-12-21 11:13:07,311 INFO L899 garLoopResultBuilder]: For program point L228(lines 228 233) no Hoare annotation was computed. [2023-12-21 11:13:07,312 INFO L895 garLoopResultBuilder]: At program point L192(line 192) the Hoare annotation is: false [2023-12-21 11:13:07,312 INFO L895 garLoopResultBuilder]: At program point L192-1(lines 160 195) the Hoare annotation is: (let ((.cse2 (= ~c_num_read~0 ~p_num_write~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~q_free~0 1)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse1 (<= 2 ~p_dw_st~0))) (or (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) (= ~q_free~0 0) .cse1) (and .cse2 .cse0 .cse3 (= ~p_dw_st~0 0) .cse4) (and .cse2 .cse0 .cse3 .cse4 .cse1))) [2023-12-21 11:13:07,312 INFO L899 garLoopResultBuilder]: For program point L250(line 250) no Hoare annotation was computed. [2023-12-21 11:13:07,312 INFO L899 garLoopResultBuilder]: For program point L118(lines 117 137) no Hoare annotation was computed. [2023-12-21 11:13:07,312 INFO L895 garLoopResultBuilder]: At program point L300(line 300) the Hoare annotation is: (let ((.cse3 (= ~c_num_read~0 ~p_num_write~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse4 (= ~c_dr_st~0 2)) (.cse1 (= ~q_free~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse8 (= ~p_num_write~0 0)) (.cse9 (= ~c_num_read~0 0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~q_free~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse2 (<= 2 ~p_dw_st~0))) (or (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5 .cse6) (and .cse3 .cse4 .cse0 .cse5 .cse2) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse6 .cse10 .cse11) (and .cse4 .cse0 .cse1 .cse2) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse10 .cse11 .cse2))) [2023-12-21 11:13:07,312 INFO L899 garLoopResultBuilder]: For program point L300-1(line 300) no Hoare annotation was computed. [2023-12-21 11:13:07,312 INFO L899 garLoopResultBuilder]: For program point do_write_p_returnLabel#1(lines 101 143) no Hoare annotation was computed. [2023-12-21 11:13:07,312 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 156) no Hoare annotation was computed. [2023-12-21 11:13:07,313 INFO L899 garLoopResultBuilder]: For program point L119(lines 119 127) no Hoare annotation was computed. [2023-12-21 11:13:07,313 INFO L899 garLoopResultBuilder]: For program point start_simulation_returnLabel#1(lines 313 341) no Hoare annotation was computed. [2023-12-21 11:13:07,313 INFO L899 garLoopResultBuilder]: For program point L309(lines 298 311) no Hoare annotation was computed. [2023-12-21 11:13:07,313 INFO L899 garLoopResultBuilder]: For program point L276(lines 276 283) no Hoare annotation was computed. [2023-12-21 11:13:07,313 INFO L899 garLoopResultBuilder]: For program point L161(lines 160 195) no Hoare annotation was computed. [2023-12-21 11:13:07,313 INFO L899 garLoopResultBuilder]: For program point do_read_c_returnLabel#1(lines 145 201) no Hoare annotation was computed. [2023-12-21 11:13:07,313 INFO L899 garLoopResultBuilder]: For program point L252(lines 252 256) no Hoare annotation was computed. [2023-12-21 11:13:07,313 INFO L899 garLoopResultBuilder]: For program point L252-1(lines 247 287) no Hoare annotation was computed. [2023-12-21 11:13:07,313 INFO L899 garLoopResultBuilder]: For program point L211-1(lines 202 219) no Hoare annotation was computed. [2023-12-21 11:13:07,313 INFO L899 garLoopResultBuilder]: For program point L302(lines 302 307) no Hoare annotation was computed. [2023-12-21 11:13:07,313 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-21 11:13:07,313 INFO L899 garLoopResultBuilder]: For program point L261(lines 261 268) no Hoare annotation was computed. [2023-12-21 11:13:07,313 INFO L899 garLoopResultBuilder]: For program point L162-1(lines 162 172) no Hoare annotation was computed. [2023-12-21 11:13:07,314 INFO L895 garLoopResultBuilder]: At program point L187(line 187) the Hoare annotation is: false [2023-12-21 11:13:07,314 INFO L895 garLoopResultBuilder]: At program point L179(line 179) the Hoare annotation is: (and (= ~c_num_read~0 ~p_num_write~0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= 2 ~p_dw_st~0)) [2023-12-21 11:13:07,314 INFO L899 garLoopResultBuilder]: For program point L179-1(line 179) no Hoare annotation was computed. [2023-12-21 11:13:07,314 INFO L899 garLoopResultBuilder]: For program point eval_returnLabel#1(lines 240 293) no Hoare annotation was computed. [2023-12-21 11:13:07,314 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 114) no Hoare annotation was computed. [2023-12-21 11:13:07,314 INFO L895 garLoopResultBuilder]: At program point L272(lines 247 287) the Hoare annotation is: (let ((.cse3 (= ~c_num_read~0 ~p_num_write~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse4 (= ~c_dr_st~0 2)) (.cse1 (= ~q_free~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse8 (= ~p_num_write~0 0)) (.cse9 (= ~c_num_read~0 0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~q_free~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse2 (<= 2 ~p_dw_st~0))) (or (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5 .cse6) (and .cse3 .cse4 .cse0 .cse5 .cse2) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse6 .cse10 .cse11) (and .cse4 .cse0 .cse1 .cse2) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse10 .cse11 .cse2))) [2023-12-21 11:13:07,314 INFO L899 garLoopResultBuilder]: For program point L206(lines 206 210) no Hoare annotation was computed. [2023-12-21 11:13:07,314 INFO L899 garLoopResultBuilder]: For program point L206-2(lines 205 218) no Hoare annotation was computed. [2023-12-21 11:13:07,314 INFO L899 garLoopResultBuilder]: For program point L330(lines 330 334) no Hoare annotation was computed. [2023-12-21 11:13:07,314 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-21 11:13:07,315 INFO L895 garLoopResultBuilder]: At program point L248(line 248) the Hoare annotation is: (let ((.cse3 (= ~c_num_read~0 ~p_num_write~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse4 (= ~c_dr_st~0 2)) (.cse1 (= ~q_free~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse8 (= ~p_num_write~0 0)) (.cse9 (= ~c_num_read~0 0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~q_free~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse2 (<= 2 ~p_dw_st~0))) (or (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5 .cse6) (and .cse3 .cse4 .cse0 .cse5 .cse2) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse6 .cse10 .cse11) (and .cse4 .cse0 .cse1 .cse2) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse10 .cse11 .cse2))) [2023-12-21 11:13:07,315 INFO L899 garLoopResultBuilder]: For program point L182(lines 182 194) no Hoare annotation was computed. [2023-12-21 11:13:07,315 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 157) no Hoare annotation was computed. [2023-12-21 11:13:07,315 INFO L899 garLoopResultBuilder]: For program point L257(lines 247 287) no Hoare annotation was computed. [2023-12-21 11:13:07,315 INFO L895 garLoopResultBuilder]: At program point L323-2(lines 323 335) the Hoare annotation is: (let ((.cse3 (= ~c_num_read~0 ~p_num_write~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse4 (= ~c_dr_st~0 2)) (.cse1 (= ~q_free~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse8 (= ~p_num_write~0 0)) (.cse9 (= ~c_num_read~0 0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~q_free~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse2 (<= 2 ~p_dw_st~0))) (or (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5 .cse6) (and .cse3 .cse4 .cse0 .cse5 .cse2) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse6 .cse10 .cse11) (and .cse4 .cse0 .cse1 .cse2) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse10 .cse11 .cse2))) [2023-12-21 11:13:07,315 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 189) no Hoare annotation was computed. [2023-12-21 11:13:07,315 INFO L895 garLoopResultBuilder]: At program point L117-1(lines 117 137) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 2)) (.cse2 (= ~q_free~0 1)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~q_free~0 0))) (or (and (= ~c_num_read~0 ~p_num_write~0) .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse3) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse1 .cse2 (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) (and .cse1 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3))) [2023-12-21 11:13:07,315 INFO L899 garLoopResultBuilder]: For program point L109(lines 109 113) no Hoare annotation was computed. [2023-12-21 11:13:07,316 INFO L895 garLoopResultBuilder]: At program point L134(line 134) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~q_free~0 0))) (or (and (= ~c_dr_st~0 2) .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1) (and (= ~p_dw_pc~0 0) (= ~c_num_read~0 0) .cse0 .cse1 (= ~c_dr_pc~0 0) (= ~p_num_write~0 1)))) [2023-12-21 11:13:07,316 INFO L899 garLoopResultBuilder]: For program point L134-1(line 134) no Hoare annotation was computed. [2023-12-21 11:13:07,316 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 15 22) no Hoare annotation was computed. [2023-12-21 11:13:07,316 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 15 22) the Hoare annotation is: true [2023-12-21 11:13:07,316 INFO L899 garLoopResultBuilder]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-21 11:13:07,318 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:13:07,320 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 11:13:07,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 11:13:07 BoogieIcfgContainer [2023-12-21 11:13:07,333 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 11:13:07,334 INFO L158 Benchmark]: Toolchain (without parser) took 5615.01ms. Allocated memory was 249.6MB in the beginning and 299.9MB in the end (delta: 50.3MB). Free memory was 209.0MB in the beginning and 172.3MB in the end (delta: 36.8MB). Peak memory consumption was 169.4MB. Max. memory is 8.0GB. [2023-12-21 11:13:07,334 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 198.2MB. Free memory is still 146.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 11:13:07,334 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.42ms. Allocated memory is still 249.6MB. Free memory was 209.0MB in the beginning and 196.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-21 11:13:07,334 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.94ms. Allocated memory is still 249.6MB. Free memory was 195.9MB in the beginning and 194.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-21 11:13:07,335 INFO L158 Benchmark]: Boogie Preprocessor took 30.64ms. Allocated memory is still 249.6MB. Free memory was 194.4MB in the beginning and 192.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 11:13:07,335 INFO L158 Benchmark]: RCFGBuilder took 329.76ms. Allocated memory is still 249.6MB. Free memory was 192.3MB in the beginning and 173.9MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-21 11:13:07,335 INFO L158 Benchmark]: TraceAbstraction took 5019.54ms. Allocated memory was 249.6MB in the beginning and 299.9MB in the end (delta: 50.3MB). Free memory was 173.4MB in the beginning and 172.3MB in the end (delta: 1.1MB). Peak memory consumption was 133.8MB. Max. memory is 8.0GB. [2023-12-21 11:13:07,336 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.08ms. Allocated memory is still 198.2MB. Free memory is still 146.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 207.42ms. Allocated memory is still 249.6MB. Free memory was 209.0MB in the beginning and 196.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.94ms. Allocated memory is still 249.6MB. Free memory was 195.9MB in the beginning and 194.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.64ms. Allocated memory is still 249.6MB. Free memory was 194.4MB in the beginning and 192.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 329.76ms. Allocated memory is still 249.6MB. Free memory was 192.3MB in the beginning and 173.9MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 5019.54ms. Allocated memory was 249.6MB in the beginning and 299.9MB in the end (delta: 50.3MB). Free memory was 173.4MB in the beginning and 172.3MB in the end (delta: 1.1MB). Peak memory consumption was 133.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1066 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1054 mSDsluCounter, 2556 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1577 mSDsCounter, 98 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 805 IncrementalHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 98 mSolverCounterUnsat, 979 mSDtfsCounter, 805 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 528 GetRequests, 472 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=951occurred in iteration=7, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 806 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 260 PreInvPairs, 328 NumberOfFragments, 691 HoareAnnotationTreeSize, 260 FormulaSimplifications, 379 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FormulaSimplificationsInter, 3187 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 796 NumberOfCodeBlocks, 796 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 900 ConstructedInterpolants, 0 QuantifiedInterpolants, 1696 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1015 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 15 InterpolantComputations, 8 PerfectInterpolantSequences, 241/301 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 323]: Loop Invariant Derived loop invariant: (((((((((p_last_write == q_buf_0) && ((c_num_read + 1) == p_num_write)) && (q_free == 0)) && (2 <= p_dw_st)) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0))) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((c_dr_st == 2) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= p_dw_st))) - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: (((((((((p_last_write == q_buf_0) && ((c_num_read + 1) == p_num_write)) && (q_free == 0)) && (2 <= p_dw_st)) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0))) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((c_dr_st == 2) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= p_dw_st))) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) || (((c_dr_st == 2) && (p_last_write == q_buf_0)) && (q_free == 0))) || (((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((p_last_write == q_buf_0) && ((c_num_read + 1) == p_num_write)) && (q_free == 0))) - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: ((((((p_last_write == q_buf_0) && ((c_num_read + 1) == p_num_write)) && (q_free == 0)) && (2 <= p_dw_st)) || (((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || (((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_last_read == p_last_write)) && (2 <= p_dw_st))) RESULT: Ultimate proved your program to be correct! [2023-12-21 11:13:07,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...