/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 true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/systemc/pc_sfifo_2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 00:37:36,013 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 00:37:36,080 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-20 00:37:36,085 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 00:37:36,085 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 00:37:36,106 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 00:37:36,106 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 00:37:36,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 00:37:36,107 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 00:37:36,109 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 00:37:36,110 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 00:37:36,110 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 00:37:36,111 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 00:37:36,111 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 00:37:36,112 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 00:37:36,112 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 00:37:36,112 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 00:37:36,112 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 00:37:36,112 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 00:37:36,113 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 00:37:36,113 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 00:37:36,113 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 00:37:36,114 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 00:37:36,114 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 00:37:36,114 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 00:37:36,114 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 00:37:36,114 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 00:37:36,114 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 00:37:36,115 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 00:37:36,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 00:37:36,115 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 00:37:36,116 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 00:37:36,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 00:37:36,116 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 00:37:36,116 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 00:37:36,116 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 00:37:36,116 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 00:37:36,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 00:37:36,116 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 00:37:36,116 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 00:37:36,117 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 00:37:36,117 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 00:37:36,117 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 00:37:36,117 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 -> true [2023-12-20 00:37:36,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 00:37:36,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 00:37:36,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 00:37:36,299 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 00:37:36,299 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 00:37:36,300 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_2.cil-1.c [2023-12-20 00:37:37,322 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 00:37:37,478 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 00:37:37,479 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_2.cil-1.c [2023-12-20 00:37:37,485 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/578e0d1b2/2be8ce9ea01b4c5d9b23a078a962a143/FLAG500123206 [2023-12-20 00:37:37,498 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/578e0d1b2/2be8ce9ea01b4c5d9b23a078a962a143 [2023-12-20 00:37:37,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 00:37:37,500 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 00:37:37,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 00:37:37,503 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 00:37:37,506 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 00:37:37,507 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 12:37:37" (1/1) ... [2023-12-20 00:37:37,507 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d5bddff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:37:37, skipping insertion in model container [2023-12-20 00:37:37,508 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 12:37:37" (1/1) ... [2023-12-20 00:37:37,539 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 00:37:37,634 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_2.cil-1.c[643,656] [2023-12-20 00:37:37,675 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 00:37:37,681 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 00:37:37,688 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_2.cil-1.c[643,656] [2023-12-20 00:37:37,702 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 00:37:37,712 INFO L206 MainTranslator]: Completed translation [2023-12-20 00:37:37,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:37:37 WrapperNode [2023-12-20 00:37:37,713 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 00:37:37,713 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 00:37:37,713 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 00:37:37,713 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 00:37:37,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:37:37" (1/1) ... [2023-12-20 00:37:37,722 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:37:37" (1/1) ... [2023-12-20 00:37:37,736 INFO L138 Inliner]: procedures = 29, calls = 31, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 189 [2023-12-20 00:37:37,737 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 00:37:37,737 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 00:37:37,737 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 00:37:37,737 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 00:37:37,743 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:37:37" (1/1) ... [2023-12-20 00:37:37,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:37:37" (1/1) ... [2023-12-20 00:37:37,745 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:37:37" (1/1) ... [2023-12-20 00:37:37,752 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-20 00:37:37,753 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:37:37" (1/1) ... [2023-12-20 00:37:37,753 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:37:37" (1/1) ... [2023-12-20 00:37:37,756 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:37:37" (1/1) ... [2023-12-20 00:37:37,758 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:37:37" (1/1) ... [2023-12-20 00:37:37,759 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:37:37" (1/1) ... [2023-12-20 00:37:37,760 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:37:37" (1/1) ... [2023-12-20 00:37:37,762 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 00:37:37,763 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 00:37:37,763 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 00:37:37,763 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 00:37:37,764 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:37:37" (1/1) ... [2023-12-20 00:37:37,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 00:37:37,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:37:37,819 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-20 00:37:37,839 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-20 00:37:37,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 00:37:37,844 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-12-20 00:37:37,845 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-12-20 00:37:37,845 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-12-20 00:37:37,845 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-12-20 00:37:37,845 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-12-20 00:37:37,846 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-12-20 00:37:37,847 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-12-20 00:37:37,847 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-12-20 00:37:37,847 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-12-20 00:37:37,847 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-12-20 00:37:37,847 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-12-20 00:37:37,847 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-12-20 00:37:37,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 00:37:37,848 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-12-20 00:37:37,848 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-12-20 00:37:37,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 00:37:37,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 00:37:37,848 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-12-20 00:37:37,848 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-12-20 00:37:37,919 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 00:37:37,922 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 00:37:38,093 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 00:37:38,118 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 00:37:38,119 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-20 00:37:38,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 12:37:38 BoogieIcfgContainer [2023-12-20 00:37:38,119 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 00:37:38,121 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 00:37:38,121 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 00:37:38,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 00:37:38,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 12:37:37" (1/3) ... [2023-12-20 00:37:38,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40c8f55f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 12:37:38, skipping insertion in model container [2023-12-20 00:37:38,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:37:37" (2/3) ... [2023-12-20 00:37:38,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40c8f55f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 12:37:38, skipping insertion in model container [2023-12-20 00:37:38,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 12:37:38" (3/3) ... [2023-12-20 00:37:38,124 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1.c [2023-12-20 00:37:38,135 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 00:37:38,135 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 00:37:38,165 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 00:37:38,169 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;@1970b652, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 00:37:38,169 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 00:37:38,172 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 67 states have (on average 1.6119402985074627) internal successors, (108), 71 states have internal predecessors, (108), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-20 00:37:38,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-20 00:37:38,178 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:37:38,178 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-20 00:37:38,179 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:37:38,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:37:38,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1654461006, now seen corresponding path program 1 times [2023-12-20 00:37:38,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:37:38,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458895989] [2023-12-20 00:37:38,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:37:38,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:37:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:38,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:38,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:38,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:37:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:38,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:38,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:38,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:37:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:38,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 00:37:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:38,455 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-20 00:37:38,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:37:38,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458895989] [2023-12-20 00:37:38,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458895989] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:37:38,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:37:38,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-20 00:37:38,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132533818] [2023-12-20 00:37:38,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:37:38,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 00:37:38,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:37:38,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 00:37:38,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-20 00:37:38,489 INFO L87 Difference]: Start difference. First operand has 91 states, 67 states have (on average 1.6119402985074627) internal successors, (108), 71 states have internal predecessors, (108), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-20 00:37:38,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:37:38,781 INFO L93 Difference]: Finished difference Result 193 states and 291 transitions. [2023-12-20 00:37:38,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-20 00:37:38,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 57 [2023-12-20 00:37:38,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:37:38,792 INFO L225 Difference]: With dead ends: 193 [2023-12-20 00:37:38,793 INFO L226 Difference]: Without dead ends: 105 [2023-12-20 00:37:38,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-12-20 00:37:38,799 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 236 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 00:37:38,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 153 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 00:37:38,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-20 00:37:38,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2023-12-20 00:37:38,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.4545454545454546) internal successors, (96), 68 states have internal predecessors, (96), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-20 00:37:38,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 122 transitions. [2023-12-20 00:37:38,848 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 122 transitions. Word has length 57 [2023-12-20 00:37:38,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:37:38,849 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 122 transitions. [2023-12-20 00:37:38,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-20 00:37:38,849 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 122 transitions. [2023-12-20 00:37:38,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-20 00:37:38,853 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:37:38,853 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-20 00:37:38,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 00:37:38,853 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:37:38,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:37:38,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1173380748, now seen corresponding path program 1 times [2023-12-20 00:37:38,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:37:38,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827091030] [2023-12-20 00:37:38,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:37:38,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:37:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:38,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:38,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:39,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:37:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:39,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:39,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:39,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:37:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:39,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 00:37:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:39,058 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-20 00:37:39,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:37:39,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827091030] [2023-12-20 00:37:39,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827091030] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:37:39,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:37:39,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-20 00:37:39,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553303050] [2023-12-20 00:37:39,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:37:39,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-20 00:37:39,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:37:39,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-20 00:37:39,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-20 00:37:39,067 INFO L87 Difference]: Start difference. First operand 88 states and 122 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 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-20 00:37:39,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:37:39,471 INFO L93 Difference]: Finished difference Result 294 states and 419 transitions. [2023-12-20 00:37:39,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-20 00:37:39,472 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 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 57 [2023-12-20 00:37:39,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:37:39,485 INFO L225 Difference]: With dead ends: 294 [2023-12-20 00:37:39,485 INFO L226 Difference]: Without dead ends: 213 [2023-12-20 00:37:39,486 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-20 00:37:39,487 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 363 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 00:37:39,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 254 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 00:37:39,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-12-20 00:37:39,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 176. [2023-12-20 00:37:39,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 134 states have (on average 1.4328358208955223) internal successors, (192), 138 states have internal predecessors, (192), 25 states have call successors, (25), 15 states have call predecessors, (25), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) [2023-12-20 00:37:39,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 245 transitions. [2023-12-20 00:37:39,525 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 245 transitions. Word has length 57 [2023-12-20 00:37:39,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:37:39,525 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 245 transitions. [2023-12-20 00:37:39,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 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-20 00:37:39,525 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 245 transitions. [2023-12-20 00:37:39,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-20 00:37:39,526 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:37:39,527 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-20 00:37:39,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 00:37:39,527 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:37:39,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:37:39,527 INFO L85 PathProgramCache]: Analyzing trace with hash 2030424501, now seen corresponding path program 1 times [2023-12-20 00:37:39,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:37:39,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946481174] [2023-12-20 00:37:39,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:37:39,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:37:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:39,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:39,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:39,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:37:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:39,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:39,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:39,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:37:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:39,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 00:37:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:39,698 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-20 00:37:39,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:37:39,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946481174] [2023-12-20 00:37:39,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946481174] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:37:39,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:37:39,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-20 00:37:39,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550886503] [2023-12-20 00:37:39,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:37:39,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-20 00:37:39,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:37:39,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-20 00:37:39,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-20 00:37:39,700 INFO L87 Difference]: Start difference. First operand 176 states and 245 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 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-20 00:37:40,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:37:40,143 INFO L93 Difference]: Finished difference Result 496 states and 694 transitions. [2023-12-20 00:37:40,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-20 00:37:40,143 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 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 57 [2023-12-20 00:37:40,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:37:40,148 INFO L225 Difference]: With dead ends: 496 [2023-12-20 00:37:40,149 INFO L226 Difference]: Without dead ends: 334 [2023-12-20 00:37:40,153 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-20 00:37:40,156 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 338 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 00:37:40,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 579 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 00:37:40,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2023-12-20 00:37:40,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 264. [2023-12-20 00:37:40,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 202 states have (on average 1.4207920792079207) internal successors, (287), 208 states have internal predecessors, (287), 36 states have call successors, (36), 22 states have call predecessors, (36), 25 states have return successors, (47), 36 states have call predecessors, (47), 34 states have call successors, (47) [2023-12-20 00:37:40,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 370 transitions. [2023-12-20 00:37:40,194 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 370 transitions. Word has length 57 [2023-12-20 00:37:40,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:37:40,194 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 370 transitions. [2023-12-20 00:37:40,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 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-20 00:37:40,194 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 370 transitions. [2023-12-20 00:37:40,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-20 00:37:40,199 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:37:40,199 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-20 00:37:40,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 00:37:40,200 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:37:40,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:37:40,201 INFO L85 PathProgramCache]: Analyzing trace with hash -336270093, now seen corresponding path program 1 times [2023-12-20 00:37:40,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:37:40,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910796023] [2023-12-20 00:37:40,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:37:40,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:37:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:40,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:40,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:40,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:37:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:40,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:40,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:40,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:40,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:37:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:40,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 00:37:40,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:40,321 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-20 00:37:40,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:37:40,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910796023] [2023-12-20 00:37:40,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910796023] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:37:40,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:37:40,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-20 00:37:40,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891483600] [2023-12-20 00:37:40,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:37:40,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-20 00:37:40,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:37:40,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-20 00:37:40,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-20 00:37:40,323 INFO L87 Difference]: Start difference. First operand 264 states and 370 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-20 00:37:40,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:37:40,569 INFO L93 Difference]: Finished difference Result 540 states and 759 transitions. [2023-12-20 00:37:40,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-20 00:37:40,570 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-20 00:37:40,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:37:40,572 INFO L225 Difference]: With dead ends: 540 [2023-12-20 00:37:40,572 INFO L226 Difference]: Without dead ends: 296 [2023-12-20 00:37:40,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-12-20 00:37:40,578 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 156 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 00:37:40,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 379 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 00:37:40,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2023-12-20 00:37:40,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 268. [2023-12-20 00:37:40,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 205 states have (on average 1.4048780487804877) internal successors, (288), 211 states have internal predecessors, (288), 36 states have call successors, (36), 22 states have call predecessors, (36), 26 states have return successors, (48), 37 states have call predecessors, (48), 34 states have call successors, (48) [2023-12-20 00:37:40,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 372 transitions. [2023-12-20 00:37:40,604 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 372 transitions. Word has length 57 [2023-12-20 00:37:40,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:37:40,605 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 372 transitions. [2023-12-20 00:37:40,605 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-20 00:37:40,606 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 372 transitions. [2023-12-20 00:37:40,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-20 00:37:40,607 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:37:40,607 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-20 00:37:40,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-20 00:37:40,607 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:37:40,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:37:40,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1714713905, now seen corresponding path program 1 times [2023-12-20 00:37:40,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:37:40,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774739544] [2023-12-20 00:37:40,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:37:40,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:37:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:40,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:40,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:40,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:40,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:37:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:40,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:40,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:40,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:37:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:40,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 00:37:40,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:40,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-20 00:37:40,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:37:40,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774739544] [2023-12-20 00:37:40,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774739544] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:37:40,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:37:40,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 00:37:40,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112937606] [2023-12-20 00:37:40,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:37:40,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 00:37:40,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:37:40,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 00:37:40,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-20 00:37:40,721 INFO L87 Difference]: Start difference. First operand 268 states and 372 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-20 00:37:41,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:37:41,030 INFO L93 Difference]: Finished difference Result 804 states and 1105 transitions. [2023-12-20 00:37:41,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-20 00:37:41,030 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 57 [2023-12-20 00:37:41,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:37:41,034 INFO L225 Difference]: With dead ends: 804 [2023-12-20 00:37:41,034 INFO L226 Difference]: Without dead ends: 556 [2023-12-20 00:37:41,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2023-12-20 00:37:41,036 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 466 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 00:37:41,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 335 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 00:37:41,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2023-12-20 00:37:41,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 485. [2023-12-20 00:37:41,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 372 states have (on average 1.3736559139784945) internal successors, (511), 382 states have internal predecessors, (511), 60 states have call successors, (60), 43 states have call predecessors, (60), 52 states have return successors, (81), 62 states have call predecessors, (81), 58 states have call successors, (81) [2023-12-20 00:37:41,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 652 transitions. [2023-12-20 00:37:41,077 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 652 transitions. Word has length 57 [2023-12-20 00:37:41,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:37:41,077 INFO L495 AbstractCegarLoop]: Abstraction has 485 states and 652 transitions. [2023-12-20 00:37:41,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-20 00:37:41,078 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 652 transitions. [2023-12-20 00:37:41,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-20 00:37:41,088 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:37:41,088 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-20 00:37:41,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-20 00:37:41,089 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:37:41,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:37:41,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1503158972, now seen corresponding path program 1 times [2023-12-20 00:37:41,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:37:41,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330555505] [2023-12-20 00:37:41,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:37:41,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:37:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:41,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:41,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:41,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:41,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:37:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:41,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:41,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:41,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:37:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:41,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 00:37:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:41,202 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-20 00:37:41,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:37:41,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330555505] [2023-12-20 00:37:41,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330555505] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:37:41,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:37:41,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-20 00:37:41,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015178801] [2023-12-20 00:37:41,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:37:41,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-20 00:37:41,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:37:41,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-20 00:37:41,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-20 00:37:41,204 INFO L87 Difference]: Start difference. First operand 485 states and 652 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-20 00:37:41,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:37:41,500 INFO L93 Difference]: Finished difference Result 1014 states and 1363 transitions. [2023-12-20 00:37:41,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-20 00:37:41,500 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-20 00:37:41,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:37:41,502 INFO L225 Difference]: With dead ends: 1014 [2023-12-20 00:37:41,502 INFO L226 Difference]: Without dead ends: 549 [2023-12-20 00:37:41,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-12-20 00:37:41,504 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 111 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 00:37:41,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 421 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 00:37:41,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2023-12-20 00:37:41,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 497. [2023-12-20 00:37:41,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 381 states have (on average 1.356955380577428) internal successors, (517), 391 states have internal predecessors, (517), 60 states have call successors, (60), 43 states have call predecessors, (60), 55 states have return successors, (84), 65 states have call predecessors, (84), 58 states have call successors, (84) [2023-12-20 00:37:41,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 661 transitions. [2023-12-20 00:37:41,532 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 661 transitions. Word has length 58 [2023-12-20 00:37:41,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:37:41,533 INFO L495 AbstractCegarLoop]: Abstraction has 497 states and 661 transitions. [2023-12-20 00:37:41,533 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-20 00:37:41,533 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 661 transitions. [2023-12-20 00:37:41,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-20 00:37:41,534 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:37:41,534 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-20 00:37:41,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-20 00:37:41,534 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:37:41,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:37:41,534 INFO L85 PathProgramCache]: Analyzing trace with hash -868580290, now seen corresponding path program 1 times [2023-12-20 00:37:41,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:37:41,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651150003] [2023-12-20 00:37:41,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:37:41,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:37:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:41,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:41,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:41,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:37:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:41,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:41,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:41,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:37:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:41,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 00:37:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:41,631 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-20 00:37:41,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:37:41,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651150003] [2023-12-20 00:37:41,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651150003] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:37:41,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:37:41,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-20 00:37:41,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969697290] [2023-12-20 00:37:41,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:37:41,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-20 00:37:41,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:37:41,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-20 00:37:41,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-20 00:37:41,632 INFO L87 Difference]: Start difference. First operand 497 states and 661 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-20 00:37:42,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:37:42,058 INFO L93 Difference]: Finished difference Result 1071 states and 1388 transitions. [2023-12-20 00:37:42,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-20 00:37:42,058 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-20 00:37:42,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:37:42,061 INFO L225 Difference]: With dead ends: 1071 [2023-12-20 00:37:42,061 INFO L226 Difference]: Without dead ends: 664 [2023-12-20 00:37:42,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2023-12-20 00:37:42,063 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 302 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 00:37:42,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 339 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 00:37:42,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2023-12-20 00:37:42,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 505. [2023-12-20 00:37:42,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 388 states have (on average 1.347938144329897) internal successors, (523), 397 states have internal predecessors, (523), 61 states have call successors, (61), 44 states have call predecessors, (61), 55 states have return successors, (81), 66 states have call predecessors, (81), 59 states have call successors, (81) [2023-12-20 00:37:42,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 665 transitions. [2023-12-20 00:37:42,087 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 665 transitions. Word has length 58 [2023-12-20 00:37:42,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:37:42,089 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 665 transitions. [2023-12-20 00:37:42,089 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-20 00:37:42,089 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 665 transitions. [2023-12-20 00:37:42,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-20 00:37:42,089 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:37:42,090 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-20 00:37:42,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-20 00:37:42,090 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:37:42,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:37:42,090 INFO L85 PathProgramCache]: Analyzing trace with hash -649725572, now seen corresponding path program 1 times [2023-12-20 00:37:42,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:37:42,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012277302] [2023-12-20 00:37:42,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:37:42,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:37:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:42,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:42,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:42,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:42,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:42,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:37:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:42,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:42,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:42,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:42,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:37:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:42,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 00:37:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:42,156 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-20 00:37:42,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:37:42,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012277302] [2023-12-20 00:37:42,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012277302] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:37:42,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:37:42,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 00:37:42,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941254466] [2023-12-20 00:37:42,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:37:42,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 00:37:42,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:37:42,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 00:37:42,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-20 00:37:42,157 INFO L87 Difference]: Start difference. First operand 505 states and 665 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-20 00:37:42,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:37:42,442 INFO L93 Difference]: Finished difference Result 1536 states and 2010 transitions. [2023-12-20 00:37:42,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-20 00:37:42,443 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-20 00:37:42,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:37:42,446 INFO L225 Difference]: With dead ends: 1536 [2023-12-20 00:37:42,446 INFO L226 Difference]: Without dead ends: 1054 [2023-12-20 00:37:42,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2023-12-20 00:37:42,448 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 276 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 00:37:42,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 271 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 00:37:42,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2023-12-20 00:37:42,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 962. [2023-12-20 00:37:42,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 728 states have (on average 1.3104395604395604) internal successors, (954), 748 states have internal predecessors, (954), 121 states have call successors, (121), 87 states have call predecessors, (121), 112 states have return successors, (177), 132 states have call predecessors, (177), 119 states have call successors, (177) [2023-12-20 00:37:42,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1252 transitions. [2023-12-20 00:37:42,492 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1252 transitions. Word has length 58 [2023-12-20 00:37:42,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:37:42,492 INFO L495 AbstractCegarLoop]: Abstraction has 962 states and 1252 transitions. [2023-12-20 00:37:42,492 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-20 00:37:42,492 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1252 transitions. [2023-12-20 00:37:42,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-20 00:37:42,493 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:37:42,493 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-20 00:37:42,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-20 00:37:42,493 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:37:42,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:37:42,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2016957774, now seen corresponding path program 1 times [2023-12-20 00:37:42,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:37:42,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59691803] [2023-12-20 00:37:42,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:37:42,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:37:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:42,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:42,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:42,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:42,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:37:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:42,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:42,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:42,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:37:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:42,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 00:37:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:42,553 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-20 00:37:42,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:37:42,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59691803] [2023-12-20 00:37:42,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59691803] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:37:42,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:37:42,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-20 00:37:42,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812391238] [2023-12-20 00:37:42,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:37:42,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 00:37:42,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:37:42,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 00:37:42,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-20 00:37:42,555 INFO L87 Difference]: Start difference. First operand 962 states and 1252 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-20 00:37:42,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:37:42,810 INFO L93 Difference]: Finished difference Result 2922 states and 3799 transitions. [2023-12-20 00:37:42,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-20 00:37:42,811 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-20 00:37:42,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:37:42,817 INFO L225 Difference]: With dead ends: 2922 [2023-12-20 00:37:42,817 INFO L226 Difference]: Without dead ends: 1962 [2023-12-20 00:37:42,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-12-20 00:37:42,821 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 283 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 00:37:42,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 222 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 00:37:42,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2023-12-20 00:37:42,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1778. [2023-12-20 00:37:42,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1778 states, 1346 states have (on average 1.2942050520059436) internal successors, (1742), 1372 states have internal predecessors, (1742), 215 states have call successors, (215), 173 states have call predecessors, (215), 216 states have return successors, (315), 238 states have call predecessors, (315), 213 states have call successors, (315) [2023-12-20 00:37:42,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 2272 transitions. [2023-12-20 00:37:42,895 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 2272 transitions. Word has length 59 [2023-12-20 00:37:42,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:37:42,895 INFO L495 AbstractCegarLoop]: Abstraction has 1778 states and 2272 transitions. [2023-12-20 00:37:42,895 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-20 00:37:42,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 2272 transitions. [2023-12-20 00:37:42,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-20 00:37:42,897 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:37:42,897 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, 1, 1, 1, 1, 1, 1] [2023-12-20 00:37:42,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-20 00:37:42,897 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:37:42,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:37:42,898 INFO L85 PathProgramCache]: Analyzing trace with hash -321283507, now seen corresponding path program 1 times [2023-12-20 00:37:42,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:37:42,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38150017] [2023-12-20 00:37:42,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:37:42,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:37:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:42,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:42,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:42,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:37:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:42,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:42,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:42,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:42,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:37:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:42,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 00:37:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:42,942 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-20 00:37:42,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:37:42,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38150017] [2023-12-20 00:37:42,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38150017] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:37:42,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:37:42,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-20 00:37:42,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318949037] [2023-12-20 00:37:42,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:37:42,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 00:37:42,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:37:42,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 00:37:42,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-20 00:37:42,943 INFO L87 Difference]: Start difference. First operand 1778 states and 2272 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 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-20 00:37:43,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:37:43,210 INFO L93 Difference]: Finished difference Result 4442 states and 5658 transitions. [2023-12-20 00:37:43,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-20 00:37:43,210 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 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 65 [2023-12-20 00:37:43,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:37:43,218 INFO L225 Difference]: With dead ends: 4442 [2023-12-20 00:37:43,218 INFO L226 Difference]: Without dead ends: 2686 [2023-12-20 00:37:43,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-12-20 00:37:43,221 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 346 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 00:37:43,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 218 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 00:37:43,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2023-12-20 00:37:43,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 2444. [2023-12-20 00:37:43,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2444 states, 1848 states have (on average 1.2846320346320346) internal successors, (2374), 1882 states have internal predecessors, (2374), 295 states have call successors, (295), 243 states have call predecessors, (295), 300 states have return successors, (424), 324 states have call predecessors, (424), 293 states have call successors, (424) [2023-12-20 00:37:43,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2444 states and 3093 transitions. [2023-12-20 00:37:43,317 INFO L78 Accepts]: Start accepts. Automaton has 2444 states and 3093 transitions. Word has length 65 [2023-12-20 00:37:43,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:37:43,318 INFO L495 AbstractCegarLoop]: Abstraction has 2444 states and 3093 transitions. [2023-12-20 00:37:43,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 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-20 00:37:43,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 3093 transitions. [2023-12-20 00:37:43,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-20 00:37:43,320 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:37:43,320 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:37:43,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-20 00:37:43,320 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:37:43,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:37:43,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1885701990, now seen corresponding path program 1 times [2023-12-20 00:37:43,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:37:43,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468734424] [2023-12-20 00:37:43,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:37:43,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:37:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:43,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:43,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:43,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:37:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:43,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:43,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:43,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:37:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:43,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 00:37:43,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:43,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 00:37:43,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:37:43,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468734424] [2023-12-20 00:37:43,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468734424] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:37:43,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:37:43,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 00:37:43,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115188340] [2023-12-20 00:37:43,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:37:43,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 00:37:43,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:37:43,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 00:37:43,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-20 00:37:43,375 INFO L87 Difference]: Start difference. First operand 2444 states and 3093 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-20 00:37:43,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:37:43,732 INFO L93 Difference]: Finished difference Result 3164 states and 3964 transitions. [2023-12-20 00:37:43,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-20 00:37:43,732 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 66 [2023-12-20 00:37:43,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:37:43,742 INFO L225 Difference]: With dead ends: 3164 [2023-12-20 00:37:43,742 INFO L226 Difference]: Without dead ends: 3161 [2023-12-20 00:37:43,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2023-12-20 00:37:43,743 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 438 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 00:37:43,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 242 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 00:37:43,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3161 states. [2023-12-20 00:37:43,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3161 to 2894. [2023-12-20 00:37:43,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2894 states, 2189 states have (on average 1.277295568752855) internal successors, (2796), 2228 states have internal predecessors, (2796), 345 states have call successors, (345), 287 states have call predecessors, (345), 359 states have return successors, (503), 384 states have call predecessors, (503), 344 states have call successors, (503) [2023-12-20 00:37:43,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2894 states to 2894 states and 3644 transitions. [2023-12-20 00:37:43,867 INFO L78 Accepts]: Start accepts. Automaton has 2894 states and 3644 transitions. Word has length 66 [2023-12-20 00:37:43,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:37:43,867 INFO L495 AbstractCegarLoop]: Abstraction has 2894 states and 3644 transitions. [2023-12-20 00:37:43,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-20 00:37:43,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2894 states and 3644 transitions. [2023-12-20 00:37:43,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-20 00:37:43,868 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:37:43,868 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:37:43,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-20 00:37:43,869 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:37:43,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:37:43,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1672428599, now seen corresponding path program 1 times [2023-12-20 00:37:43,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:37:43,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676955324] [2023-12-20 00:37:43,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:37:43,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:37:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:43,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:43,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:43,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:43,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:37:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:43,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:43,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:43,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:37:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:43,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 00:37:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:43,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 00:37:43,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:37:43,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676955324] [2023-12-20 00:37:43,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676955324] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:37:43,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342201059] [2023-12-20 00:37:43,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:37:43,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:37:43,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:37:43,977 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:37:43,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-20 00:37:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:44,042 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-20 00:37:44,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:37:44,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 00:37:44,210 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 00:37:44,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 00:37:44,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342201059] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 00:37:44,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 00:37:44,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 10 [2023-12-20 00:37:44,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882916953] [2023-12-20 00:37:44,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 00:37:44,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-20 00:37:44,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:37:44,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-20 00:37:44,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-20 00:37:44,276 INFO L87 Difference]: Start difference. First operand 2894 states and 3644 transitions. Second operand has 10 states, 10 states have (on average 10.8) internal successors, (108), 7 states have internal predecessors, (108), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-12-20 00:37:45,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:37:45,220 INFO L93 Difference]: Finished difference Result 6961 states and 8720 transitions. [2023-12-20 00:37:45,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-20 00:37:45,220 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 7 states have internal predecessors, (108), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 67 [2023-12-20 00:37:45,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:37:45,242 INFO L225 Difference]: With dead ends: 6961 [2023-12-20 00:37:45,242 INFO L226 Difference]: Without dead ends: 6958 [2023-12-20 00:37:45,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2023-12-20 00:37:45,246 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 865 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-20 00:37:45,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 631 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-20 00:37:45,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6958 states. [2023-12-20 00:37:45,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6958 to 4520. [2023-12-20 00:37:45,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4520 states, 3429 states have (on average 1.2820064158646836) internal successors, (4396), 3490 states have internal predecessors, (4396), 529 states have call successors, (529), 445 states have call predecessors, (529), 561 states have return successors, (781), 590 states have call predecessors, (781), 528 states have call successors, (781) [2023-12-20 00:37:45,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4520 states to 4520 states and 5706 transitions. [2023-12-20 00:37:45,509 INFO L78 Accepts]: Start accepts. Automaton has 4520 states and 5706 transitions. Word has length 67 [2023-12-20 00:37:45,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:37:45,509 INFO L495 AbstractCegarLoop]: Abstraction has 4520 states and 5706 transitions. [2023-12-20 00:37:45,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 7 states have internal predecessors, (108), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-12-20 00:37:45,509 INFO L276 IsEmpty]: Start isEmpty. Operand 4520 states and 5706 transitions. [2023-12-20 00:37:45,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-20 00:37:45,511 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:37:45,511 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:37:45,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-20 00:37:45,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-20 00:37:45,717 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:37:45,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:37:45,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1152070234, now seen corresponding path program 2 times [2023-12-20 00:37:45,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:37:45,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918425360] [2023-12-20 00:37:45,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:37:45,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:37:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:45,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:45,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:45,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:37:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:45,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:45,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:45,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:37:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:45,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 00:37:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:45,754 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 00:37:45,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:37:45,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918425360] [2023-12-20 00:37:45,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918425360] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:37:45,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:37:45,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-20 00:37:45,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978171783] [2023-12-20 00:37:45,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:37:45,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 00:37:45,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:37:45,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 00:37:45,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-20 00:37:45,755 INFO L87 Difference]: Start difference. First operand 4520 states and 5706 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-20 00:37:46,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:37:46,122 INFO L93 Difference]: Finished difference Result 6976 states and 8835 transitions. [2023-12-20 00:37:46,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-20 00:37:46,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 70 [2023-12-20 00:37:46,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:37:46,132 INFO L225 Difference]: With dead ends: 6976 [2023-12-20 00:37:46,132 INFO L226 Difference]: Without dead ends: 3273 [2023-12-20 00:37:46,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-20 00:37:46,137 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 197 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 00:37:46,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 336 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 00:37:46,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3273 states. [2023-12-20 00:37:46,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3273 to 3044. [2023-12-20 00:37:46,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3044 states, 2309 states have (on average 1.2559549588566479) internal successors, (2900), 2348 states have internal predecessors, (2900), 361 states have call successors, (361), 301 states have call predecessors, (361), 373 states have return successors, (507), 400 states have call predecessors, (507), 360 states have call successors, (507) [2023-12-20 00:37:46,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3044 states to 3044 states and 3768 transitions. [2023-12-20 00:37:46,306 INFO L78 Accepts]: Start accepts. Automaton has 3044 states and 3768 transitions. Word has length 70 [2023-12-20 00:37:46,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:37:46,306 INFO L495 AbstractCegarLoop]: Abstraction has 3044 states and 3768 transitions. [2023-12-20 00:37:46,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-20 00:37:46,306 INFO L276 IsEmpty]: Start isEmpty. Operand 3044 states and 3768 transitions. [2023-12-20 00:37:46,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-20 00:37:46,308 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:37:46,308 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:37:46,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-20 00:37:46,308 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:37:46,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:37:46,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1706112077, now seen corresponding path program 1 times [2023-12-20 00:37:46,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:37:46,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038604727] [2023-12-20 00:37:46,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:37:46,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:37:46,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:46,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:46,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:46,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:37:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:46,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:46,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:46,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:46,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:37:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:46,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 00:37:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:46,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 00:37:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:46,376 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-20 00:37:46,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:37:46,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038604727] [2023-12-20 00:37:46,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038604727] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:37:46,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:37:46,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-20 00:37:46,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384275700] [2023-12-20 00:37:46,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:37:46,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-20 00:37:46,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:37:46,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-20 00:37:46,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-20 00:37:46,378 INFO L87 Difference]: Start difference. First operand 3044 states and 3768 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 5 states have internal predecessors, (55), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-20 00:37:47,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:37:47,088 INFO L93 Difference]: Finished difference Result 9326 states and 11551 transitions. [2023-12-20 00:37:47,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-20 00:37:47,088 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 5 states have internal predecessors, (55), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 75 [2023-12-20 00:37:47,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:37:47,102 INFO L225 Difference]: With dead ends: 9326 [2023-12-20 00:37:47,103 INFO L226 Difference]: Without dead ends: 5105 [2023-12-20 00:37:47,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2023-12-20 00:37:47,109 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 487 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 00:37:47,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 432 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 00:37:47,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5105 states. [2023-12-20 00:37:47,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5105 to 4785. [2023-12-20 00:37:47,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4785 states, 3593 states have (on average 1.239354300027832) internal successors, (4453), 3675 states have internal predecessors, (4453), 565 states have call successors, (565), 475 states have call predecessors, (565), 626 states have return successors, (889), 640 states have call predecessors, (889), 564 states have call successors, (889) [2023-12-20 00:37:47,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4785 states to 4785 states and 5907 transitions. [2023-12-20 00:37:47,348 INFO L78 Accepts]: Start accepts. Automaton has 4785 states and 5907 transitions. Word has length 75 [2023-12-20 00:37:47,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:37:47,349 INFO L495 AbstractCegarLoop]: Abstraction has 4785 states and 5907 transitions. [2023-12-20 00:37:47,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 5 states have internal predecessors, (55), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-20 00:37:47,349 INFO L276 IsEmpty]: Start isEmpty. Operand 4785 states and 5907 transitions. [2023-12-20 00:37:47,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-20 00:37:47,351 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:37:47,351 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:37:47,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-20 00:37:47,351 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:37:47,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:37:47,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1385832991, now seen corresponding path program 1 times [2023-12-20 00:37:47,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:37:47,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214242814] [2023-12-20 00:37:47,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:37:47,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:37:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:47,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:47,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:47,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:37:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:47,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:47,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:47,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:37:47,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:47,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 00:37:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:47,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-20 00:37:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:47,428 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-20 00:37:47,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:37:47,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214242814] [2023-12-20 00:37:47,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214242814] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:37:47,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:37:47,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-20 00:37:47,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955048800] [2023-12-20 00:37:47,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:37:47,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-20 00:37:47,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:37:47,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-20 00:37:47,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-20 00:37:47,430 INFO L87 Difference]: Start difference. First operand 4785 states and 5907 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 6 states have internal predecessors, (66), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-20 00:37:48,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:37:48,194 INFO L93 Difference]: Finished difference Result 8456 states and 10398 transitions. [2023-12-20 00:37:48,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-20 00:37:48,194 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 6 states have internal predecessors, (66), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 85 [2023-12-20 00:37:48,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:37:48,204 INFO L225 Difference]: With dead ends: 8456 [2023-12-20 00:37:48,204 INFO L226 Difference]: Without dead ends: 4276 [2023-12-20 00:37:48,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2023-12-20 00:37:48,209 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 983 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-20 00:37:48,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 444 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-20 00:37:48,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2023-12-20 00:37:48,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 3942. [2023-12-20 00:37:48,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3942 states, 2963 states have (on average 1.2274721565980424) internal successors, (3637), 3027 states have internal predecessors, (3637), 466 states have call successors, (466), 390 states have call predecessors, (466), 512 states have return successors, (667), 530 states have call predecessors, (667), 465 states have call successors, (667) [2023-12-20 00:37:48,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3942 states to 3942 states and 4770 transitions. [2023-12-20 00:37:48,388 INFO L78 Accepts]: Start accepts. Automaton has 3942 states and 4770 transitions. Word has length 85 [2023-12-20 00:37:48,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:37:48,388 INFO L495 AbstractCegarLoop]: Abstraction has 3942 states and 4770 transitions. [2023-12-20 00:37:48,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 6 states have internal predecessors, (66), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-20 00:37:48,389 INFO L276 IsEmpty]: Start isEmpty. Operand 3942 states and 4770 transitions. [2023-12-20 00:37:48,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-20 00:37:48,392 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:37:48,392 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:37:48,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-20 00:37:48,393 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:37:48,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:37:48,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1071877003, now seen corresponding path program 1 times [2023-12-20 00:37:48,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:37:48,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939619196] [2023-12-20 00:37:48,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:37:48,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:37:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:48,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:48,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:48,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:37:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:48,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:48,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:48,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:48,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:37:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:48,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 00:37:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:48,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 00:37:48,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:48,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-20 00:37:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:48,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-20 00:37:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:48,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-20 00:37:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:48,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:48,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:48,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 00:37:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:48,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 00:37:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:48,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-20 00:37:48,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:48,481 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-12-20 00:37:48,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:37:48,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939619196] [2023-12-20 00:37:48,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939619196] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:37:48,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324026823] [2023-12-20 00:37:48,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:37:48,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:37:48,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:37:48,482 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:37:48,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-20 00:37:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:48,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-20 00:37:48,562 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:37:48,589 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-20 00:37:48,589 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:37:48,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324026823] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:37:48,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:37:48,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2023-12-20 00:37:48,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488791375] [2023-12-20 00:37:48,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:37:48,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 00:37:48,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:37:48,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 00:37:48,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-12-20 00:37:48,599 INFO L87 Difference]: Start difference. First operand 3942 states and 4770 transitions. Second operand has 6 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-20 00:37:48,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:37:48,734 INFO L93 Difference]: Finished difference Result 5914 states and 7182 transitions. [2023-12-20 00:37:48,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-20 00:37:48,735 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 130 [2023-12-20 00:37:48,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:37:48,740 INFO L225 Difference]: With dead ends: 5914 [2023-12-20 00:37:48,740 INFO L226 Difference]: Without dead ends: 1998 [2023-12-20 00:37:48,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-12-20 00:37:48,746 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 32 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:37:48,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 529 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:37:48,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2023-12-20 00:37:48,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1873. [2023-12-20 00:37:48,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1873 states, 1471 states have (on average 1.2107409925220938) internal successors, (1781), 1484 states have internal predecessors, (1781), 190 states have call successors, (190), 156 states have call predecessors, (190), 211 states have return successors, (274), 232 states have call predecessors, (274), 189 states have call successors, (274) [2023-12-20 00:37:48,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 2245 transitions. [2023-12-20 00:37:48,828 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 2245 transitions. Word has length 130 [2023-12-20 00:37:48,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:37:48,829 INFO L495 AbstractCegarLoop]: Abstraction has 1873 states and 2245 transitions. [2023-12-20 00:37:48,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-20 00:37:48,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2245 transitions. [2023-12-20 00:37:48,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-20 00:37:48,831 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:37:48,831 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:37:48,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-20 00:37:49,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-20 00:37:49,036 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:37:49,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:37:49,036 INFO L85 PathProgramCache]: Analyzing trace with hash -11543539, now seen corresponding path program 1 times [2023-12-20 00:37:49,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:37:49,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683066091] [2023-12-20 00:37:49,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:37:49,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:37:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:37:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:37:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 00:37:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 00:37:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 00:37:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-20 00:37:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-20 00:37:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 00:37:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 00:37:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-12-20 00:37:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,082 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-12-20 00:37:49,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:37:49,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683066091] [2023-12-20 00:37:49,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683066091] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:37:49,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:37:49,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-20 00:37:49,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642674637] [2023-12-20 00:37:49,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:37:49,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 00:37:49,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:37:49,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 00:37:49,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-20 00:37:49,083 INFO L87 Difference]: Start difference. First operand 1873 states and 2245 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-20 00:37:49,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:37:49,239 INFO L93 Difference]: Finished difference Result 1938 states and 2313 transitions. [2023-12-20 00:37:49,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 00:37:49,240 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 132 [2023-12-20 00:37:49,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:37:49,242 INFO L225 Difference]: With dead ends: 1938 [2023-12-20 00:37:49,243 INFO L226 Difference]: Without dead ends: 1536 [2023-12-20 00:37:49,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-20 00:37:49,244 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 205 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 00:37:49,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 179 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 00:37:49,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2023-12-20 00:37:49,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1474. [2023-12-20 00:37:49,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1168 states have (on average 1.216609589041096) internal successors, (1421), 1178 states have internal predecessors, (1421), 144 states have call successors, (144), 116 states have call predecessors, (144), 161 states have return successors, (210), 179 states have call predecessors, (210), 143 states have call successors, (210) [2023-12-20 00:37:49,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 1775 transitions. [2023-12-20 00:37:49,347 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 1775 transitions. Word has length 132 [2023-12-20 00:37:49,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:37:49,347 INFO L495 AbstractCegarLoop]: Abstraction has 1474 states and 1775 transitions. [2023-12-20 00:37:49,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-20 00:37:49,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 1775 transitions. [2023-12-20 00:37:49,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-20 00:37:49,350 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:37:49,350 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:37:49,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-20 00:37:49,350 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:37:49,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:37:49,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1296350980, now seen corresponding path program 1 times [2023-12-20 00:37:49,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:37:49,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442599291] [2023-12-20 00:37:49,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:37:49,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:37:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:37:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:37:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 00:37:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 00:37:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-20 00:37:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-20 00:37:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-20 00:37:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-20 00:37:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-12-20 00:37:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-12-20 00:37:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,427 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-12-20 00:37:49,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:37:49,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442599291] [2023-12-20 00:37:49,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442599291] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:37:49,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:37:49,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 00:37:49,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231717583] [2023-12-20 00:37:49,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:37:49,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 00:37:49,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:37:49,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 00:37:49,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-20 00:37:49,428 INFO L87 Difference]: Start difference. First operand 1474 states and 1775 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 4 states have internal predecessors, (84), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-20 00:37:49,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:37:49,687 INFO L93 Difference]: Finished difference Result 2821 states and 3428 transitions. [2023-12-20 00:37:49,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-20 00:37:49,688 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 4 states have internal predecessors, (84), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 144 [2023-12-20 00:37:49,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:37:49,697 INFO L225 Difference]: With dead ends: 2821 [2023-12-20 00:37:49,697 INFO L226 Difference]: Without dead ends: 1581 [2023-12-20 00:37:49,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-20 00:37:49,699 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 136 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 00:37:49,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 385 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 00:37:49,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2023-12-20 00:37:49,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1399. [2023-12-20 00:37:49,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1399 states, 1115 states have (on average 1.2161434977578476) internal successors, (1356), 1126 states have internal predecessors, (1356), 135 states have call successors, (135), 111 states have call predecessors, (135), 148 states have return successors, (194), 161 states have call predecessors, (194), 134 states have call successors, (194) [2023-12-20 00:37:49,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 1685 transitions. [2023-12-20 00:37:49,761 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 1685 transitions. Word has length 144 [2023-12-20 00:37:49,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:37:49,761 INFO L495 AbstractCegarLoop]: Abstraction has 1399 states and 1685 transitions. [2023-12-20 00:37:49,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 4 states have internal predecessors, (84), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-20 00:37:49,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1685 transitions. [2023-12-20 00:37:49,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-20 00:37:49,763 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:37:49,763 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:37:49,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-20 00:37:49,763 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:37:49,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:37:49,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1858663312, now seen corresponding path program 1 times [2023-12-20 00:37:49,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:37:49,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205508982] [2023-12-20 00:37:49,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:37:49,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:37:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:37:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:37:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 00:37:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 00:37:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-20 00:37:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-20 00:37:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 00:37:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-20 00:37:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-20 00:37:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-20 00:37:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:49,918 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-12-20 00:37:49,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:37:49,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205508982] [2023-12-20 00:37:49,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205508982] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:37:49,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293017629] [2023-12-20 00:37:49,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:37:49,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:37:49,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:37:49,920 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:37:49,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-20 00:37:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:50,002 INFO L262 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-20 00:37:50,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:37:50,117 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-20 00:37:50,117 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 00:37:50,268 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-12-20 00:37:50,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293017629] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 00:37:50,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 00:37:50,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 5] total 14 [2023-12-20 00:37:50,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401550100] [2023-12-20 00:37:50,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 00:37:50,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-20 00:37:50,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:37:50,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-20 00:37:50,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2023-12-20 00:37:50,270 INFO L87 Difference]: Start difference. First operand 1399 states and 1685 transitions. Second operand has 14 states, 14 states have (on average 15.928571428571429) internal successors, (223), 12 states have internal predecessors, (223), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2023-12-20 00:37:50,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:37:50,868 INFO L93 Difference]: Finished difference Result 3206 states and 3967 transitions. [2023-12-20 00:37:50,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-20 00:37:50,868 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 15.928571428571429) internal successors, (223), 12 states have internal predecessors, (223), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 146 [2023-12-20 00:37:50,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:37:50,872 INFO L225 Difference]: With dead ends: 3206 [2023-12-20 00:37:50,873 INFO L226 Difference]: Without dead ends: 1904 [2023-12-20 00:37:50,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 324 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2023-12-20 00:37:50,875 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 818 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-20 00:37:50,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 288 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-20 00:37:50,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2023-12-20 00:37:50,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1760. [2023-12-20 00:37:50,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1364 states have (on average 1.1979472140762464) internal successors, (1634), 1383 states have internal predecessors, (1634), 189 states have call successors, (189), 161 states have call predecessors, (189), 206 states have return successors, (308), 215 states have call predecessors, (308), 188 states have call successors, (308) [2023-12-20 00:37:50,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2131 transitions. [2023-12-20 00:37:50,969 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2131 transitions. Word has length 146 [2023-12-20 00:37:50,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:37:50,969 INFO L495 AbstractCegarLoop]: Abstraction has 1760 states and 2131 transitions. [2023-12-20 00:37:50,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.928571428571429) internal successors, (223), 12 states have internal predecessors, (223), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2023-12-20 00:37:50,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2131 transitions. [2023-12-20 00:37:50,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-12-20 00:37:50,971 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:37:50,971 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:37:50,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-20 00:37:51,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:37:51,177 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:37:51,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:37:51,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1899535245, now seen corresponding path program 1 times [2023-12-20 00:37:51,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:37:51,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276069311] [2023-12-20 00:37:51,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:37:51,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:37:51,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-20 00:37:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:37:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 00:37:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-20 00:37:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-20 00:37:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-20 00:37:51,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-20 00:37:51,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 00:37:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-12-20 00:37:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-20 00:37:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-12-20 00:37:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-20 00:37:51,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,253 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2023-12-20 00:37:51,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:37:51,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276069311] [2023-12-20 00:37:51,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276069311] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:37:51,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115164779] [2023-12-20 00:37:51,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:37:51,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:37:51,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:37:51,254 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:37:51,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-20 00:37:51,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,331 INFO L262 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-20 00:37:51,333 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:37:51,356 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2023-12-20 00:37:51,356 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:37:51,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115164779] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:37:51,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:37:51,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2023-12-20 00:37:51,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666330304] [2023-12-20 00:37:51,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:37:51,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 00:37:51,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:37:51,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 00:37:51,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-20 00:37:51,357 INFO L87 Difference]: Start difference. First operand 1760 states and 2131 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-20 00:37:51,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:37:51,529 INFO L93 Difference]: Finished difference Result 3428 states and 4169 transitions. [2023-12-20 00:37:51,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-20 00:37:51,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 161 [2023-12-20 00:37:51,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:37:51,532 INFO L225 Difference]: With dead ends: 3428 [2023-12-20 00:37:51,532 INFO L226 Difference]: Without dead ends: 1494 [2023-12-20 00:37:51,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2023-12-20 00:37:51,536 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 142 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 00:37:51,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 206 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 00:37:51,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2023-12-20 00:37:51,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1456. [2023-12-20 00:37:51,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1456 states, 1137 states have (on average 1.187335092348285) internal successors, (1350), 1149 states have internal predecessors, (1350), 154 states have call successors, (154), 130 states have call predecessors, (154), 164 states have return successors, (234), 176 states have call predecessors, (234), 153 states have call successors, (234) [2023-12-20 00:37:51,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 1738 transitions. [2023-12-20 00:37:51,629 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 1738 transitions. Word has length 161 [2023-12-20 00:37:51,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:37:51,629 INFO L495 AbstractCegarLoop]: Abstraction has 1456 states and 1738 transitions. [2023-12-20 00:37:51,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-20 00:37:51,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 1738 transitions. [2023-12-20 00:37:51,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2023-12-20 00:37:51,632 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:37:51,632 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:37:51,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-20 00:37:51,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:37:51,838 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:37:51,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:37:51,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1819492835, now seen corresponding path program 1 times [2023-12-20 00:37:51,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:37:51,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229297136] [2023-12-20 00:37:51,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:37:51,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:37:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:51,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:37:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:37:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 00:37:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 00:37:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-20 00:37:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-20 00:37:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 00:37:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-20 00:37:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-20 00:37:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-20 00:37:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-12-20 00:37:51,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2023-12-20 00:37:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2023-12-20 00:37:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2023-12-20 00:37:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2023-12-20 00:37:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-20 00:37:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2023-12-20 00:37:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:51,942 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 67 proven. 6 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2023-12-20 00:37:51,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:37:51,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229297136] [2023-12-20 00:37:51,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229297136] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:37:51,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987624548] [2023-12-20 00:37:51,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:37:51,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:37:51,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:37:51,943 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:37:51,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-20 00:37:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:52,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 00:37:52,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:37:52,081 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2023-12-20 00:37:52,081 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:37:52,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987624548] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:37:52,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:37:52,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 7 [2023-12-20 00:37:52,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626959731] [2023-12-20 00:37:52,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:37:52,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 00:37:52,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:37:52,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 00:37:52,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-20 00:37:52,083 INFO L87 Difference]: Start difference. First operand 1456 states and 1738 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2023-12-20 00:37:52,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:37:52,160 INFO L93 Difference]: Finished difference Result 2799 states and 3391 transitions. [2023-12-20 00:37:52,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 00:37:52,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 228 [2023-12-20 00:37:52,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:37:52,163 INFO L225 Difference]: With dead ends: 2799 [2023-12-20 00:37:52,163 INFO L226 Difference]: Without dead ends: 1431 [2023-12-20 00:37:52,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-20 00:37:52,166 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 65 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:37:52,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 220 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:37:52,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2023-12-20 00:37:52,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1426. [2023-12-20 00:37:52,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1111 states have (on average 1.171917191719172) internal successors, (1302), 1123 states have internal predecessors, (1302), 154 states have call successors, (154), 130 states have call predecessors, (154), 160 states have return successors, (230), 172 states have call predecessors, (230), 153 states have call successors, (230) [2023-12-20 00:37:52,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 1686 transitions. [2023-12-20 00:37:52,241 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 1686 transitions. Word has length 228 [2023-12-20 00:37:52,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:37:52,242 INFO L495 AbstractCegarLoop]: Abstraction has 1426 states and 1686 transitions. [2023-12-20 00:37:52,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2023-12-20 00:37:52,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 1686 transitions. [2023-12-20 00:37:52,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-12-20 00:37:52,244 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:37:52,245 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:37:52,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-20 00:37:52,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:37:52,453 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:37:52,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:37:52,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1143729042, now seen corresponding path program 1 times [2023-12-20 00:37:52,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:37:52,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351702128] [2023-12-20 00:37:52,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:37:52,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:37:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:52,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:52,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:52,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:37:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:52,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:52,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:52,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:52,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:37:52,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:52,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 00:37:52,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:52,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 00:37:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:52,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-20 00:37:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:52,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-20 00:37:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:52,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 00:37:52,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:52,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:52,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:52,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-20 00:37:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:52,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 00:37:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:52,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 00:37:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:52,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-20 00:37:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:52,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-12-20 00:37:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:52,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-12-20 00:37:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:52,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-12-20 00:37:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:52,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:37:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:52,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 00:37:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:52,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-12-20 00:37:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:52,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-12-20 00:37:52,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:52,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2023-12-20 00:37:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:52,556 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 72 proven. 15 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2023-12-20 00:37:52,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:37:52,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351702128] [2023-12-20 00:37:52,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351702128] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:37:52,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135847331] [2023-12-20 00:37:52,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:37:52,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:37:52,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:37:52,557 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:37:52,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-20 00:37:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:37:52,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 704 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-20 00:37:52,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:37:52,732 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 229 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-20 00:37:52,732 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 00:37:52,852 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 102 proven. 7 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2023-12-20 00:37:52,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135847331] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 00:37:52,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 00:37:52,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2023-12-20 00:37:52,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17437203] [2023-12-20 00:37:52,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 00:37:52,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-20 00:37:52,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:37:52,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-20 00:37:52,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-12-20 00:37:52,854 INFO L87 Difference]: Start difference. First operand 1426 states and 1686 transitions. Second operand has 11 states, 11 states have (on average 18.727272727272727) internal successors, (206), 8 states have internal predecessors, (206), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2023-12-20 00:37:53,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:37:53,282 INFO L93 Difference]: Finished difference Result 1757 states and 2058 transitions. [2023-12-20 00:37:53,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-20 00:37:53,283 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 18.727272727272727) internal successors, (206), 8 states have internal predecessors, (206), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) Word has length 229 [2023-12-20 00:37:53,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:37:53,283 INFO L225 Difference]: With dead ends: 1757 [2023-12-20 00:37:53,283 INFO L226 Difference]: Without dead ends: 0 [2023-12-20 00:37:53,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 503 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2023-12-20 00:37:53,286 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 238 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 00:37:53,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 334 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 00:37:53,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-20 00:37:53,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-20 00:37:53,287 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-20 00:37:53,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-20 00:37:53,287 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 229 [2023-12-20 00:37:53,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:37:53,287 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-20 00:37:53,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.727272727272727) internal successors, (206), 8 states have internal predecessors, (206), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2023-12-20 00:37:53,288 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-20 00:37:53,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-20 00:37:53,289 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 00:37:53,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-20 00:37:53,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:37:53,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-20 00:38:01,104 WARN L293 SmtUtils]: Spent 5.72s on a formula simplification. DAG size of input: 81 DAG size of output: 38 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-20 00:38:07,877 WARN L293 SmtUtils]: Spent 6.24s on a formula simplification. DAG size of input: 85 DAG size of output: 42 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-20 00:38:14,907 INFO L899 garLoopResultBuilder]: For program point L321(line 321) no Hoare annotation was computed. [2023-12-20 00:38:14,907 INFO L899 garLoopResultBuilder]: For program point L323-2(lines 307 331) no Hoare annotation was computed. [2023-12-20 00:38:14,907 INFO L899 garLoopResultBuilder]: For program point L315(lines 315 319) no Hoare annotation was computed. [2023-12-20 00:38:14,907 INFO L895 garLoopResultBuilder]: At program point L313(line 313) the Hoare annotation is: (let ((.cse17 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse5 (not (= ~c_dr_pc~0 1))) (.cse4 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse12 (not (= ~c_dr_pc~0 0))) (.cse14 (not (= ~p_num_write~0 0))) (.cse15 (not (= ~p_dw_pc~0 0))) (.cse16 (not (= ~c_num_read~0 0))) (.cse7 (not (= ~q_free~0 1))) (.cse10 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (< 0 ~q_req_up~0)) (.cse1 (= |old(~p_dw_st~0)| 0)) (.cse2 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse17)) (.cse3 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse13 (not (= ~q_free~0 0))) (.cse6 (not (= ~p_dw_i~0 1))) (.cse8 (= |old(~c_dr_st~0)| 0)) (.cse9 (< ~q_write_ev~0 2)) (.cse18 (not (= ~q_read_ev~0 2))) (.cse19 (< ~c_dr_pc~0 1)) (.cse11 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse12 .cse2 .cse3 .cse13 .cse8 .cse11) (or .cse0 .cse12 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse14 .cse15 .cse3 .cse16 (and .cse17 (= ~p_dw_st~0 0)) .cse6 .cse7 (not .cse1) .cse18 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse13 (= ~q_write_ev~0 0) .cse5 .cse6 .cse8 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse18 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse19 .cse11) (or .cse12 .cse2 .cse14 .cse15 .cse3 .cse16 .cse7 .cse8 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse13 .cse6 .cse8 .cse9 .cse18 .cse19 .cse11)))) [2023-12-20 00:38:14,908 INFO L895 garLoopResultBuilder]: At program point L315-2(lines 315 319) the Hoare annotation is: (let ((.cse2 (= |old(~p_dw_st~0)| 0)) (.cse21 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse14 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse22 (= activate_threads_~tmp~1 0))) (let ((.cse4 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse8 (< ~q_write_ev~0 2)) (.cse11 (< ~c_dr_pc~0 1)) (.cse0 (and .cse21 .cse14 .cse22)) (.cse20 (not (= ~c_dr_pc~0 1))) (.cse17 (not (= ~c_dr_st~0 0))) (.cse15 (not (= ~q_free~0 0))) (.cse1 (< 0 ~q_req_up~0)) (.cse18 (= ~p_dw_st~0 0)) (.cse5 (not (= ~p_dw_i~0 1))) (.cse16 (not .cse2)) (.cse9 (not (= ~q_read_ev~0 2))) (.cse13 (not (= ~c_dr_pc~0 0))) (.cse19 (and .cse21 .cse14)) (.cse23 (not (= ~p_num_write~0 0))) (.cse24 (not (= ~p_dw_pc~0 0))) (.cse3 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse25 (not (= ~c_num_read~0 0))) (.cse6 (not (= ~q_free~0 1))) (.cse7 (= |old(~c_dr_st~0)| 0)) (.cse10 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse12 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse14 .cse3 .cse15 .cse7 .cse16 .cse12) (or (and (= ~q_read_ev~0 1) .cse17 .cse18) .cse1 .cse2 .cse19 .cse3 .cse4 .cse20 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12) (or .cse0 .cse1 .cse2 .cse3 .cse15 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12) (or .cse0 .cse1 .cse2 .cse3 .cse15 (= ~q_write_ev~0 0) .cse20 .cse5 .cse7 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse9 .cse12) (or (and .cse17 .cse18) .cse13 .cse19 .cse3 .cse15 .cse7 .cse12) (or .cse13 .cse3 .cse15 .cse7 (and .cse21 .cse22) .cse9 .cse12) (or .cse1 .cse13 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse23 .cse24 .cse3 .cse25 (and .cse14 .cse22 .cse18) .cse5 .cse6 .cse16 .cse9 .cse10 .cse12) (or .cse13 .cse23 .cse24 .cse3 .cse25 .cse22 .cse6 .cse7 .cse9 .cse10 .cse12) (or .cse13 .cse19 .cse23 .cse24 .cse3 .cse25 .cse6 .cse7 .cse10 .cse12)))) [2023-12-20 00:38:14,908 INFO L899 garLoopResultBuilder]: For program point L313-1(line 313) no Hoare annotation was computed. [2023-12-20 00:38:14,908 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 307 331) no Hoare annotation was computed. [2023-12-20 00:38:14,908 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 307 331) the Hoare annotation is: (let ((.cse17 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse5 (not (= ~c_dr_pc~0 1))) (.cse4 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse12 (not (= ~c_dr_pc~0 0))) (.cse14 (not (= ~p_num_write~0 0))) (.cse15 (not (= ~p_dw_pc~0 0))) (.cse16 (not (= ~c_num_read~0 0))) (.cse7 (not (= ~q_free~0 1))) (.cse10 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (< 0 ~q_req_up~0)) (.cse1 (= |old(~p_dw_st~0)| 0)) (.cse2 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse17)) (.cse3 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse13 (not (= ~q_free~0 0))) (.cse6 (not (= ~p_dw_i~0 1))) (.cse8 (= |old(~c_dr_st~0)| 0)) (.cse9 (< ~q_write_ev~0 2)) (.cse18 (not (= ~q_read_ev~0 2))) (.cse19 (< ~c_dr_pc~0 1)) (.cse11 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse12 .cse2 .cse3 .cse13 .cse8 .cse11) (or .cse0 .cse12 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse14 .cse15 .cse3 .cse16 (and .cse17 (= ~p_dw_st~0 0)) .cse6 .cse7 (not .cse1) .cse18 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse13 (= ~q_write_ev~0 0) .cse5 .cse6 .cse8 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse18 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse19 .cse11) (or .cse12 .cse2 .cse14 .cse15 .cse3 .cse16 .cse7 .cse8 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse13 .cse6 .cse8 .cse9 .cse18 .cse19 .cse11)))) [2023-12-20 00:38:14,908 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2023-12-20 00:38:14,908 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 265) no Hoare annotation was computed. [2023-12-20 00:38:14,908 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 251 270) no Hoare annotation was computed. [2023-12-20 00:38:14,908 INFO L899 garLoopResultBuilder]: For program point L267(lines 254 269) no Hoare annotation was computed. [2023-12-20 00:38:14,909 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 251 270) the Hoare annotation is: true [2023-12-20 00:38:14,909 INFO L899 garLoopResultBuilder]: For program point L259(lines 259 264) no Hoare annotation was computed. [2023-12-20 00:38:14,909 INFO L899 garLoopResultBuilder]: For program point L95(lines 83 97) no Hoare annotation was computed. [2023-12-20 00:38:14,909 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2023-12-20 00:38:14,909 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 93) no Hoare annotation was computed. [2023-12-20 00:38:14,909 INFO L899 garLoopResultBuilder]: For program point L84-2(lines 84 93) no Hoare annotation was computed. [2023-12-20 00:38:14,909 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 80 98) the Hoare annotation is: true [2023-12-20 00:38:14,909 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 80 98) no Hoare annotation was computed. [2023-12-20 00:38:14,909 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 271 288) the Hoare annotation is: (let ((.cse20 (= ~q_read_ev~0 2)) (.cse21 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse17 (< ~c_dr_pc~0 1)) (.cse10 (< |old(~q_write_ev~0)| 2)) (.cse18 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse2 (not (= ~p_num_write~0 0))) (.cse3 (not (= ~p_dw_pc~0 0))) (.cse6 (not (= ~c_num_read~0 0))) (.cse7 (not (= ~q_free~0 1))) (.cse8 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse1 (not (= ~c_dr_pc~0 0))) (.cse5 (and .cse21 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse11 (< 0 ~q_req_up~0)) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse12 (not (= ~q_free~0 0))) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (not (= |old(~q_read_ev~0)| 2))) (.cse19 (not (= ~c_dr_pc~0 1))) (.cse15 (not (= ~p_dw_i~0 1))) (.cse16 (and .cse21 .cse20)) (.cse9 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse11 .cse4 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse9) (or .cse0 .cse10 .cse11 .cse4 .cse18 .cse13 .cse14 .cse15 .cse7 .cse8 .cse16 .cse17 .cse9) (or .cse0 .cse10 .cse11 .cse4 .cse5 .cse18 .cse13 .cse19 .cse15 .cse7 .cse8 .cse9) (or (not .cse13) .cse11 (and (= ~q_write_ev~0 2) .cse20) .cse1 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse2 .cse3 .cse4 .cse6 .cse14 .cse15 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse4 .cse5 .cse12 .cse9) (or .cse0 .cse11 .cse4 .cse12 .cse13 .cse14 .cse19 .cse15 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse16 .cse9)))) [2023-12-20 00:38:14,909 INFO L899 garLoopResultBuilder]: For program point L280-1(lines 271 288) no Hoare annotation was computed. [2023-12-20 00:38:14,909 INFO L899 garLoopResultBuilder]: For program point L275-1(lines 274 287) no Hoare annotation was computed. [2023-12-20 00:38:14,909 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 271 288) no Hoare annotation was computed. [2023-12-20 00:38:14,909 INFO L899 garLoopResultBuilder]: For program point L35-2(lines 34 49) no Hoare annotation was computed. [2023-12-20 00:38:14,909 INFO L899 garLoopResultBuilder]: For program point L222-1(lines 218 232) no Hoare annotation was computed. [2023-12-20 00:38:14,909 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 218 232) no Hoare annotation was computed. [2023-12-20 00:38:14,910 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 218 232) the Hoare annotation is: (let ((.cse3 (= ~q_ev~0 |old(~q_ev~0)|)) (.cse25 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse4 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse5 (= ~q_read_ev~0 2))) (let ((.cse6 (not (= ~p_num_write~0 0))) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse9 (not (= ~c_num_read~0 0))) (.cse20 (not (= |old(~q_req_up~0)| 1))) (.cse23 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse17 (and .cse3 .cse25 .cse4 .cse5)) (.cse10 (not (= |old(~q_read_ev~0)| 2))) (.cse19 (< ~c_dr_pc~0 1)) (.cse2 (not (= ~c_dr_pc~0 0))) (.cse18 (not (= ~q_free~0 0))) (.cse0 (< 0 |old(~q_req_up~0)|)) (.cse15 (= ~c_dr_st~0 0)) (.cse16 (< |old(~q_write_ev~0)| 2)) (.cse21 (and .cse3 .cse25 (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse4)) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse24 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse1 (= ~p_dw_st~0 0)) (.cse22 (not (= ~c_dr_pc~0 1))) (.cse11 (not (= ~p_dw_i~0 1))) (.cse12 (not (= ~q_free~0 1))) (.cse13 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse14 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 (not .cse1) .cse2 (and .cse3 (= ~q_write_ev~0 2) .cse4 .cse5) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse15 .cse16 .cse17 .cse8 .cse18 .cse1 .cse10 .cse11 .cse19 .cse14) (or .cse15 .cse16 .cse20 .cse21 .cse8 .cse18 .cse1 .cse10 .cse22 .cse11 .cse23 .cse14) (or .cse15 .cse21 .cse2 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14) (or .cse15 (< |old(~q_read_ev~0)| 1) .cse16 .cse20 .cse21 .cse8 .cse24 .cse1 .cse22 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse15 .cse17 .cse8 .cse18 .cse1 .cse10 .cse22 .cse11 (= |old(~q_write_ev~0)| 0) .cse23 .cse14) (or .cse0 .cse15 .cse16 .cse17 .cse8 .cse24 .cse1 .cse10 .cse11 .cse12 .cse13 .cse19 .cse14) (or .cse15 .cse21 .cse2 .cse8 .cse18 .cse14) (or .cse0 .cse15 .cse16 .cse21 .cse8 .cse24 .cse1 .cse22 .cse11 .cse12 .cse13 .cse14)))) [2023-12-20 00:38:14,910 INFO L899 garLoopResultBuilder]: For program point L40-1(lines 40 44) no Hoare annotation was computed. [2023-12-20 00:38:14,910 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 39) no Hoare annotation was computed. [2023-12-20 00:38:14,910 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 289 306) no Hoare annotation was computed. [2023-12-20 00:38:14,910 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 289 306) the Hoare annotation is: (let ((.cse22 (= ~q_read_ev~0 2)) (.cse23 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse8 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse13 (not (= ~p_num_write~0 0))) (.cse14 (not (= ~p_dw_pc~0 0))) (.cse16 (not (= ~c_num_read~0 0))) (.cse12 (not (= ~c_dr_pc~0 0))) (.cse15 (and .cse23 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse0 (< |old(~q_write_ev~0)| 1)) (.cse3 (not (= ~q_free~0 0))) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (not (= |old(~q_read_ev~0)| 2))) (.cse9 (and .cse23 .cse22)) (.cse21 (< ~c_dr_pc~0 1)) (.cse11 (= ~c_dr_st~0 0)) (.cse19 (< |old(~q_write_ev~0)| 2)) (.cse1 (< 0 ~q_req_up~0)) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse20 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse6 (not (= ~c_dr_pc~0 1))) (.cse7 (not (= ~p_dw_i~0 1))) (.cse17 (not (= ~q_free~0 1))) (.cse18 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse10 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse12 .cse13 .cse14 .cse2 .cse15 .cse16 .cse17 .cse18 .cse10) (or .cse11 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= |old(~q_write_ev~0)| 0) .cse8 .cse9 .cse10) (or .cse11 .cse19 .cse1 .cse2 .cse20 .cse4 .cse5 .cse7 .cse17 .cse18 .cse9 .cse21 .cse10) (or .cse11 .cse19 .cse1 .cse2 .cse15 .cse20 .cse4 .cse6 .cse7 .cse17 .cse18 .cse10) (or (not .cse4) .cse1 (and (= ~q_write_ev~0 2) .cse22) .cse12 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse13 .cse14 .cse2 .cse16 .cse5 .cse7 .cse17 .cse18 .cse10) (or .cse11 .cse12 .cse2 .cse15 .cse3 .cse10) (or .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse21 .cse10) (or .cse11 (and (= ~q_read_ev~0 1) .cse23) .cse19 .cse1 .cse2 .cse20 (not (= |old(~q_read_ev~0)| 1)) .cse6 .cse7 .cse17 .cse18 .cse10)))) [2023-12-20 00:38:14,910 INFO L899 garLoopResultBuilder]: For program point L298-1(lines 289 306) no Hoare annotation was computed. [2023-12-20 00:38:14,910 INFO L899 garLoopResultBuilder]: For program point L293-1(lines 292 305) no Hoare annotation was computed. [2023-12-20 00:38:14,910 INFO L895 garLoopResultBuilder]: At program point L415(line 415) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_free~0 1) (= 1 ~c_dr_i~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) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0)) [2023-12-20 00:38:14,911 INFO L899 garLoopResultBuilder]: For program point L349(lines 339 379) no Hoare annotation was computed. [2023-12-20 00:38:14,911 INFO L899 garLoopResultBuilder]: For program point L242-1(lines 233 250) no Hoare annotation was computed. [2023-12-20 00:38:14,911 INFO L895 garLoopResultBuilder]: At program point L432(line 432) the Hoare annotation is: (let ((.cse1 (= ~c_num_read~0 ~p_num_write~0)) (.cse15 (<= 1 ~c_dr_pc~0)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse3 (= ~q_free~0 1)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse12 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse13 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse11 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse8 (<= ~q_req_up~0 0)) (.cse16 (<= 1 ~q_write_ev~0)) (.cse14 (= ~q_read_ev~0 2)) (.cse9 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse3 (= ~q_read_ev~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse2 .cse5 .cse6 .cse11 .cse12) (and .cse0 .cse2 .cse13 (not (= ~q_write_ev~0 0)) .cse5 .cse6 .cse11 .cse7 .cse8 .cse14 .cse9) (and .cse0 .cse2 .cse15 .cse5 .cse6 .cse11 .cse8 .cse16 .cse14 .cse9) (and .cse0 .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse8 .cse14 .cse9 .cse10) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse2 .cse3 .cse5 .cse6 .cse12 .cse10) (and .cse0 .cse2 .cse13 .cse6 .cse11 .cse7 .cse8 .cse16 .cse14 .cse9))) [2023-12-20 00:38:14,911 INFO L899 garLoopResultBuilder]: For program point do_write_p_returnLabel#1(lines 124 163) no Hoare annotation was computed. [2023-12-20 00:38:14,911 INFO L899 garLoopResultBuilder]: For program point start_simulation_returnLabel#1(lines 405 447) no Hoare annotation was computed. [2023-12-20 00:38:14,911 INFO L899 garLoopResultBuilder]: For program point L342(line 342) no Hoare annotation was computed. [2023-12-20 00:38:14,911 INFO L899 garLoopResultBuilder]: For program point L433(line 433) no Hoare annotation was computed. [2023-12-20 00:38:14,911 INFO L899 garLoopResultBuilder]: For program point L169(lines 169 177) no Hoare annotation was computed. [2023-12-20 00:38:14,911 INFO L895 garLoopResultBuilder]: At program point L392(line 392) the Hoare annotation is: (let ((.cse0 (= ~c_num_read~0 ~p_num_write~0)) (.cse14 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse6 (= ~c_dr_pc~0 1)) (.cse2 (= ~q_free~0 1)) (.cse13 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (<= 1 ~c_dr_pc~0)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse12 (= ~q_free~0 0)) (.cse7 (<= ~q_req_up~0 0)) (.cse8 (= ~q_read_ev~0 2)) (.cse9 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10) (and .cse1 .cse4 .cse5 .cse12 .cse13) (and .cse11 .cse1 .cse14 (not (= ~q_write_ev~0 0)) .cse4 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9) (and .cse11 .cse0 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse1 .cse14 .cse3 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse1 .cse2 .cse4 .cse5 .cse13 .cse10) (and .cse11 .cse1 .cse15 .cse3 .cse4 .cse5 .cse12 .cse7 .cse8 .cse9))) [2023-12-20 00:38:14,911 INFO L899 garLoopResultBuilder]: For program point L392-1(line 392) no Hoare annotation was computed. [2023-12-20 00:38:14,911 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 136) no Hoare annotation was computed. [2023-12-20 00:38:14,911 INFO L899 garLoopResultBuilder]: For program point do_read_c_returnLabel#1(lines 165 217) no Hoare annotation was computed. [2023-12-20 00:38:14,911 INFO L899 garLoopResultBuilder]: For program point L401(lines 390 403) no Hoare annotation was computed. [2023-12-20 00:38:14,912 INFO L899 garLoopResultBuilder]: For program point L368(lines 368 375) no Hoare annotation was computed. [2023-12-20 00:38:14,912 INFO L895 garLoopResultBuilder]: At program point L203(line 203) the Hoare annotation is: false [2023-12-20 00:38:14,912 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-20 00:38:14,912 INFO L899 garLoopResultBuilder]: For program point L344(lines 344 348) no Hoare annotation was computed. [2023-12-20 00:38:14,912 INFO L899 garLoopResultBuilder]: For program point L344-1(lines 339 379) no Hoare annotation was computed. [2023-12-20 00:38:14,912 INFO L899 garLoopResultBuilder]: For program point L237(lines 237 241) no Hoare annotation was computed. [2023-12-20 00:38:14,912 INFO L899 garLoopResultBuilder]: For program point L237-2(lines 236 249) no Hoare annotation was computed. [2023-12-20 00:38:14,912 INFO L895 garLoopResultBuilder]: At program point L427(line 427) the Hoare annotation is: (let ((.cse0 (= ~q_req_up~0 1)) (.cse3 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse8 (= ~c_dr_pc~0 1)) (.cse11 (= ~c_num_read~0 ~p_num_write~0)) (.cse12 (= ~q_free~0 1)) (.cse15 (= ~c_dr_pc~0 0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse16 (<= 1 ~c_dr_pc~0)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= ~q_free~0 0)) (.cse14 (<= ~q_req_up~0 0)) (.cse9 (= ~q_read_ev~0 2)) (.cse10 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse4 .cse5 .cse6 .cse8 (<= 1 ~q_read_ev~0) .cse10 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse4 .cse5 .cse6 .cse8 .cse14 .cse10 .cse13) (and .cse2 .cse5 .cse6 .cse7 .cse15) (and .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse5 .cse6 .cse7 .cse8 .cse14 .cse9 .cse10) (and .cse1 .cse11 .cse2 .cse16 .cse12 .cse4 .cse5 .cse6 .cse14 .cse9 .cse10 .cse13) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse2 .cse12 .cse5 .cse6 .cse15 .cse13) (and .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse14 .cse9 .cse10))) [2023-12-20 00:38:14,912 INFO L899 garLoopResultBuilder]: For program point L427-1(line 427) no Hoare annotation was computed. [2023-12-20 00:38:14,912 INFO L899 garLoopResultBuilder]: For program point L394(lines 394 399) no Hoare annotation was computed. [2023-12-20 00:38:14,912 INFO L895 garLoopResultBuilder]: At program point L419-1(lines 419 441) the Hoare annotation is: (let ((.cse15 (= ~p_dw_st~0 0))) (let ((.cse0 (= ~c_num_read~0 ~p_num_write~0)) (.cse18 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse6 (= ~c_dr_pc~0 1)) (.cse12 (= ~p_dw_pc~0 0)) (.cse13 (= ~p_num_write~0 0)) (.cse14 (= ~c_num_read~0 0)) (.cse2 (= ~q_free~0 1)) (.cse16 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (not .cse15)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse19 (<= 1 ~c_dr_pc~0)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse17 (= ~q_free~0 0)) (.cse7 (<= ~q_req_up~0 0)) (.cse8 (= ~q_read_ev~0 2)) (.cse9 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10) (and .cse12 .cse13 .cse14 .cse1 .cse2 .cse3 .cse5 .cse7 .cse15 .cse8 .cse16 .cse9 .cse10) (and .cse1 .cse4 .cse5 .cse17 .cse16) (and .cse11 .cse1 .cse18 (not (= ~q_write_ev~0 0)) .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9) (and .cse11 .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse1 .cse18 .cse3 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9) (and .cse12 .cse13 .cse14 .cse1 .cse2 .cse4 .cse5 .cse16 .cse10) (and .cse11 .cse1 .cse19 .cse3 .cse4 .cse5 .cse17 .cse7 .cse8 .cse9)))) [2023-12-20 00:38:14,912 INFO L899 garLoopResultBuilder]: For program point L353(lines 353 360) no Hoare annotation was computed. [2023-12-20 00:38:14,912 INFO L899 garLoopResultBuilder]: For program point eval_returnLabel#1(lines 332 385) no Hoare annotation was computed. [2023-12-20 00:38:14,913 INFO L899 garLoopResultBuilder]: For program point L436(lines 436 440) no Hoare annotation was computed. [2023-12-20 00:38:14,913 INFO L899 garLoopResultBuilder]: For program point L172(lines 172 176) no Hoare annotation was computed. [2023-12-20 00:38:14,913 INFO L895 garLoopResultBuilder]: At program point L139-1(lines 139 157) the Hoare annotation is: (let ((.cse8 (= ~c_dr_pc~0 1)) (.cse9 (= ~q_read_ev~0 2)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse12 (= ~p_num_write~0 0)) (.cse14 (= ~q_free~0 1)) (.cse11 (<= ~q_req_up~0 0)) (.cse0 (= ~q_req_up~0 1)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse13 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (<= 1 ~q_read_ev~0)) (.cse10 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 (<= 1 ~c_dr_pc~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse11 .cse9 .cse10) (and .cse12 .cse13 .cse2 .cse14 .cse4 .cse5 .cse15) (and .cse1 (= ~c_num_read~0 ~p_num_write~0) .cse2 .cse14 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10) (and .cse2 .cse4 .cse5 .cse6 .cse15) (and .cse12 .cse1 .cse13 .cse2 .cse14 .cse3 .cse5 .cse7 .cse11 .cse15 .cse16 .cse10) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse5 .cse6 .cse7 .cse15 .cse16 .cse10 (= ~p_num_write~0 1)))) [2023-12-20 00:38:14,913 INFO L899 garLoopResultBuilder]: For program point L131(lines 131 135) no Hoare annotation was computed. [2023-12-20 00:38:14,913 INFO L895 garLoopResultBuilder]: At program point L412(line 412) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_free~0 1) (= 1 ~c_dr_i~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) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0)) [2023-12-20 00:38:14,913 INFO L899 garLoopResultBuilder]: For program point L412-1(line 412) no Hoare annotation was computed. [2023-12-20 00:38:14,913 INFO L899 garLoopResultBuilder]: For program point L181(lines 180 211) no Hoare annotation was computed. [2023-12-20 00:38:14,913 INFO L899 garLoopResultBuilder]: For program point L140(lines 139 157) no Hoare annotation was computed. [2023-12-20 00:38:14,913 INFO L899 garLoopResultBuilder]: For program point L198(lines 198 210) no Hoare annotation was computed. [2023-12-20 00:38:14,913 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-20 00:38:14,913 INFO L899 garLoopResultBuilder]: For program point L182-1(lines 182 192) no Hoare annotation was computed. [2023-12-20 00:38:14,913 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 149) no Hoare annotation was computed. [2023-12-20 00:38:14,913 INFO L895 garLoopResultBuilder]: At program point L364(lines 339 379) the Hoare annotation is: (let ((.cse19 (= ~p_dw_st~0 0))) (let ((.cse0 (= ~c_num_read~0 ~p_num_write~0)) (.cse13 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse6 (= ~c_dr_pc~0 1)) (.cse16 (= ~p_dw_pc~0 0)) (.cse17 (= ~p_num_write~0 0)) (.cse2 (= ~q_free~0 1)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~q_req_up~0 1)) (.cse18 (= ~c_num_read~0 0)) (.cse20 (= ~c_dr_pc~0 0)) (.cse15 (<= 1 ~q_read_ev~0)) (.cse12 (not .cse19)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (<= 1 ~c_dr_pc~0)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse14 (= ~q_free~0 0)) (.cse7 (<= ~q_req_up~0 0)) (.cse8 (= ~q_read_ev~0 2)) (.cse9 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse1 .cse13 .cse3 .cse4 .cse5 .cse14 .cse6 .cse8 .cse9) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse15 .cse9 .cse10) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10) (and .cse16 .cse17 .cse18 .cse1 .cse2 .cse3 .cse5 .cse7 .cse19 .cse8 .cse20 .cse9 .cse10) (and .cse1 .cse4 .cse5 .cse14 .cse20) (and .cse12 .cse1 .cse13 (not (= ~q_write_ev~0 0)) .cse4 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9) (and .cse12 .cse0 .cse1 .cse21 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10) (and .cse12 .cse1 .cse13 .cse3 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9) (and .cse16 .cse17 .cse18 .cse1 .cse2 .cse4 .cse5 .cse20 .cse10) (and .cse11 .cse12 .cse18 .cse1 .cse3 .cse5 .cse14 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|) .cse20 .cse15 .cse9 (= ~p_num_write~0 1)) (and .cse12 .cse1 .cse21 .cse3 .cse4 .cse5 .cse14 .cse7 .cse8 .cse9)))) [2023-12-20 00:38:14,913 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 205) no Hoare annotation was computed. [2023-12-20 00:38:14,914 INFO L895 garLoopResultBuilder]: At program point L414(line 414) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_free~0 1) (= 1 ~c_dr_i~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) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0)) [2023-12-20 00:38:14,914 INFO L895 garLoopResultBuilder]: At program point L414-1(line 414) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_free~0 1) (= 1 ~c_dr_i~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) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0)) [2023-12-20 00:38:14,914 INFO L895 garLoopResultBuilder]: At program point L340(line 340) the Hoare annotation is: (let ((.cse19 (= ~p_dw_st~0 0))) (let ((.cse0 (= ~c_num_read~0 ~p_num_write~0)) (.cse13 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse6 (= ~c_dr_pc~0 1)) (.cse16 (= ~p_dw_pc~0 0)) (.cse17 (= ~p_num_write~0 0)) (.cse2 (= ~q_free~0 1)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~q_req_up~0 1)) (.cse18 (= ~c_num_read~0 0)) (.cse20 (= ~c_dr_pc~0 0)) (.cse15 (<= 1 ~q_read_ev~0)) (.cse12 (not .cse19)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (<= 1 ~c_dr_pc~0)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse14 (= ~q_free~0 0)) (.cse7 (<= ~q_req_up~0 0)) (.cse8 (= ~q_read_ev~0 2)) (.cse9 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse1 .cse13 .cse3 .cse4 .cse5 .cse14 .cse6 .cse8 .cse9) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse15 .cse9 .cse10) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10) (and .cse16 .cse17 .cse18 .cse1 .cse2 .cse3 .cse5 .cse7 .cse19 .cse8 .cse20 .cse9 .cse10) (and .cse1 .cse4 .cse5 .cse14 .cse20) (and .cse12 .cse1 .cse13 (not (= ~q_write_ev~0 0)) .cse4 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9) (and .cse12 .cse0 .cse1 .cse21 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10) (and .cse12 .cse1 .cse13 .cse3 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9) (and .cse16 .cse17 .cse18 .cse1 .cse2 .cse4 .cse5 .cse20 .cse10) (and .cse11 .cse12 .cse18 .cse1 .cse3 .cse5 .cse14 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|) .cse20 .cse15 .cse9 (= ~p_num_write~0 1)) (and .cse12 .cse1 .cse21 .cse3 .cse4 .cse5 .cse14 .cse7 .cse8 .cse9)))) [2023-12-20 00:38:14,914 INFO L895 garLoopResultBuilder]: At program point L208(line 208) the Hoare annotation is: false [2023-12-20 00:38:14,914 INFO L895 garLoopResultBuilder]: At program point L208-1(lines 180 211) the Hoare annotation is: (let ((.cse10 (= ~p_dw_st~0 0))) (let ((.cse0 (not .cse10)) (.cse8 (= ~c_num_read~0 ~p_num_write~0)) (.cse1 (let ((.cse12 (= 1 ~c_dr_i~0))) (or (and (<= 1 ~c_dr_pc~0) .cse12) (and .cse12 (= ~c_dr_pc~0 0))))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (= ~q_free~0 1)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse6 (<= 1 ~q_read_ev~0)) (.cse7 (= ~p_dw_i~0 1)) (.cse11 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 .cse4 (= ~q_free~0 0) .cse5 .cse6 .cse7) (and (= ~p_dw_pc~0 0) .cse8 .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 (<= ~q_req_up~0 0) .cse10 (= ~q_read_ev~0 2) .cse7 .cse11) (and (= ~q_req_up~0 1) .cse0 .cse8 .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11)))) [2023-12-20 00:38:14,914 INFO L895 garLoopResultBuilder]: At program point L431(line 431) the Hoare annotation is: (let ((.cse7 (= ~c_dr_pc~0 1)) (.cse1 (= ~c_num_read~0 ~p_num_write~0)) (.cse3 (= ~q_free~0 1)) (.cse12 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse14 (<= 1 ~c_dr_pc~0)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse11 (= ~q_free~0 0)) (.cse8 (<= ~q_req_up~0 0)) (.cse13 (= ~q_read_ev~0 2)) (.cse9 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse2 .cse5 .cse6 .cse11 .cse12) (and .cse0 .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse5 .cse6 .cse11 .cse7 .cse8 .cse13 .cse9) (and .cse0 .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse6 .cse8 .cse13 .cse9 .cse10) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse2 .cse3 .cse5 .cse6 .cse12 .cse10) (and .cse0 .cse2 .cse14 .cse4 .cse5 .cse6 .cse11 .cse8 .cse13 .cse9))) [2023-12-20 00:38:14,914 INFO L895 garLoopResultBuilder]: At program point L431-1(line 431) the Hoare annotation is: (let ((.cse7 (= ~c_dr_pc~0 1)) (.cse1 (= ~c_num_read~0 ~p_num_write~0)) (.cse3 (= ~q_free~0 1)) (.cse12 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse14 (<= 1 ~c_dr_pc~0)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse11 (= ~q_free~0 0)) (.cse8 (<= ~q_req_up~0 0)) (.cse13 (= ~q_read_ev~0 2)) (.cse9 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse2 .cse5 .cse6 .cse11 .cse12) (and .cse0 .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) (not (= ~q_write_ev~0 0)) .cse5 .cse6 .cse11 .cse7 .cse8 .cse13 .cse9) (and .cse0 .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse6 .cse8 .cse13 .cse9 .cse10) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse2 .cse3 .cse5 .cse6 .cse12 .cse10) (and .cse0 .cse2 .cse14 .cse4 .cse5 .cse6 .cse11 .cse8 .cse13 .cse9))) [2023-12-20 00:38:14,914 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 74) no Hoare annotation was computed. [2023-12-20 00:38:14,914 INFO L899 garLoopResultBuilder]: For program point L65-2(lines 65 74) no Hoare annotation was computed. [2023-12-20 00:38:14,914 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 61 79) no Hoare annotation was computed. [2023-12-20 00:38:14,914 INFO L899 garLoopResultBuilder]: For program point L76(lines 64 78) no Hoare annotation was computed. [2023-12-20 00:38:14,914 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 61 79) the Hoare annotation is: true [2023-12-20 00:38:14,915 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 71) no Hoare annotation was computed. [2023-12-20 00:38:14,915 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 16 23) no Hoare annotation was computed. [2023-12-20 00:38:14,915 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 16 23) the Hoare annotation is: true [2023-12-20 00:38:14,915 INFO L899 garLoopResultBuilder]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2023-12-20 00:38:14,918 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:38:14,919 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 00:38:14,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 12:38:14 BoogieIcfgContainer [2023-12-20 00:38:14,939 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 00:38:14,940 INFO L158 Benchmark]: Toolchain (without parser) took 37439.61ms. Allocated memory was 320.9MB in the beginning and 946.9MB in the end (delta: 626.0MB). Free memory was 268.0MB in the beginning and 542.4MB in the end (delta: -274.4MB). Peak memory consumption was 562.9MB. Max. memory is 8.0GB. [2023-12-20 00:38:14,940 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 200.3MB. Free memory was 150.7MB in the beginning and 150.5MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 00:38:14,941 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.60ms. Allocated memory is still 320.9MB. Free memory was 267.5MB in the beginning and 254.4MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-20 00:38:14,942 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.42ms. Allocated memory is still 320.9MB. Free memory was 254.4MB in the beginning and 252.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 00:38:14,942 INFO L158 Benchmark]: Boogie Preprocessor took 24.71ms. Allocated memory is still 320.9MB. Free memory was 252.3MB in the beginning and 250.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 00:38:14,942 INFO L158 Benchmark]: RCFGBuilder took 355.89ms. Allocated memory is still 320.9MB. Free memory was 250.2MB in the beginning and 230.3MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-20 00:38:14,942 INFO L158 Benchmark]: TraceAbstraction took 36818.93ms. Allocated memory was 320.9MB in the beginning and 946.9MB in the end (delta: 626.0MB). Free memory was 229.2MB in the beginning and 542.4MB in the end (delta: -313.2MB). Peak memory consumption was 524.1MB. Max. memory is 8.0GB. [2023-12-20 00:38:14,943 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.52ms. Allocated memory is still 200.3MB. Free memory was 150.7MB in the beginning and 150.5MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 210.60ms. Allocated memory is still 320.9MB. Free memory was 267.5MB in the beginning and 254.4MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.42ms. Allocated memory is still 320.9MB. Free memory was 254.4MB in the beginning and 252.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.71ms. Allocated memory is still 320.9MB. Free memory was 252.3MB in the beginning and 250.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 355.89ms. Allocated memory is still 320.9MB. Free memory was 250.2MB in the beginning and 230.3MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 36818.93ms. Allocated memory was 320.9MB in the beginning and 946.9MB in the end (delta: 626.0MB). Free memory was 229.2MB in the beginning and 542.4MB in the end (delta: -313.2MB). Peak memory consumption was 524.1MB. 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: 20]: 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, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.8s, OverallIterations: 22, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 21.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7685 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7483 mSDsluCounter, 7397 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5490 mSDsCounter, 1885 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8267 IncrementalHoareTripleChecker+Invalid, 10152 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1885 mSolverCounterUnsat, 1907 mSDtfsCounter, 8267 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2272 GetRequests, 1953 SyntacticMatches, 5 SemanticMatches, 314 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 977 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4785occurred in iteration=14, InterpolantAutomatonStates: 279, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 22 MinimizatonAttempts, 5096 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 4002 PreInvPairs, 4272 NumberOfFragments, 5182 HoareAnnotationTreeSize, 4002 FormulaSimplifications, 1978285 FormulaSimplificationTreeSizeReduction, 15.0s HoareSimplificationTime, 26 FormulaSimplificationsInter, 35856 FormulaSimplificationTreeSizeReductionInter, 6.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 3077 NumberOfCodeBlocks, 3077 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 3488 ConstructedInterpolants, 0 QuantifiedInterpolants, 6515 SizeOfPredicates, 2 NumberOfNonLiveVariables, 3034 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 31 InterpolantComputations, 19 PerfectInterpolantSequences, 2089/2148 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: 180]: Loop Invariant Derived loop invariant: ((((((((((!((p_dw_st == 0)) && (((1 <= c_dr_pc) && (1 == c_dr_i)) || ((1 == c_dr_i) && (c_dr_pc == 0)))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (q_free == 0)) && (1 <= q_read_ev)) && (p_dw_i == 1)) || ((((((((((((p_dw_pc == 0) && (c_num_read == p_num_write)) && (((1 <= c_dr_pc) && (1 == c_dr_i)) || ((1 == c_dr_i) && (c_dr_pc == 0)))) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (q_req_up <= 0)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || (((((((((((q_req_up == 1) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (((1 <= c_dr_pc) && (1 == c_dr_i)) || ((1 == c_dr_i) && (c_dr_pc == 0)))) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: (((((((((((((((((q_req_up == 1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) || (((((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && (1 <= c_dr_pc)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (q_req_up <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((p_num_write == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == 0))) || (((((((((!((p_dw_st == 0)) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((p_last_write == q_buf_0) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 0))) || (((((((((((p_num_write == 0) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_req_up <= 0)) && (c_dr_pc == 0)) && (1 <= q_read_ev)) && (p_dw_i == 1))) || (((((((((((q_req_up == 1) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 0)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (p_num_write == 1))) - InvariantResult [Line: 419]: Loop Invariant Derived loop invariant: (((((((((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) || ((((((((((!((p_dw_st == 0)) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || (((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_req_up <= 0)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || (((((p_last_write == q_buf_0) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 0))) || ((((((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && !((q_write_ev == 0))) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((((((!((p_dw_st == 0)) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (1 <= c_dr_pc)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_req_up <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || (((((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && (1 <= c_dr_pc)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (q_req_up <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1))) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) || (((((((((((q_req_up == 1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || ((((((((((((q_req_up == 1) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((!((p_dw_st == 0)) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || (((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_req_up <= 0)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || (((((p_last_write == q_buf_0) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 0))) || ((((((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && !((q_write_ev == 0))) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((((((!((p_dw_st == 0)) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (1 <= c_dr_pc)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_req_up <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || (((((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((((((((((q_req_up == 1) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_free == 0)) && (1 <= tmp___1)) && (c_dr_pc == 0)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (p_num_write == 1))) || (((((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && (1 <= c_dr_pc)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (q_req_up <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1))) RESULT: Ultimate proved your program to be correct! [2023-12-20 00:38:14,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...