/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_3.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 11:13:19,833 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 11:13:19,885 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:13:19,888 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 11:13:19,888 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 11:13:19,912 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 11:13:19,913 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 11:13:19,913 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 11:13:19,913 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 11:13:19,916 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 11:13:19,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 11:13:19,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 11:13:19,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 11:13:19,918 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 11:13:19,918 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 11:13:19,918 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 11:13:19,919 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 11:13:19,919 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 11:13:19,919 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 11:13:19,919 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 11:13:19,919 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 11:13:19,920 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 11:13:19,920 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 11:13:19,920 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 11:13:19,920 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 11:13:19,920 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 11:13:19,920 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 11:13:19,921 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 11:13:19,921 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 11:13:19,921 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 11:13:19,922 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 11:13:19,922 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 11:13:19,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 11:13:19,922 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 11:13:19,922 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 11:13:19,922 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 11:13:19,922 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 11:13:19,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 11:13:19,923 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 11:13:19,923 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 11:13:19,923 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 11:13:19,923 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 11:13:19,923 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 11:13:19,923 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:20,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 11:13:20,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 11:13:20,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 11:13:20,108 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 11:13:20,108 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 11:13:20,109 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_3.cil.c [2023-12-21 11:13:21,035 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 11:13:21,240 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 11:13:21,241 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_3.cil.c [2023-12-21 11:13:21,250 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b3687aa3/05707716475f4825b9de19081ec6962a/FLAG1d569db96 [2023-12-21 11:13:21,639 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b3687aa3/05707716475f4825b9de19081ec6962a [2023-12-21 11:13:21,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 11:13:21,642 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 11:13:21,644 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 11:13:21,644 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 11:13:21,647 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 11:13:21,648 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 11:13:21" (1/1) ... [2023-12-21 11:13:21,649 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64df4f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:13:21, skipping insertion in model container [2023-12-21 11:13:21,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 11:13:21" (1/1) ... [2023-12-21 11:13:21,684 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 11:13:21,789 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_3.cil.c[640,653] [2023-12-21 11:13:21,832 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 11:13:21,840 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 11:13:21,848 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_3.cil.c[640,653] [2023-12-21 11:13:21,865 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 11:13:21,878 INFO L206 MainTranslator]: Completed translation [2023-12-21 11:13:21,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:13:21 WrapperNode [2023-12-21 11:13:21,878 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 11:13:21,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 11:13:21,880 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 11:13:21,880 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 11:13:21,884 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:21" (1/1) ... [2023-12-21 11:13:21,890 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:21" (1/1) ... [2023-12-21 11:13:21,905 INFO L138 Inliner]: procedures = 31, calls = 35, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 227 [2023-12-21 11:13:21,905 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 11:13:21,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 11:13:21,906 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 11:13:21,906 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 11:13:21,912 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:21" (1/1) ... [2023-12-21 11:13:21,912 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:21" (1/1) ... [2023-12-21 11:13:21,922 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:21" (1/1) ... [2023-12-21 11:13:21,931 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:21,931 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:21" (1/1) ... [2023-12-21 11:13:21,931 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:21" (1/1) ... [2023-12-21 11:13:21,935 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:21" (1/1) ... [2023-12-21 11:13:21,942 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:21" (1/1) ... [2023-12-21 11:13:21,944 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:21" (1/1) ... [2023-12-21 11:13:21,944 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:21" (1/1) ... [2023-12-21 11:13:21,946 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 11:13:21,947 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 11:13:21,947 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 11:13:21,947 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 11:13:21,947 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:13:21" (1/1) ... [2023-12-21 11:13:21,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 11:13:21,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:13:21,981 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:21,998 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:22,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 11:13:22,002 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-12-21 11:13:22,003 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-12-21 11:13:22,003 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-12-21 11:13:22,003 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-12-21 11:13:22,003 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-12-21 11:13:22,004 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-12-21 11:13:22,004 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-12-21 11:13:22,005 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-12-21 11:13:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-12-21 11:13:22,005 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-12-21 11:13:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-12-21 11:13:22,005 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-12-21 11:13:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 11:13:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-12-21 11:13:22,005 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-12-21 11:13:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 11:13:22,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 11:13:22,006 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-12-21 11:13:22,006 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-12-21 11:13:22,079 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 11:13:22,082 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 11:13:22,354 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##54: assume !(1 == ~q_free~0); [2023-12-21 11:13:22,356 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##53: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2023-12-21 11:13:22,370 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 11:13:22,411 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 11:13:22,411 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-21 11:13:22,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 11:13:22 BoogieIcfgContainer [2023-12-21 11:13:22,412 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 11:13:22,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 11:13:22,414 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 11:13:22,416 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 11:13:22,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 11:13:21" (1/3) ... [2023-12-21 11:13:22,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b34c301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 11:13:22, skipping insertion in model container [2023-12-21 11:13:22,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:13:21" (2/3) ... [2023-12-21 11:13:22,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b34c301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 11:13:22, skipping insertion in model container [2023-12-21 11:13:22,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 11:13:22" (3/3) ... [2023-12-21 11:13:22,418 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil.c [2023-12-21 11:13:22,429 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 11:13:22,429 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 11:13:22,470 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 11:13:22,476 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;@2f4c2485, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 11:13:22,476 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 11:13:22,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 78 states have (on average 1.6282051282051282) internal successors, (127), 82 states have internal predecessors, (127), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-21 11:13:22,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-21 11:13:22,487 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:13:22,487 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:13:22,488 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:13:22,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:13:22,493 INFO L85 PathProgramCache]: Analyzing trace with hash -999542766, now seen corresponding path program 1 times [2023-12-21 11:13:22,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:13:22,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123914727] [2023-12-21 11:13:22,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:13:22,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:13:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:22,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:13:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:22,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 11:13:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:22,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:13:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:22,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:13:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:22,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 11:13:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:22,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:13:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:22,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 11:13:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:22,953 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:22,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:13:22,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123914727] [2023-12-21 11:13:22,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123914727] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:13:22,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:13:22,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 11:13:22,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143342364] [2023-12-21 11:13:22,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:13:22,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 11:13:22,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:13:22,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 11:13:22,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-21 11:13:22,987 INFO L87 Difference]: Start difference. First operand has 104 states, 78 states have (on average 1.6282051282051282) internal successors, (127), 82 states have internal predecessors, (127), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-21 11:13:23,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:13:23,475 INFO L93 Difference]: Finished difference Result 340 states and 532 transitions. [2023-12-21 11:13:23,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-21 11:13:23,477 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 56 [2023-12-21 11:13:23,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:13:23,484 INFO L225 Difference]: With dead ends: 340 [2023-12-21 11:13:23,484 INFO L226 Difference]: Without dead ends: 239 [2023-12-21 11:13:23,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2023-12-21 11:13:23,489 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 451 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 11:13:23,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 370 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 11:13:23,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2023-12-21 11:13:23,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 202. [2023-12-21 11:13:23,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 156 states have (on average 1.4871794871794872) internal successors, (232), 160 states have internal predecessors, (232), 29 states have call successors, (29), 15 states have call predecessors, (29), 16 states have return successors, (32), 28 states have call predecessors, (32), 27 states have call successors, (32) [2023-12-21 11:13:23,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 293 transitions. [2023-12-21 11:13:23,530 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 293 transitions. Word has length 56 [2023-12-21 11:13:23,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:13:23,531 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 293 transitions. [2023-12-21 11:13:23,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-21 11:13:23,531 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 293 transitions. [2023-12-21 11:13:23,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-21 11:13:23,533 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:13:23,533 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:13:23,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 11:13:23,533 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:13:23,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:13:23,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1351431762, now seen corresponding path program 1 times [2023-12-21 11:13:23,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:13:23,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978618614] [2023-12-21 11:13:23,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:13:23,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:13:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:23,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:13:23,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:23,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 11:13:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:23,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:13:23,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:23,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:13:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:23,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 11:13:23,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:23,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:13:23,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:23,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 11:13:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:23,641 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:23,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:13:23,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978618614] [2023-12-21 11:13:23,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978618614] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:13:23,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:13:23,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 11:13:23,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247954278] [2023-12-21 11:13:23,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:13:23,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 11:13:23,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:13:23,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 11:13:23,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-21 11:13:23,644 INFO L87 Difference]: Start difference. First operand 202 states and 293 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-21 11:13:24,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:13:24,199 INFO L93 Difference]: Finished difference Result 563 states and 823 transitions. [2023-12-21 11:13:24,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-21 11:13:24,199 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 56 [2023-12-21 11:13:24,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:13:24,202 INFO L225 Difference]: With dead ends: 563 [2023-12-21 11:13:24,202 INFO L226 Difference]: Without dead ends: 375 [2023-12-21 11:13:24,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2023-12-21 11:13:24,204 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 429 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 11:13:24,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 615 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 11:13:24,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2023-12-21 11:13:24,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 303. [2023-12-21 11:13:24,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 235 states have (on average 1.476595744680851) internal successors, (347), 241 states have internal predecessors, (347), 42 states have call successors, (42), 22 states have call predecessors, (42), 25 states have return successors, (53), 42 states have call predecessors, (53), 40 states have call successors, (53) [2023-12-21 11:13:24,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 442 transitions. [2023-12-21 11:13:24,229 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 442 transitions. Word has length 56 [2023-12-21 11:13:24,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:13:24,230 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 442 transitions. [2023-12-21 11:13:24,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-21 11:13:24,230 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 442 transitions. [2023-12-21 11:13:24,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-21 11:13:24,232 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:13:24,232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:13:24,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 11:13:24,233 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:13:24,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:13:24,233 INFO L85 PathProgramCache]: Analyzing trace with hash -2050049196, now seen corresponding path program 1 times [2023-12-21 11:13:24,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:13:24,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651811276] [2023-12-21 11:13:24,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:13:24,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:13:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:24,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:13:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:24,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 11:13:24,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:24,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:13:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:24,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:13:24,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:24,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 11:13:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:24,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:13:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:24,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 11:13:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:24,330 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:24,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:13:24,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651811276] [2023-12-21 11:13:24,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651811276] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:13:24,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:13:24,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-21 11:13:24,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914352239] [2023-12-21 11:13:24,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:13:24,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 11:13:24,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:13:24,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 11:13:24,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-21 11:13:24,332 INFO L87 Difference]: Start difference. First operand 303 states and 442 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-21 11:13:25,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:13:25,075 INFO L93 Difference]: Finished difference Result 1171 states and 1716 transitions. [2023-12-21 11:13:25,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-21 11:13:25,075 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 56 [2023-12-21 11:13:25,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:13:25,079 INFO L225 Difference]: With dead ends: 1171 [2023-12-21 11:13:25,079 INFO L226 Difference]: Without dead ends: 870 [2023-12-21 11:13:25,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2023-12-21 11:13:25,082 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 890 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 1222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 11:13:25,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 735 Invalid, 1222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 11:13:25,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2023-12-21 11:13:25,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 774. [2023-12-21 11:13:25,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 610 states have (on average 1.4229508196721312) internal successors, (868), 624 states have internal predecessors, (868), 92 states have call successors, (92), 63 states have call predecessors, (92), 71 states have return successors, (117), 88 states have call predecessors, (117), 90 states have call successors, (117) [2023-12-21 11:13:25,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1077 transitions. [2023-12-21 11:13:25,137 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1077 transitions. Word has length 56 [2023-12-21 11:13:25,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:13:25,138 INFO L495 AbstractCegarLoop]: Abstraction has 774 states and 1077 transitions. [2023-12-21 11:13:25,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-21 11:13:25,138 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1077 transitions. [2023-12-21 11:13:25,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-21 11:13:25,139 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:13:25,139 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:13:25,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 11:13:25,140 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:13:25,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:13:25,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1834223676, now seen corresponding path program 1 times [2023-12-21 11:13:25,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:13:25,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284611911] [2023-12-21 11:13:25,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:13:25,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:13:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:25,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:13:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:25,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 11:13:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:25,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:13:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:25,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:13:25,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:25,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 11:13:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:25,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:13:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:25,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:13:25,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:25,252 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:25,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:13:25,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284611911] [2023-12-21 11:13:25,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284611911] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:13:25,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:13:25,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-21 11:13:25,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200784160] [2023-12-21 11:13:25,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:13:25,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 11:13:25,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:13:25,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 11:13:25,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-21 11:13:25,254 INFO L87 Difference]: Start difference. First operand 774 states and 1077 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-21 11:13:25,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:13:25,605 INFO L93 Difference]: Finished difference Result 1622 states and 2270 transitions. [2023-12-21 11:13:25,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 11:13:25,606 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 57 [2023-12-21 11:13:25,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:13:25,609 INFO L225 Difference]: With dead ends: 1622 [2023-12-21 11:13:25,609 INFO L226 Difference]: Without dead ends: 856 [2023-12-21 11:13:25,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-12-21 11:13:25,611 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 126 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 11:13:25,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 515 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 11:13:25,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2023-12-21 11:13:25,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 790. [2023-12-21 11:13:25,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 622 states have (on average 1.4083601286173633) internal successors, (876), 636 states have internal predecessors, (876), 92 states have call successors, (92), 63 states have call predecessors, (92), 75 states have return successors, (121), 92 states have call predecessors, (121), 90 states have call successors, (121) [2023-12-21 11:13:25,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1089 transitions. [2023-12-21 11:13:25,643 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1089 transitions. Word has length 57 [2023-12-21 11:13:25,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:13:25,643 INFO L495 AbstractCegarLoop]: Abstraction has 790 states and 1089 transitions. [2023-12-21 11:13:25,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-21 11:13:25,643 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1089 transitions. [2023-12-21 11:13:25,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-21 11:13:25,644 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:13:25,644 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:13:25,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 11:13:25,644 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:13:25,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:13:25,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1906610234, now seen corresponding path program 1 times [2023-12-21 11:13:25,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:13:25,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069297454] [2023-12-21 11:13:25,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:13:25,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:13:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:25,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:13:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:25,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 11:13:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:25,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:13:25,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:25,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:13:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:25,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 11:13:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:25,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:13:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:25,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:13:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:25,720 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:25,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:13:25,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069297454] [2023-12-21 11:13:25,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069297454] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:13:25,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:13:25,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-21 11:13:25,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253471175] [2023-12-21 11:13:25,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:13:25,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 11:13:25,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:13:25,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 11:13:25,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-21 11:13:25,721 INFO L87 Difference]: Start difference. First operand 790 states and 1089 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-21 11:13:26,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:13:26,518 INFO L93 Difference]: Finished difference Result 2983 states and 4212 transitions. [2023-12-21 11:13:26,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-21 11:13:26,519 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 57 [2023-12-21 11:13:26,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:13:26,522 INFO L225 Difference]: With dead ends: 2983 [2023-12-21 11:13:26,522 INFO L226 Difference]: Without dead ends: 1158 [2023-12-21 11:13:26,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2023-12-21 11:13:26,526 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 767 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 11:13:26,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 903 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 11:13:26,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2023-12-21 11:13:26,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1040. [2023-12-21 11:13:26,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1040 states, 800 states have (on average 1.35375) internal successors, (1083), 816 states have internal predecessors, (1083), 132 states have call successors, (132), 91 states have call predecessors, (132), 107 states have return successors, (167), 134 states have call predecessors, (167), 130 states have call successors, (167) [2023-12-21 11:13:26,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1382 transitions. [2023-12-21 11:13:26,575 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1382 transitions. Word has length 57 [2023-12-21 11:13:26,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:13:26,576 INFO L495 AbstractCegarLoop]: Abstraction has 1040 states and 1382 transitions. [2023-12-21 11:13:26,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-21 11:13:26,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1382 transitions. [2023-12-21 11:13:26,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-21 11:13:26,576 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:13:26,576 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, 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:26,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 11:13:26,577 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:13:26,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:13:26,577 INFO L85 PathProgramCache]: Analyzing trace with hash 2045842353, now seen corresponding path program 1 times [2023-12-21 11:13:26,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:13:26,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246105468] [2023-12-21 11:13:26,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:13:26,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:13:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:26,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:13:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:26,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 11:13:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:26,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:13:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:26,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:13:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:26,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 11:13:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:26,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-21 11:13:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:26,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-21 11:13:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:26,656 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:26,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:13:26,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246105468] [2023-12-21 11:13:26,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246105468] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:13:26,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:13:26,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-21 11:13:26,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262375716] [2023-12-21 11:13:26,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:13:26,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 11:13:26,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:13:26,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 11:13:26,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-21 11:13:26,658 INFO L87 Difference]: Start difference. First operand 1040 states and 1382 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-21 11:13:27,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:13:27,024 INFO L93 Difference]: Finished difference Result 2220 states and 2984 transitions. [2023-12-21 11:13:27,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 11:13:27,025 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2023-12-21 11:13:27,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:13:27,028 INFO L225 Difference]: With dead ends: 2220 [2023-12-21 11:13:27,028 INFO L226 Difference]: Without dead ends: 1188 [2023-12-21 11:13:27,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-12-21 11:13:27,031 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 121 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 11:13:27,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 481 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 11:13:27,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2023-12-21 11:13:27,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1088. [2023-12-21 11:13:27,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 836 states have (on average 1.3385167464114833) internal successors, (1119), 852 states have internal predecessors, (1119), 132 states have call successors, (132), 91 states have call predecessors, (132), 119 states have return successors, (179), 146 states have call predecessors, (179), 130 states have call successors, (179) [2023-12-21 11:13:27,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1430 transitions. [2023-12-21 11:13:27,085 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1430 transitions. Word has length 58 [2023-12-21 11:13:27,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:13:27,085 INFO L495 AbstractCegarLoop]: Abstraction has 1088 states and 1430 transitions. [2023-12-21 11:13:27,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-21 11:13:27,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1430 transitions. [2023-12-21 11:13:27,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-21 11:13:27,085 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:13:27,086 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, 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:27,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 11:13:27,086 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:13:27,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:13:27,086 INFO L85 PathProgramCache]: Analyzing trace with hash -2108576333, now seen corresponding path program 1 times [2023-12-21 11:13:27,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:13:27,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471698621] [2023-12-21 11:13:27,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:13:27,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:13:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:27,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:13:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:27,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 11:13:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:27,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:13:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:27,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:13:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:27,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 11:13:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:27,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-21 11:13:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:27,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-21 11:13:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:27,235 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:27,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:13:27,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471698621] [2023-12-21 11:13:27,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471698621] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:13:27,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:13:27,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 11:13:27,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661885825] [2023-12-21 11:13:27,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:13:27,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 11:13:27,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:13:27,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 11:13:27,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-21 11:13:27,237 INFO L87 Difference]: Start difference. First operand 1088 states and 1430 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-21 11:13:27,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:13:27,753 INFO L93 Difference]: Finished difference Result 2133 states and 2816 transitions. [2023-12-21 11:13:27,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-21 11:13:27,754 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2023-12-21 11:13:27,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:13:27,757 INFO L225 Difference]: With dead ends: 2133 [2023-12-21 11:13:27,757 INFO L226 Difference]: Without dead ends: 1053 [2023-12-21 11:13:27,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2023-12-21 11:13:27,759 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 440 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 11:13:27,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 410 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 11:13:27,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2023-12-21 11:13:27,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 882. [2023-12-21 11:13:27,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 681 states have (on average 1.327459618208517) internal successors, (904), 695 states have internal predecessors, (904), 105 states have call successors, (105), 73 states have call predecessors, (105), 95 states have return successors, (143), 114 states have call predecessors, (143), 103 states have call successors, (143) [2023-12-21 11:13:27,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1152 transitions. [2023-12-21 11:13:27,791 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1152 transitions. Word has length 58 [2023-12-21 11:13:27,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:13:27,791 INFO L495 AbstractCegarLoop]: Abstraction has 882 states and 1152 transitions. [2023-12-21 11:13:27,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-21 11:13:27,791 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1152 transitions. [2023-12-21 11:13:27,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-21 11:13:27,792 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:13:27,792 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, 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:27,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-21 11:13:27,792 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:13:27,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:13:27,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1368742513, now seen corresponding path program 1 times [2023-12-21 11:13:27,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:13:27,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590630753] [2023-12-21 11:13:27,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:13:27,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:13:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:27,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:13:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:27,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 11:13:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:27,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:13:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:27,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:13:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:27,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 11:13:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:27,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-21 11:13:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:27,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-21 11:13:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:27,844 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:27,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:13:27,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590630753] [2023-12-21 11:13:27,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590630753] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:13:27,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:13:27,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 11:13:27,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946620177] [2023-12-21 11:13:27,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:13:27,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 11:13:27,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:13:27,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 11:13:27,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:13:27,846 INFO L87 Difference]: Start difference. First operand 882 states and 1152 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 4 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-21 11:13:28,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:13:28,188 INFO L93 Difference]: Finished difference Result 2696 states and 3572 transitions. [2023-12-21 11:13:28,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 11:13:28,188 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 4 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2023-12-21 11:13:28,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:13:28,194 INFO L225 Difference]: With dead ends: 2696 [2023-12-21 11:13:28,194 INFO L226 Difference]: Without dead ends: 1823 [2023-12-21 11:13:28,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2023-12-21 11:13:28,196 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 405 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 11:13:28,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 271 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 11:13:28,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2023-12-21 11:13:28,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1715. [2023-12-21 11:13:28,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1715 states, 1307 states have (on average 1.297628156082632) internal successors, (1696), 1334 states have internal predecessors, (1696), 212 states have call successors, (212), 145 states have call predecessors, (212), 195 states have return successors, (335), 237 states have call predecessors, (335), 210 states have call successors, (335) [2023-12-21 11:13:28,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2243 transitions. [2023-12-21 11:13:28,268 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2243 transitions. Word has length 58 [2023-12-21 11:13:28,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:13:28,268 INFO L495 AbstractCegarLoop]: Abstraction has 1715 states and 2243 transitions. [2023-12-21 11:13:28,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 4 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-21 11:13:28,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2243 transitions. [2023-12-21 11:13:28,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-21 11:13:28,268 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:13:28,269 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, 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:28,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-21 11:13:28,269 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:13:28,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:13:28,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1945360166, now seen corresponding path program 1 times [2023-12-21 11:13:28,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:13:28,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112757149] [2023-12-21 11:13:28,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:13:28,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:13:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:28,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:13:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:28,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 11:13:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:28,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:13:28,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:28,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:13:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:28,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 11:13:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:28,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-21 11:13:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:28,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-21 11:13:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:13:28,320 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:28,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:13:28,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112757149] [2023-12-21 11:13:28,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112757149] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:13:28,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:13:28,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 11:13:28,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436586963] [2023-12-21 11:13:28,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:13:28,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 11:13:28,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:13:28,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 11:13:28,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:13:28,325 INFO L87 Difference]: Start difference. First operand 1715 states and 2243 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-21 11:13:28,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:13:28,506 INFO L93 Difference]: Finished difference Result 3394 states and 4520 transitions. [2023-12-21 11:13:28,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 11:13:28,507 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2023-12-21 11:13:28,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:13:28,507 INFO L225 Difference]: With dead ends: 3394 [2023-12-21 11:13:28,507 INFO L226 Difference]: Without dead ends: 0 [2023-12-21 11:13:28,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-12-21 11:13:28,513 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 244 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:13:28,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 155 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:13:28,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-21 11:13:28,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-21 11:13:28,514 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:28,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-21 11:13:28,514 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2023-12-21 11:13:28,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:13:28,514 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-21 11:13:28,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-21 11:13:28,515 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-21 11:13:28,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-21 11:13:28,517 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 11:13:28,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-21 11:13:28,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-21 11:13:32,932 INFO L895 garLoopResultBuilder]: At program point L385(line 385) the Hoare annotation is: (let ((.cse0 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|)))) (and (or (not (= ~c_dr_pc~0 0)) .cse0) (or .cse0 (not (= ~c_dr_pc~0 1))))) [2023-12-21 11:13:32,933 INFO L895 garLoopResultBuilder]: At program point L387-2(lines 387 391) the Hoare annotation is: (let ((.cse0 (not (= ~c_dr_pc~0 0))) (.cse1 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse2 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse4 (= activate_threads_~tmp~1 0)) (.cse3 (= ~p_dw_pc~0 1)) (.cse5 (not (= ~q_read_ev~0 2)))) (and (or .cse0 (and .cse1 .cse2) (= ~p_dw_st~0 0)) (or .cse0 .cse2 (not (= |old(~p_dw_st~0)| 0))) (or .cse0 .cse3 (and .cse1 .cse4) .cse5) (or (and .cse1 .cse2 .cse4) .cse3 (not (= ~c_dr_pc~0 1)) .cse5))) [2023-12-21 11:13:32,933 INFO L899 garLoopResultBuilder]: For program point L385-1(line 385) no Hoare annotation was computed. [2023-12-21 11:13:32,933 INFO L899 garLoopResultBuilder]: For program point L395(lines 395 399) no Hoare annotation was computed. [2023-12-21 11:13:32,933 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 379 403) no Hoare annotation was computed. [2023-12-21 11:13:32,933 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 379 403) the Hoare annotation is: (let ((.cse0 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|)))) (and (or (not (= ~c_dr_pc~0 0)) .cse0) (or .cse0 (not (= ~c_dr_pc~0 1))))) [2023-12-21 11:13:32,933 INFO L899 garLoopResultBuilder]: For program point L393(line 393) no Hoare annotation was computed. [2023-12-21 11:13:32,933 INFO L899 garLoopResultBuilder]: For program point L395-2(lines 379 403) no Hoare annotation was computed. [2023-12-21 11:13:32,933 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 391) no Hoare annotation was computed. [2023-12-21 11:13:32,933 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 287 306) no Hoare annotation was computed. [2023-12-21 11:13:32,933 INFO L899 garLoopResultBuilder]: For program point L303(lines 290 305) no Hoare annotation was computed. [2023-12-21 11:13:32,934 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 287 306) the Hoare annotation is: true [2023-12-21 11:13:32,934 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 300) no Hoare annotation was computed. [2023-12-21 11:13:32,934 INFO L899 garLoopResultBuilder]: For program point L291(lines 291 301) no Hoare annotation was computed. [2023-12-21 11:13:32,934 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 101) no Hoare annotation was computed. [2023-12-21 11:13:32,934 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 104) no Hoare annotation was computed. [2023-12-21 11:13:32,934 INFO L899 garLoopResultBuilder]: For program point L95-2(lines 94 118) no Hoare annotation was computed. [2023-12-21 11:13:32,934 INFO L899 garLoopResultBuilder]: For program point L116(lines 94 118) no Hoare annotation was computed. [2023-12-21 11:13:32,934 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 111) no Hoare annotation was computed. [2023-12-21 11:13:32,934 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 91 119) the Hoare annotation is: true [2023-12-21 11:13:32,934 INFO L899 garLoopResultBuilder]: For program point L105-1(lines 105 114) no Hoare annotation was computed. [2023-12-21 11:13:32,934 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 91 119) no Hoare annotation was computed. [2023-12-21 11:13:32,934 INFO L899 garLoopResultBuilder]: For program point L316-1(lines 307 324) no Hoare annotation was computed. [2023-12-21 11:13:32,934 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 307 324) the Hoare annotation is: (let ((.cse0 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0)))) (and (or .cse0 (not (= ~c_dr_pc~0 1))) (or (not (= ~c_dr_pc~0 0)) .cse0))) [2023-12-21 11:13:32,934 INFO L899 garLoopResultBuilder]: For program point L311-1(lines 310 323) no Hoare annotation was computed. [2023-12-21 11:13:32,934 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 307 324) no Hoare annotation was computed. [2023-12-21 11:13:32,934 INFO L899 garLoopResultBuilder]: For program point L258-1(lines 254 268) no Hoare annotation was computed. [2023-12-21 11:13:32,934 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 254 268) no Hoare annotation was computed. [2023-12-21 11:13:32,936 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 254 268) the Hoare annotation is: (let ((.cse0 (and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|)))) (and (or .cse0 (not (= ~c_dr_pc~0 1))) (or .cse0 (not (= ~c_dr_pc~0 0))))) [2023-12-21 11:13:32,937 INFO L899 garLoopResultBuilder]: For program point L41-1(lines 41 45) no Hoare annotation was computed. [2023-12-21 11:13:32,937 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 40) no Hoare annotation was computed. [2023-12-21 11:13:32,937 INFO L899 garLoopResultBuilder]: For program point L36-2(lines 35 50) no Hoare annotation was computed. [2023-12-21 11:13:32,937 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 325 342) no Hoare annotation was computed. [2023-12-21 11:13:32,937 INFO L899 garLoopResultBuilder]: For program point L334-1(lines 325 342) no Hoare annotation was computed. [2023-12-21 11:13:32,937 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 325 342) the Hoare annotation is: (let ((.cse0 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0)))) (and (or .cse0 (not (= ~c_dr_pc~0 1))) (or (not (= ~c_dr_pc~0 0)) .cse0))) [2023-12-21 11:13:32,937 INFO L899 garLoopResultBuilder]: For program point L329-1(lines 328 341) no Hoare annotation was computed. [2023-12-21 11:13:32,937 INFO L899 garLoopResultBuilder]: For program point L514-1(line 514) no Hoare annotation was computed. [2023-12-21 11:13:32,937 INFO L899 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2023-12-21 11:13:32,937 INFO L899 garLoopResultBuilder]: For program point L415-1(lines 410 450) no Hoare annotation was computed. [2023-12-21 11:13:32,937 INFO L899 garLoopResultBuilder]: For program point L349(lines 349 356) no Hoare annotation was computed. [2023-12-21 11:13:32,937 INFO L899 garLoopResultBuilder]: For program point L349-2(lines 345 360) no Hoare annotation was computed. [2023-12-21 11:13:32,937 INFO L899 garLoopResultBuilder]: For program point L465(lines 465 470) no Hoare annotation was computed. [2023-12-21 11:13:32,937 INFO L899 garLoopResultBuilder]: For program point L234(lines 234 246) no Hoare annotation was computed. [2023-12-21 11:13:32,937 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 160) no Hoare annotation was computed. [2023-12-21 11:13:32,938 INFO L899 garLoopResultBuilder]: For program point do_write_p_returnLabel#1(lines 145 193) no Hoare annotation was computed. [2023-12-21 11:13:32,938 INFO L899 garLoopResultBuilder]: For program point start_simulation_returnLabel#1(lines 476 534) no Hoare annotation was computed. [2023-12-21 11:13:32,938 INFO L895 garLoopResultBuilder]: At program point L499(line 499) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (= ~c_dr_pc~0 0)) [2023-12-21 11:13:32,938 INFO L899 garLoopResultBuilder]: For program point L499-1(line 499) no Hoare annotation was computed. [2023-12-21 11:13:32,938 INFO L899 garLoopResultBuilder]: For program point L235(lines 235 241) no Hoare annotation was computed. [2023-12-21 11:13:32,938 INFO L899 garLoopResultBuilder]: For program point L202(lines 202 206) no Hoare annotation was computed. [2023-12-21 11:13:32,938 INFO L895 garLoopResultBuilder]: At program point L484(line 484) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~q_req_up~0 0) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0)) [2023-12-21 11:13:32,938 INFO L899 garLoopResultBuilder]: For program point L484-1(line 484) no Hoare annotation was computed. [2023-12-21 11:13:32,938 INFO L895 garLoopResultBuilder]: At program point L435(lines 410 450) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (= ~c_dr_pc~0 0)) [2023-12-21 11:13:32,938 INFO L899 garLoopResultBuilder]: For program point L171(lines 171 179) no Hoare annotation was computed. [2023-12-21 11:13:32,938 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 159) no Hoare annotation was computed. [2023-12-21 11:13:32,938 INFO L899 garLoopResultBuilder]: For program point L370-1(lines 361 378) no Hoare annotation was computed. [2023-12-21 11:13:32,938 INFO L895 garLoopResultBuilder]: At program point L486(line 486) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~q_req_up~0 0) (= ~q_write_ev~0 2) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0)) [2023-12-21 11:13:32,938 INFO L895 garLoopResultBuilder]: At program point L486-1(line 486) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~q_req_up~0 0) (= ~q_write_ev~0 2) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0)) [2023-12-21 11:13:32,938 INFO L899 garLoopResultBuilder]: For program point L420(lines 410 450) no Hoare annotation was computed. [2023-12-21 11:13:32,938 INFO L895 garLoopResultBuilder]: At program point L503(line 503) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (= ~c_dr_pc~0 0)) [2023-12-21 11:13:32,939 INFO L895 garLoopResultBuilder]: At program point L503-1(line 503) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (= ~c_dr_pc~0 0)) [2023-12-21 11:13:32,939 INFO L895 garLoopResultBuilder]: At program point L239(line 239) the Hoare annotation is: false [2023-12-21 11:13:32,939 INFO L895 garLoopResultBuilder]: At program point L487(line 487) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~q_req_up~0 0) (= ~q_write_ev~0 2) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0)) [2023-12-21 11:13:32,939 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-21 11:13:32,939 INFO L895 garLoopResultBuilder]: At program point L504(line 504) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (= ~c_dr_pc~0 0)) [2023-12-21 11:13:32,939 INFO L899 garLoopResultBuilder]: For program point L273(lines 273 277) no Hoare annotation was computed. [2023-12-21 11:13:32,939 INFO L899 garLoopResultBuilder]: For program point L273-2(lines 272 285) no Hoare annotation was computed. [2023-12-21 11:13:32,939 INFO L895 garLoopResultBuilder]: At program point L505(line 505) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (= ~c_dr_pc~0 0)) [2023-12-21 11:13:32,939 INFO L899 garLoopResultBuilder]: For program point L472(lines 461 474) no Hoare annotation was computed. [2023-12-21 11:13:32,939 INFO L899 garLoopResultBuilder]: For program point L439(lines 439 446) no Hoare annotation was computed. [2023-12-21 11:13:32,939 INFO L899 garLoopResultBuilder]: For program point L523(lines 523 527) no Hoare annotation was computed. [2023-12-21 11:13:32,939 INFO L899 garLoopResultBuilder]: For program point L424(lines 424 431) no Hoare annotation was computed. [2023-12-21 11:13:32,939 INFO L899 garLoopResultBuilder]: For program point $Ultimate##36(lines 171 179) no Hoare annotation was computed. [2023-12-21 11:13:32,939 INFO L895 garLoopResultBuilder]: At program point L491-1(lines 491 528) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (= ~c_dr_pc~0 0)) [2023-12-21 11:13:32,939 INFO L899 garLoopResultBuilder]: For program point do_read_c_returnLabel#1(lines 195 253) no Hoare annotation was computed. [2023-12-21 11:13:32,939 INFO L899 garLoopResultBuilder]: For program point L508(line 508) no Hoare annotation was computed. [2023-12-21 11:13:32,939 INFO L895 garLoopResultBuilder]: At program point L244(line 244) the Hoare annotation is: false [2023-12-21 11:13:32,940 INFO L902 garLoopResultBuilder]: At program point L244-1(lines 210 247) the Hoare annotation is: true [2023-12-21 11:13:32,940 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-21 11:13:32,940 INFO L899 garLoopResultBuilder]: For program point L278-1(lines 269 286) no Hoare annotation was computed. [2023-12-21 11:13:32,940 INFO L899 garLoopResultBuilder]: For program point eval_returnLabel#1(lines 404 456) no Hoare annotation was computed. [2023-12-21 11:13:32,940 INFO L899 garLoopResultBuilder]: For program point L510(lines 510 519) no Hoare annotation was computed. [2023-12-21 11:13:32,940 INFO L899 garLoopResultBuilder]: For program point L510-2(lines 510 519) no Hoare annotation was computed. [2023-12-21 11:13:32,940 INFO L895 garLoopResultBuilder]: At program point L411(line 411) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (= ~c_dr_pc~0 0)) [2023-12-21 11:13:32,940 INFO L895 garLoopResultBuilder]: At program point L164-1(lines 164 187) the Hoare annotation is: (let ((.cse0 (= ~c_dr_pc~0 1)) (.cse2 (= ~q_req_up~0 1)) (.cse1 (not (= ~p_dw_pc~0 1))) (.cse3 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and .cse2 .cse3) (and .cse1 .cse3))) [2023-12-21 11:13:32,940 INFO L899 garLoopResultBuilder]: For program point L413(line 413) no Hoare annotation was computed. [2023-12-21 11:13:32,940 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 161) no Hoare annotation was computed. [2023-12-21 11:13:32,940 INFO L895 garLoopResultBuilder]: At program point L463(line 463) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (= ~c_dr_pc~0 0)) [2023-12-21 11:13:32,940 INFO L899 garLoopResultBuilder]: For program point L463-1(line 463) no Hoare annotation was computed. [2023-12-21 11:13:32,940 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 207) no Hoare annotation was computed. [2023-12-21 11:13:32,940 INFO L899 garLoopResultBuilder]: For program point L365(lines 365 369) no Hoare annotation was computed. [2023-12-21 11:13:32,940 INFO L899 garLoopResultBuilder]: For program point L365-2(lines 364 377) no Hoare annotation was computed. [2023-12-21 11:13:32,940 INFO L895 garLoopResultBuilder]: At program point L514(line 514) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (= ~c_dr_pc~0 0)) [2023-12-21 11:13:32,940 INFO L899 garLoopResultBuilder]: For program point L66-2(lines 65 89) no Hoare annotation was computed. [2023-12-21 11:13:32,941 INFO L899 garLoopResultBuilder]: For program point L87(lines 65 89) no Hoare annotation was computed. [2023-12-21 11:13:32,941 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 62 90) no Hoare annotation was computed. [2023-12-21 11:13:32,941 INFO L899 garLoopResultBuilder]: For program point L77(lines 77 82) no Hoare annotation was computed. [2023-12-21 11:13:32,941 INFO L899 garLoopResultBuilder]: For program point L76-1(lines 76 85) no Hoare annotation was computed. [2023-12-21 11:13:32,941 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 62 90) the Hoare annotation is: true [2023-12-21 11:13:32,941 INFO L899 garLoopResultBuilder]: For program point L67(lines 67 72) no Hoare annotation was computed. [2023-12-21 11:13:32,941 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 75) no Hoare annotation was computed. [2023-12-21 11:13:32,941 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 15 22) no Hoare annotation was computed. [2023-12-21 11:13:32,941 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 15 22) the Hoare annotation is: true [2023-12-21 11:13:32,941 INFO L899 garLoopResultBuilder]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-21 11:13:32,943 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:13:32,944 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 11:13:32,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 11:13:32 BoogieIcfgContainer [2023-12-21 11:13:32,958 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 11:13:32,959 INFO L158 Benchmark]: Toolchain (without parser) took 11317.13ms. Allocated memory was 317.7MB in the beginning and 934.3MB in the end (delta: 616.6MB). Free memory was 277.0MB in the beginning and 408.6MB in the end (delta: -131.6MB). Peak memory consumption was 529.6MB. Max. memory is 8.0GB. [2023-12-21 11:13:32,959 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 207.6MB. Free memory is still 155.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 11:13:32,959 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.73ms. Allocated memory is still 317.7MB. Free memory was 276.6MB in the beginning and 262.4MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-21 11:13:32,959 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.15ms. Allocated memory is still 317.7MB. Free memory was 262.4MB in the beginning and 260.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 11:13:32,959 INFO L158 Benchmark]: Boogie Preprocessor took 40.63ms. Allocated memory is still 317.7MB. Free memory was 260.4MB in the beginning and 257.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 11:13:32,960 INFO L158 Benchmark]: RCFGBuilder took 465.58ms. Allocated memory is still 317.7MB. Free memory was 257.7MB in the beginning and 235.7MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-12-21 11:13:32,960 INFO L158 Benchmark]: TraceAbstraction took 10544.52ms. Allocated memory was 317.7MB in the beginning and 934.3MB in the end (delta: 616.6MB). Free memory was 235.2MB in the beginning and 408.6MB in the end (delta: -173.5MB). Peak memory consumption was 487.7MB. Max. memory is 8.0GB. [2023-12-21 11:13:32,961 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 207.6MB. Free memory is still 155.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.73ms. Allocated memory is still 317.7MB. Free memory was 276.6MB in the beginning and 262.4MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.15ms. Allocated memory is still 317.7MB. Free memory was 262.4MB in the beginning and 260.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.63ms. Allocated memory is still 317.7MB. Free memory was 260.4MB in the beginning and 257.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 465.58ms. Allocated memory is still 317.7MB. Free memory was 257.7MB in the beginning and 235.7MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 10544.52ms. Allocated memory was 317.7MB in the beginning and 934.3MB in the end (delta: 616.6MB). Free memory was 235.2MB in the beginning and 408.6MB in the end (delta: -173.5MB). Peak memory consumption was 487.7MB. 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 9 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3954 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3873 mSDsluCounter, 4455 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3474 mSDsCounter, 977 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5255 IncrementalHoareTripleChecker+Invalid, 6232 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 977 mSolverCounterUnsat, 981 mSDtfsCounter, 5255 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 310 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1715occurred in iteration=8, InterpolantAutomatonStates: 131, 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, 768 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 1574 PreInvPairs, 2017 NumberOfFragments, 381 HoareAnnotationTreeSize, 1574 FormulaSimplifications, 299571 FormulaSimplificationTreeSizeReduction, 3.0s HoareSimplificationTime, 28 FormulaSimplificationsInter, 14918 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 515 NumberOfCodeBlocks, 515 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 506 ConstructedInterpolants, 0 QuantifiedInterpolants, 1074 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 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: 491]: Loop Invariant Derived loop invariant: ((c_dr_pc == 1) || (c_dr_pc == 0)) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: ((c_dr_pc == 1) || (c_dr_pc == 0)) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (((((c_dr_pc == 1) && !((p_dw_pc == 1))) || ((q_req_up == 1) && (c_dr_pc == 1))) || ((q_req_up == 1) && (c_dr_pc == 0))) || (!((p_dw_pc == 1)) && (c_dr_pc == 0))) RESULT: Ultimate proved your program to be correct! [2023-12-21 11:13:32,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...