/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/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 01:33:25,814 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 01:33:25,866 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-19 01:33:25,869 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 01:33:25,870 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 01:33:25,887 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 01:33:25,888 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 01:33:25,888 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 01:33:25,888 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 01:33:25,889 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 01:33:25,889 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 01:33:25,889 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 01:33:25,890 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 01:33:25,890 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 01:33:25,890 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 01:33:25,890 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 01:33:25,891 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 01:33:25,891 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 01:33:25,891 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 01:33:25,891 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 01:33:25,892 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 01:33:25,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 01:33:25,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 01:33:25,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 01:33:25,894 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 01:33:25,894 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 01:33:25,894 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 01:33:25,894 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 01:33:25,895 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 01:33:25,895 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 01:33:25,895 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 01:33:25,895 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 01:33:25,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 01:33:25,896 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 01:33:25,896 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 01:33:25,896 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 01:33:25,897 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 01:33:25,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 01:33:25,897 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 01:33:25,897 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 01:33:25,897 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 01:33:25,898 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 01:33:25,898 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 01:33:25,898 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-19 01:33:26,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 01:33:26,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 01:33:26,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 01:33:26,129 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 01:33:26,130 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 01:33:26,131 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2023-12-19 01:33:27,339 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 01:33:27,518 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 01:33:27,518 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2023-12-19 01:33:27,527 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d706fdc9b/ecefb148dde341908f336edbdc90ad53/FLAG019fb012d [2023-12-19 01:33:27,538 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d706fdc9b/ecefb148dde341908f336edbdc90ad53 [2023-12-19 01:33:27,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 01:33:27,541 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 01:33:27,542 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 01:33:27,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 01:33:27,550 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 01:33:27,551 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:33:27" (1/1) ... [2023-12-19 01:33:27,552 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@798a077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:33:27, skipping insertion in model container [2023-12-19 01:33:27,552 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:33:27" (1/1) ... [2023-12-19 01:33:27,596 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 01:33:27,716 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[914,927] [2023-12-19 01:33:27,755 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[7115,7128] [2023-12-19 01:33:27,775 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 01:33:27,785 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 01:33:27,793 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[914,927] [2023-12-19 01:33:27,809 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[7115,7128] [2023-12-19 01:33:27,822 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 01:33:27,837 INFO L206 MainTranslator]: Completed translation [2023-12-19 01:33:27,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:33:27 WrapperNode [2023-12-19 01:33:27,838 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 01:33:27,839 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 01:33:27,839 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 01:33:27,839 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 01:33:27,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:33:27" (1/1) ... [2023-12-19 01:33:27,853 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:33:27" (1/1) ... [2023-12-19 01:33:27,886 INFO L138 Inliner]: procedures = 55, calls = 60, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 408 [2023-12-19 01:33:27,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 01:33:27,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 01:33:27,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 01:33:27,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 01:33:27,895 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:33:27" (1/1) ... [2023-12-19 01:33:27,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:33:27" (1/1) ... [2023-12-19 01:33:27,905 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:33:27" (1/1) ... [2023-12-19 01:33:27,917 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-19 01:33:27,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:33:27" (1/1) ... [2023-12-19 01:33:27,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:33:27" (1/1) ... [2023-12-19 01:33:27,923 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:33:27" (1/1) ... [2023-12-19 01:33:27,928 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:33:27" (1/1) ... [2023-12-19 01:33:27,929 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:33:27" (1/1) ... [2023-12-19 01:33:27,930 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:33:27" (1/1) ... [2023-12-19 01:33:27,933 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 01:33:27,934 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 01:33:27,934 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 01:33:27,934 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 01:33:27,935 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:33:27" (1/1) ... [2023-12-19 01:33:27,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 01:33:27,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:33:27,973 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-19 01:33:27,985 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-19 01:33:28,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 01:33:28,003 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-19 01:33:28,003 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-19 01:33:28,004 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-12-19 01:33:28,005 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-12-19 01:33:28,005 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-12-19 01:33:28,005 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-12-19 01:33:28,005 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-12-19 01:33:28,005 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-12-19 01:33:28,006 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2023-12-19 01:33:28,006 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2023-12-19 01:33:28,006 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-12-19 01:33:28,006 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-12-19 01:33:28,006 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-12-19 01:33:28,006 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-12-19 01:33:28,006 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2023-12-19 01:33:28,006 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2023-12-19 01:33:28,006 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-12-19 01:33:28,006 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-12-19 01:33:28,006 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2023-12-19 01:33:28,006 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2023-12-19 01:33:28,006 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-12-19 01:33:28,007 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-12-19 01:33:28,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 01:33:28,007 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-12-19 01:33:28,008 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-12-19 01:33:28,008 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2023-12-19 01:33:28,008 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2023-12-19 01:33:28,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 01:33:28,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 01:33:28,009 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-12-19 01:33:28,009 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-12-19 01:33:28,103 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 01:33:28,106 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 01:33:28,569 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 01:33:28,615 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 01:33:28,615 INFO L309 CfgBuilder]: Removed 8 assume(true) statements. [2023-12-19 01:33:28,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:33:28 BoogieIcfgContainer [2023-12-19 01:33:28,616 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 01:33:28,618 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 01:33:28,618 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 01:33:28,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 01:33:28,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 01:33:27" (1/3) ... [2023-12-19 01:33:28,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739c043b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:33:28, skipping insertion in model container [2023-12-19 01:33:28,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:33:27" (2/3) ... [2023-12-19 01:33:28,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739c043b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:33:28, skipping insertion in model container [2023-12-19 01:33:28,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:33:28" (3/3) ... [2023-12-19 01:33:28,622 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2023-12-19 01:33:28,634 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 01:33:28,634 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-19 01:33:28,678 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 01:33:28,684 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;@51db9303, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 01:33:28,684 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-19 01:33:28,689 INFO L276 IsEmpty]: Start isEmpty. Operand has 186 states, 140 states have (on average 1.6142857142857143) internal successors, (226), 146 states have internal predecessors, (226), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2023-12-19 01:33:28,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-19 01:33:28,699 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:28,700 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] [2023-12-19 01:33:28,700 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:28,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:28,705 INFO L85 PathProgramCache]: Analyzing trace with hash -601353219, now seen corresponding path program 1 times [2023-12-19 01:33:28,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:28,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754311441] [2023-12-19 01:33:28,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:28,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:28,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:29,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:29,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:33:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:29,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:33:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:29,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:33:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:29,057 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-19 01:33:29,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:29,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754311441] [2023-12-19 01:33:29,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754311441] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:29,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:33:29,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 01:33:29,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34586095] [2023-12-19 01:33:29,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:29,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 01:33:29,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:29,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 01:33:29,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:33:29,090 INFO L87 Difference]: Start difference. First operand has 186 states, 140 states have (on average 1.6142857142857143) internal successors, (226), 146 states have internal predecessors, (226), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:33:29,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:29,794 INFO L93 Difference]: Finished difference Result 481 states and 741 transitions. [2023-12-19 01:33:29,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 01:33:29,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2023-12-19 01:33:29,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:29,813 INFO L225 Difference]: With dead ends: 481 [2023-12-19 01:33:29,813 INFO L226 Difference]: Without dead ends: 304 [2023-12-19 01:33:29,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-12-19 01:33:29,825 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 487 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:29,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 493 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 01:33:29,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2023-12-19 01:33:29,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 265. [2023-12-19 01:33:29,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 204 states have (on average 1.4803921568627452) internal successors, (302), 209 states have internal predecessors, (302), 39 states have call successors, (39), 20 states have call predecessors, (39), 20 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2023-12-19 01:33:29,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 381 transitions. [2023-12-19 01:33:29,912 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 381 transitions. Word has length 51 [2023-12-19 01:33:29,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:29,913 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 381 transitions. [2023-12-19 01:33:29,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:33:29,914 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 381 transitions. [2023-12-19 01:33:29,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-19 01:33:29,918 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:29,919 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] [2023-12-19 01:33:29,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 01:33:29,919 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:29,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:29,920 INFO L85 PathProgramCache]: Analyzing trace with hash 244995329, now seen corresponding path program 1 times [2023-12-19 01:33:29,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:29,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143103051] [2023-12-19 01:33:29,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:29,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:30,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:30,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:30,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:30,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:33:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:30,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:33:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:30,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:33:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:30,126 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-19 01:33:30,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:30,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143103051] [2023-12-19 01:33:30,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143103051] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:30,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:33:30,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:33:30,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646162830] [2023-12-19 01:33:30,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:30,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:33:30,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:30,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:33:30,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:33:30,134 INFO L87 Difference]: Start difference. First operand 265 states and 381 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:33:30,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:30,809 INFO L93 Difference]: Finished difference Result 575 states and 833 transitions. [2023-12-19 01:33:30,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 01:33:30,809 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2023-12-19 01:33:30,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:30,816 INFO L225 Difference]: With dead ends: 575 [2023-12-19 01:33:30,816 INFO L226 Difference]: Without dead ends: 405 [2023-12-19 01:33:30,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-12-19 01:33:30,820 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 473 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:30,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 757 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 01:33:30,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2023-12-19 01:33:30,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 344. [2023-12-19 01:33:30,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 266 states have (on average 1.4699248120300752) internal successors, (391), 272 states have internal predecessors, (391), 49 states have call successors, (49), 26 states have call predecessors, (49), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2023-12-19 01:33:30,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 492 transitions. [2023-12-19 01:33:30,867 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 492 transitions. Word has length 51 [2023-12-19 01:33:30,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:30,867 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 492 transitions. [2023-12-19 01:33:30,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:33:30,867 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 492 transitions. [2023-12-19 01:33:30,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-19 01:33:30,868 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:30,868 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] [2023-12-19 01:33:30,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 01:33:30,869 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:30,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:30,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1126811969, now seen corresponding path program 1 times [2023-12-19 01:33:30,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:30,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319791570] [2023-12-19 01:33:30,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:30,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:30,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:30,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:30,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:30,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:33:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:30,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:33:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:30,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:33:30,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:30,989 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-19 01:33:30,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:30,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319791570] [2023-12-19 01:33:30,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319791570] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:30,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:33:30,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:33:30,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527257386] [2023-12-19 01:33:30,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:30,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:33:30,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:30,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:33:30,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:33:30,991 INFO L87 Difference]: Start difference. First operand 344 states and 492 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:33:31,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:31,629 INFO L93 Difference]: Finished difference Result 885 states and 1274 transitions. [2023-12-19 01:33:31,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 01:33:31,629 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2023-12-19 01:33:31,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:31,635 INFO L225 Difference]: With dead ends: 885 [2023-12-19 01:33:31,635 INFO L226 Difference]: Without dead ends: 636 [2023-12-19 01:33:31,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-12-19 01:33:31,639 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 485 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:31,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 748 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 01:33:31,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2023-12-19 01:33:31,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 499. [2023-12-19 01:33:31,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 389 states have (on average 1.4601542416452442) internal successors, (568), 397 states have internal predecessors, (568), 67 states have call successors, (67), 38 states have call predecessors, (67), 41 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2023-12-19 01:33:31,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 713 transitions. [2023-12-19 01:33:31,688 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 713 transitions. Word has length 51 [2023-12-19 01:33:31,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:31,688 INFO L495 AbstractCegarLoop]: Abstraction has 499 states and 713 transitions. [2023-12-19 01:33:31,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:33:31,689 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 713 transitions. [2023-12-19 01:33:31,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-19 01:33:31,691 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:31,691 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] [2023-12-19 01:33:31,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 01:33:31,691 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:31,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:31,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1322788161, now seen corresponding path program 1 times [2023-12-19 01:33:31,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:31,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234580652] [2023-12-19 01:33:31,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:31,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:31,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:31,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:31,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:33:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:31,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:33:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:31,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:33:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:31,828 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-19 01:33:31,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:31,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234580652] [2023-12-19 01:33:31,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234580652] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:31,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:33:31,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:33:31,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508222140] [2023-12-19 01:33:31,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:31,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:33:31,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:31,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:33:31,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:33:31,830 INFO L87 Difference]: Start difference. First operand 499 states and 713 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:33:32,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:32,672 INFO L93 Difference]: Finished difference Result 2310 states and 3440 transitions. [2023-12-19 01:33:32,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-19 01:33:32,672 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2023-12-19 01:33:32,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:32,688 INFO L225 Difference]: With dead ends: 2310 [2023-12-19 01:33:32,688 INFO L226 Difference]: Without dead ends: 1907 [2023-12-19 01:33:32,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2023-12-19 01:33:32,697 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 988 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:32,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 637 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 01:33:32,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1907 states. [2023-12-19 01:33:32,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1907 to 1587. [2023-12-19 01:33:32,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1587 states, 1234 states have (on average 1.4246353322528362) internal successors, (1758), 1269 states have internal predecessors, (1758), 208 states have call successors, (208), 128 states have call predecessors, (208), 143 states have return successors, (303), 194 states have call predecessors, (303), 206 states have call successors, (303) [2023-12-19 01:33:32,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 2269 transitions. [2023-12-19 01:33:32,832 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 2269 transitions. Word has length 51 [2023-12-19 01:33:32,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:32,832 INFO L495 AbstractCegarLoop]: Abstraction has 1587 states and 2269 transitions. [2023-12-19 01:33:32,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:33:32,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 2269 transitions. [2023-12-19 01:33:32,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-19 01:33:32,833 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:32,833 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-19 01:33:32,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 01:33:32,834 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:32,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:32,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1674297862, now seen corresponding path program 1 times [2023-12-19 01:33:32,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:32,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065235478] [2023-12-19 01:33:32,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:32,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:32,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:32,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:33:32,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:32,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:33:32,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:32,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:33:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:32,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:32,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:33:32,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:32,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:33:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:32,929 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-19 01:33:32,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:32,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065235478] [2023-12-19 01:33:32,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065235478] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:32,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:33:32,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 01:33:32,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311481774] [2023-12-19 01:33:32,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:32,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 01:33:32,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:32,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 01:33:32,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-19 01:33:32,931 INFO L87 Difference]: Start difference. First operand 1587 states and 2269 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 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-19 01:33:33,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:33,441 INFO L93 Difference]: Finished difference Result 1793 states and 2567 transitions. [2023-12-19 01:33:33,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 01:33:33,441 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 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-19 01:33:33,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:33,448 INFO L225 Difference]: With dead ends: 1793 [2023-12-19 01:33:33,448 INFO L226 Difference]: Without dead ends: 1712 [2023-12-19 01:33:33,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2023-12-19 01:33:33,450 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 644 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:33,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 565 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 01:33:33,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2023-12-19 01:33:33,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1675. [2023-12-19 01:33:33,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1675 states, 1302 states have (on average 1.424731182795699) internal successors, (1855), 1339 states have internal predecessors, (1855), 219 states have call successors, (219), 135 states have call predecessors, (219), 152 states have return successors, (319), 206 states have call predecessors, (319), 217 states have call successors, (319) [2023-12-19 01:33:33,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 2393 transitions. [2023-12-19 01:33:33,571 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 2393 transitions. Word has length 58 [2023-12-19 01:33:33,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:33,571 INFO L495 AbstractCegarLoop]: Abstraction has 1675 states and 2393 transitions. [2023-12-19 01:33:33,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 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-19 01:33:33,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 2393 transitions. [2023-12-19 01:33:33,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-19 01:33:33,573 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:33,573 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-19 01:33:33,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 01:33:33,573 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:33,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:33,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1529507387, now seen corresponding path program 1 times [2023-12-19 01:33:33,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:33,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663240203] [2023-12-19 01:33:33,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:33,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:33,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:33,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:33:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:33,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:33:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:33,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:33:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:33,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:33,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:33:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:33,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:33:33,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:33,689 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-19 01:33:33,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:33,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663240203] [2023-12-19 01:33:33,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663240203] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:33,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:33:33,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 01:33:33,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931829807] [2023-12-19 01:33:33,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:33,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 01:33:33,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:33,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 01:33:33,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-19 01:33:33,690 INFO L87 Difference]: Start difference. First operand 1675 states and 2393 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-19 01:33:34,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:34,316 INFO L93 Difference]: Finished difference Result 1995 states and 2843 transitions. [2023-12-19 01:33:34,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-19 01:33:34,317 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-19 01:33:34,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:34,325 INFO L225 Difference]: With dead ends: 1995 [2023-12-19 01:33:34,325 INFO L226 Difference]: Without dead ends: 1833 [2023-12-19 01:33:34,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 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-19 01:33:34,327 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 675 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:34,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 782 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 01:33:34,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1833 states. [2023-12-19 01:33:34,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1833 to 1763. [2023-12-19 01:33:34,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1763 states, 1370 states have (on average 1.424087591240876) internal successors, (1951), 1409 states have internal predecessors, (1951), 230 states have call successors, (230), 142 states have call predecessors, (230), 161 states have return successors, (338), 218 states have call predecessors, (338), 228 states have call successors, (338) [2023-12-19 01:33:34,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 2519 transitions. [2023-12-19 01:33:34,420 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 2519 transitions. Word has length 58 [2023-12-19 01:33:34,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:34,420 INFO L495 AbstractCegarLoop]: Abstraction has 1763 states and 2519 transitions. [2023-12-19 01:33:34,420 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-19 01:33:34,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2519 transitions. [2023-12-19 01:33:34,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-19 01:33:34,421 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:34,421 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-19 01:33:34,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 01:33:34,422 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:34,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:34,422 INFO L85 PathProgramCache]: Analyzing trace with hash -837187207, now seen corresponding path program 1 times [2023-12-19 01:33:34,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:34,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033383549] [2023-12-19 01:33:34,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:34,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:34,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:34,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:33:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:34,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:33:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:34,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:33:34,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:34,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:34,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:33:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:34,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:33:34,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:34,544 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-19 01:33:34,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:34,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033383549] [2023-12-19 01:33:34,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033383549] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:34,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:33:34,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 01:33:34,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485540060] [2023-12-19 01:33:34,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:34,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 01:33:34,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:34,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 01:33:34,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-19 01:33:34,546 INFO L87 Difference]: Start difference. First operand 1763 states and 2519 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-19 01:33:35,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:35,037 INFO L93 Difference]: Finished difference Result 2039 states and 2908 transitions. [2023-12-19 01:33:35,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 01:33:35,037 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-19 01:33:35,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:35,044 INFO L225 Difference]: With dead ends: 2039 [2023-12-19 01:33:35,044 INFO L226 Difference]: Without dead ends: 1795 [2023-12-19 01:33:35,045 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-19 01:33:35,046 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 291 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:35,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 840 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 01:33:35,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2023-12-19 01:33:35,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1767. [2023-12-19 01:33:35,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1767 states, 1373 states have (on average 1.4217042971595046) internal successors, (1952), 1412 states have internal predecessors, (1952), 230 states have call successors, (230), 142 states have call predecessors, (230), 162 states have return successors, (339), 219 states have call predecessors, (339), 228 states have call successors, (339) [2023-12-19 01:33:35,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 2521 transitions. [2023-12-19 01:33:35,131 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 2521 transitions. Word has length 58 [2023-12-19 01:33:35,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:35,131 INFO L495 AbstractCegarLoop]: Abstraction has 1767 states and 2521 transitions. [2023-12-19 01:33:35,131 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-19 01:33:35,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2521 transitions. [2023-12-19 01:33:35,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-19 01:33:35,133 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:35,133 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-19 01:33:35,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 01:33:35,133 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:35,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:35,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1213796791, now seen corresponding path program 1 times [2023-12-19 01:33:35,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:35,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765298149] [2023-12-19 01:33:35,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:35,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:35,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:35,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:33:35,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:35,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:33:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:35,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:33:35,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:35,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:35,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:33:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:35,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:33:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:35,253 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-19 01:33:35,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:35,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765298149] [2023-12-19 01:33:35,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765298149] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:35,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:33:35,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 01:33:35,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782905612] [2023-12-19 01:33:35,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:35,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 01:33:35,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:35,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 01:33:35,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-19 01:33:35,256 INFO L87 Difference]: Start difference. First operand 1767 states and 2521 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-19 01:33:36,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:36,361 INFO L93 Difference]: Finished difference Result 2991 states and 4219 transitions. [2023-12-19 01:33:36,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-19 01:33:36,361 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 58 [2023-12-19 01:33:36,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:36,371 INFO L225 Difference]: With dead ends: 2991 [2023-12-19 01:33:36,371 INFO L226 Difference]: Without dead ends: 2725 [2023-12-19 01:33:36,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2023-12-19 01:33:36,373 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 1790 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1804 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 1779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 523 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:36,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1804 Valid, 994 Invalid, 1779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [523 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-19 01:33:36,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2725 states. [2023-12-19 01:33:36,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2725 to 2602. [2023-12-19 01:33:36,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2602 states, 2022 states have (on average 1.3971315529179031) internal successors, (2825), 2076 states have internal predecessors, (2825), 318 states have call successors, (318), 225 states have call predecessors, (318), 260 states have return successors, (453), 306 states have call predecessors, (453), 316 states have call successors, (453) [2023-12-19 01:33:36,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 3596 transitions. [2023-12-19 01:33:36,541 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 3596 transitions. Word has length 58 [2023-12-19 01:33:36,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:36,541 INFO L495 AbstractCegarLoop]: Abstraction has 2602 states and 3596 transitions. [2023-12-19 01:33:36,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-19 01:33:36,542 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 3596 transitions. [2023-12-19 01:33:36,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-19 01:33:36,543 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:36,543 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-19 01:33:36,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 01:33:36,543 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:36,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:36,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1712040131, now seen corresponding path program 1 times [2023-12-19 01:33:36,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:36,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631849100] [2023-12-19 01:33:36,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:36,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:36,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:36,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:36,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:33:36,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:36,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:33:36,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:36,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:33:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:36,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:36,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:36,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:33:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:36,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:33:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:36,634 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-19 01:33:36,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:36,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631849100] [2023-12-19 01:33:36,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631849100] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:36,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:33:36,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 01:33:36,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530634023] [2023-12-19 01:33:36,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:36,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 01:33:36,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:36,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 01:33:36,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-19 01:33:36,635 INFO L87 Difference]: Start difference. First operand 2602 states and 3596 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 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-19 01:33:37,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:37,264 INFO L93 Difference]: Finished difference Result 3795 states and 5171 transitions. [2023-12-19 01:33:37,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-19 01:33:37,265 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 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 59 [2023-12-19 01:33:37,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:37,276 INFO L225 Difference]: With dead ends: 3795 [2023-12-19 01:33:37,276 INFO L226 Difference]: Without dead ends: 2700 [2023-12-19 01:33:37,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-12-19 01:33:37,280 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 201 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:37,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 934 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 01:33:37,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2023-12-19 01:33:37,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2626. [2023-12-19 01:33:37,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2626 states, 2040 states have (on average 1.3897058823529411) internal successors, (2835), 2094 states have internal predecessors, (2835), 318 states have call successors, (318), 225 states have call predecessors, (318), 266 states have return successors, (459), 312 states have call predecessors, (459), 316 states have call successors, (459) [2023-12-19 01:33:37,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 3612 transitions. [2023-12-19 01:33:37,454 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 3612 transitions. Word has length 59 [2023-12-19 01:33:37,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:37,454 INFO L495 AbstractCegarLoop]: Abstraction has 2626 states and 3612 transitions. [2023-12-19 01:33:37,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 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-19 01:33:37,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 3612 transitions. [2023-12-19 01:33:37,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-19 01:33:37,456 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:37,456 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-19 01:33:37,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-19 01:33:37,457 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:37,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:37,457 INFO L85 PathProgramCache]: Analyzing trace with hash 211187903, now seen corresponding path program 1 times [2023-12-19 01:33:37,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:37,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891009922] [2023-12-19 01:33:37,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:37,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:37,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:37,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:33:37,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:37,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:33:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:37,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:33:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:37,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:37,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:33:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:37,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:33:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:37,566 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-19 01:33:37,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:37,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891009922] [2023-12-19 01:33:37,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891009922] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:37,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:33:37,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 01:33:37,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73807113] [2023-12-19 01:33:37,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:37,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 01:33:37,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:37,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 01:33:37,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-19 01:33:37,568 INFO L87 Difference]: Start difference. First operand 2626 states and 3612 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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-19 01:33:38,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:38,269 INFO L93 Difference]: Finished difference Result 3776 states and 5054 transitions. [2023-12-19 01:33:38,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-19 01:33:38,270 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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 59 [2023-12-19 01:33:38,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:38,280 INFO L225 Difference]: With dead ends: 3776 [2023-12-19 01:33:38,280 INFO L226 Difference]: Without dead ends: 2864 [2023-12-19 01:33:38,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2023-12-19 01:33:38,284 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 628 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:38,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 582 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 01:33:38,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2864 states. [2023-12-19 01:33:38,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2864 to 2571. [2023-12-19 01:33:38,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2571 states, 2001 states have (on average 1.3878060969515242) internal successors, (2777), 2050 states have internal predecessors, (2777), 312 states have call successors, (312), 220 states have call predecessors, (312), 256 states have return successors, (444), 305 states have call predecessors, (444), 310 states have call successors, (444) [2023-12-19 01:33:38,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 3533 transitions. [2023-12-19 01:33:38,486 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 3533 transitions. Word has length 59 [2023-12-19 01:33:38,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:38,487 INFO L495 AbstractCegarLoop]: Abstraction has 2571 states and 3533 transitions. [2023-12-19 01:33:38,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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-19 01:33:38,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3533 transitions. [2023-12-19 01:33:38,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-19 01:33:38,492 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:38,492 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-19 01:33:38,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-19 01:33:38,492 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:38,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:38,493 INFO L85 PathProgramCache]: Analyzing trace with hash 430042621, now seen corresponding path program 1 times [2023-12-19 01:33:38,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:38,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491768931] [2023-12-19 01:33:38,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:38,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:38,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:38,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:33:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:38,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:33:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:38,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:33:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:38,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:38,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:33:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:38,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:33:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:38,572 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-19 01:33:38,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:38,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491768931] [2023-12-19 01:33:38,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491768931] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:38,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:33:38,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:33:38,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79978523] [2023-12-19 01:33:38,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:38,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:33:38,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:38,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:33:38,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:33:38,575 INFO L87 Difference]: Start difference. First operand 2571 states and 3533 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 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-19 01:33:39,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:39,125 INFO L93 Difference]: Finished difference Result 4720 states and 6304 transitions. [2023-12-19 01:33:39,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-19 01:33:39,126 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 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 59 [2023-12-19 01:33:39,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:39,140 INFO L225 Difference]: With dead ends: 4720 [2023-12-19 01:33:39,140 INFO L226 Difference]: Without dead ends: 3657 [2023-12-19 01:33:39,144 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-19 01:33:39,144 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 617 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:39,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 466 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 01:33:39,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3657 states. [2023-12-19 01:33:39,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3657 to 3541. [2023-12-19 01:33:39,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3541 states, 2728 states have (on average 1.347507331378299) internal successors, (3676), 2794 states have internal predecessors, (3676), 431 states have call successors, (431), 319 states have call predecessors, (431), 380 states have return successors, (635), 433 states have call predecessors, (635), 429 states have call successors, (635) [2023-12-19 01:33:39,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3541 states to 3541 states and 4742 transitions. [2023-12-19 01:33:39,375 INFO L78 Accepts]: Start accepts. Automaton has 3541 states and 4742 transitions. Word has length 59 [2023-12-19 01:33:39,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:39,375 INFO L495 AbstractCegarLoop]: Abstraction has 3541 states and 4742 transitions. [2023-12-19 01:33:39,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 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-19 01:33:39,375 INFO L276 IsEmpty]: Start isEmpty. Operand 3541 states and 4742 transitions. [2023-12-19 01:33:39,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-19 01:33:39,376 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:39,376 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] [2023-12-19 01:33:39,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-19 01:33:39,377 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:39,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:39,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1129756660, now seen corresponding path program 1 times [2023-12-19 01:33:39,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:39,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766066818] [2023-12-19 01:33:39,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:39,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:39,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:39,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:33:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:39,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:33:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:39,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:33:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:39,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:39,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:33:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:39,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:33:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:39,420 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-19 01:33:39,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:39,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766066818] [2023-12-19 01:33:39,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766066818] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:39,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:33:39,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 01:33:39,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537126046] [2023-12-19 01:33:39,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:39,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 01:33:39,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:39,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 01:33:39,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:33:39,422 INFO L87 Difference]: Start difference. First operand 3541 states and 4742 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 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-19 01:33:40,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:40,002 INFO L93 Difference]: Finished difference Result 6593 states and 8623 transitions. [2023-12-19 01:33:40,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 01:33:40,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 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 60 [2023-12-19 01:33:40,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:40,020 INFO L225 Difference]: With dead ends: 6593 [2023-12-19 01:33:40,020 INFO L226 Difference]: Without dead ends: 4565 [2023-12-19 01:33:40,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 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-19 01:33:40,025 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 497 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:40,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 442 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 01:33:40,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4565 states. [2023-12-19 01:33:40,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4565 to 4307. [2023-12-19 01:33:40,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4307 states, 3308 states have (on average 1.3310157194679564) internal successors, (4403), 3379 states have internal predecessors, (4403), 523 states have call successors, (523), 399 states have call predecessors, (523), 474 states have return successors, (749), 534 states have call predecessors, (749), 521 states have call successors, (749) [2023-12-19 01:33:40,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4307 states to 4307 states and 5675 transitions. [2023-12-19 01:33:40,339 INFO L78 Accepts]: Start accepts. Automaton has 4307 states and 5675 transitions. Word has length 60 [2023-12-19 01:33:40,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:40,339 INFO L495 AbstractCegarLoop]: Abstraction has 4307 states and 5675 transitions. [2023-12-19 01:33:40,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 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-19 01:33:40,339 INFO L276 IsEmpty]: Start isEmpty. Operand 4307 states and 5675 transitions. [2023-12-19 01:33:40,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-19 01:33:40,341 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:40,341 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, 1] [2023-12-19 01:33:40,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-19 01:33:40,341 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:40,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:40,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1039441133, now seen corresponding path program 1 times [2023-12-19 01:33:40,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:40,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216245536] [2023-12-19 01:33:40,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:40,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:40,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:40,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:33:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:40,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:33:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:40,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:33:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:40,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:40,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:33:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:40,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:33:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:40,401 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-19 01:33:40,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:40,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216245536] [2023-12-19 01:33:40,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216245536] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:40,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:33:40,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 01:33:40,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634617723] [2023-12-19 01:33:40,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:40,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 01:33:40,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:40,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 01:33:40,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:33:40,403 INFO L87 Difference]: Start difference. First operand 4307 states and 5675 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 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-19 01:33:41,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:41,020 INFO L93 Difference]: Finished difference Result 7871 states and 10141 transitions. [2023-12-19 01:33:41,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 01:33:41,021 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 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 66 [2023-12-19 01:33:41,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:41,051 INFO L225 Difference]: With dead ends: 7871 [2023-12-19 01:33:41,052 INFO L226 Difference]: Without dead ends: 5075 [2023-12-19 01:33:41,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-12-19 01:33:41,061 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 461 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:41,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 514 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 01:33:41,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5075 states. [2023-12-19 01:33:41,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5075 to 4811. [2023-12-19 01:33:41,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4811 states, 3698 states have (on average 1.3231476473769606) internal successors, (4893), 3773 states have internal predecessors, (4893), 579 states have call successors, (579), 449 states have call predecessors, (579), 532 states have return successors, (822), 594 states have call predecessors, (822), 577 states have call successors, (822) [2023-12-19 01:33:41,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4811 states to 4811 states and 6294 transitions. [2023-12-19 01:33:41,384 INFO L78 Accepts]: Start accepts. Automaton has 4811 states and 6294 transitions. Word has length 66 [2023-12-19 01:33:41,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:41,385 INFO L495 AbstractCegarLoop]: Abstraction has 4811 states and 6294 transitions. [2023-12-19 01:33:41,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 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-19 01:33:41,385 INFO L276 IsEmpty]: Start isEmpty. Operand 4811 states and 6294 transitions. [2023-12-19 01:33:41,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-19 01:33:41,386 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:41,387 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-19 01:33:41,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-19 01:33:41,387 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:41,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:41,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1620938651, now seen corresponding path program 1 times [2023-12-19 01:33:41,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:41,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615907501] [2023-12-19 01:33:41,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:41,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:41,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:41,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:33:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:41,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:33:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:41,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:33:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:41,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:41,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:33:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:41,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:33:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:41,458 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-19 01:33:41,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:41,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615907501] [2023-12-19 01:33:41,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615907501] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:41,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:33:41,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:33:41,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611545777] [2023-12-19 01:33:41,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:41,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:33:41,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:41,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:33:41,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:33:41,460 INFO L87 Difference]: Start difference. First operand 4811 states and 6294 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 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-19 01:33:42,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:42,157 INFO L93 Difference]: Finished difference Result 5819 states and 7511 transitions. [2023-12-19 01:33:42,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 01:33:42,158 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 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 67 [2023-12-19 01:33:42,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:42,181 INFO L225 Difference]: With dead ends: 5819 [2023-12-19 01:33:42,181 INFO L226 Difference]: Without dead ends: 5816 [2023-12-19 01:33:42,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2023-12-19 01:33:42,185 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 833 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:42,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 385 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 01:33:42,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5816 states. [2023-12-19 01:33:42,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5816 to 5231. [2023-12-19 01:33:42,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5231 states, 4011 states have (on average 1.31313886811269) internal successors, (5267), 4089 states have internal predecessors, (5267), 629 states have call successors, (629), 493 states have call predecessors, (629), 589 states have return successors, (899), 654 states have call predecessors, (899), 628 states have call successors, (899) [2023-12-19 01:33:42,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5231 states to 5231 states and 6795 transitions. [2023-12-19 01:33:42,628 INFO L78 Accepts]: Start accepts. Automaton has 5231 states and 6795 transitions. Word has length 67 [2023-12-19 01:33:42,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:42,628 INFO L495 AbstractCegarLoop]: Abstraction has 5231 states and 6795 transitions. [2023-12-19 01:33:42,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 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-19 01:33:42,629 INFO L276 IsEmpty]: Start isEmpty. Operand 5231 states and 6795 transitions. [2023-12-19 01:33:42,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-19 01:33:42,630 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:42,631 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, 1] [2023-12-19 01:33:42,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-19 01:33:42,631 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:42,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:42,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1291137955, now seen corresponding path program 1 times [2023-12-19 01:33:42,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:42,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660554297] [2023-12-19 01:33:42,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:42,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:42,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:42,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:33:42,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:42,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:33:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:42,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:33:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:42,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:42,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:42,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:33:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:42,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:33:42,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:42,717 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-19 01:33:42,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:42,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660554297] [2023-12-19 01:33:42,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660554297] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:33:42,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259423057] [2023-12-19 01:33:42,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:42,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:33:42,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:33:42,721 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-19 01:33:42,729 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-19 01:33:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:42,815 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-19 01:33:42,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:33:43,042 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-19 01:33:43,042 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 01:33:43,137 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-19 01:33:43,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259423057] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 01:33:43,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 01:33:43,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2023-12-19 01:33:43,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116223673] [2023-12-19 01:33:43,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 01:33:43,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 01:33:43,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:43,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 01:33:43,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-19 01:33:43,141 INFO L87 Difference]: Start difference. First operand 5231 states and 6795 transitions. Second operand has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 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-19 01:33:44,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:44,576 INFO L93 Difference]: Finished difference Result 9203 states and 11658 transitions. [2023-12-19 01:33:44,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-19 01:33:44,577 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 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 68 [2023-12-19 01:33:44,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:44,607 INFO L225 Difference]: With dead ends: 9203 [2023-12-19 01:33:44,607 INFO L226 Difference]: Without dead ends: 9200 [2023-12-19 01:33:44,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2023-12-19 01:33:44,616 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 1293 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1346 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:44,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1346 Valid, 819 Invalid, 1306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-19 01:33:44,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9200 states. [2023-12-19 01:33:45,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9200 to 8348. [2023-12-19 01:33:45,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8348 states, 6386 states have (on average 1.2918885061071093) internal successors, (8250), 6499 states have internal predecessors, (8250), 988 states have call successors, (988), 807 states have call predecessors, (988), 972 states have return successors, (1400), 1047 states have call predecessors, (1400), 987 states have call successors, (1400) [2023-12-19 01:33:45,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8348 states to 8348 states and 10638 transitions. [2023-12-19 01:33:45,238 INFO L78 Accepts]: Start accepts. Automaton has 8348 states and 10638 transitions. Word has length 68 [2023-12-19 01:33:45,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:45,238 INFO L495 AbstractCegarLoop]: Abstraction has 8348 states and 10638 transitions. [2023-12-19 01:33:45,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 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-19 01:33:45,238 INFO L276 IsEmpty]: Start isEmpty. Operand 8348 states and 10638 transitions. [2023-12-19 01:33:45,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-19 01:33:45,240 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:45,240 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, 1] [2023-12-19 01:33:45,266 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-19 01:33:45,446 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,SelfDestructingSolverStorable14 [2023-12-19 01:33:45,447 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:45,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:45,447 INFO L85 PathProgramCache]: Analyzing trace with hash 613804699, now seen corresponding path program 2 times [2023-12-19 01:33:45,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:45,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682698985] [2023-12-19 01:33:45,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:45,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:45,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:45,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:33:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:45,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:33:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:45,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:33:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:45,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:45,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:33:45,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:45,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:33:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:45,492 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-19 01:33:45,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:45,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682698985] [2023-12-19 01:33:45,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682698985] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:45,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:33:45,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 01:33:45,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299969475] [2023-12-19 01:33:45,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:45,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 01:33:45,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:45,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 01:33:45,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:33:45,494 INFO L87 Difference]: Start difference. First operand 8348 states and 10638 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 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-19 01:33:46,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:46,213 INFO L93 Difference]: Finished difference Result 10736 states and 13641 transitions. [2023-12-19 01:33:46,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 01:33:46,214 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 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 71 [2023-12-19 01:33:46,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:46,226 INFO L225 Difference]: With dead ends: 10736 [2023-12-19 01:33:46,226 INFO L226 Difference]: Without dead ends: 5098 [2023-12-19 01:33:46,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-19 01:33:46,236 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 409 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:46,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 553 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 01:33:46,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5098 states. [2023-12-19 01:33:46,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5098 to 4162. [2023-12-19 01:33:46,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4162 states, 3206 states have (on average 1.310979413599501) internal successors, (4203), 3265 states have internal predecessors, (4203), 507 states have call successors, (507), 389 states have call predecessors, (507), 447 states have return successors, (699), 513 states have call predecessors, (699), 506 states have call successors, (699) [2023-12-19 01:33:46,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4162 states to 4162 states and 5409 transitions. [2023-12-19 01:33:46,604 INFO L78 Accepts]: Start accepts. Automaton has 4162 states and 5409 transitions. Word has length 71 [2023-12-19 01:33:46,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:46,605 INFO L495 AbstractCegarLoop]: Abstraction has 4162 states and 5409 transitions. [2023-12-19 01:33:46,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 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-19 01:33:46,605 INFO L276 IsEmpty]: Start isEmpty. Operand 4162 states and 5409 transitions. [2023-12-19 01:33:46,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-19 01:33:46,607 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:46,607 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, 1] [2023-12-19 01:33:46,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-19 01:33:46,607 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:46,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:46,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1786536504, now seen corresponding path program 1 times [2023-12-19 01:33:46,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:46,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585624105] [2023-12-19 01:33:46,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:46,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:46,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:46,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:33:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:46,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:33:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:46,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:33:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:46,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:46,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:33:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:46,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:33:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:46,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-19 01:33:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:46,701 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-19 01:33:46,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:46,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585624105] [2023-12-19 01:33:46,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585624105] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:46,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:33:46,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 01:33:46,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944510586] [2023-12-19 01:33:46,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:46,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 01:33:46,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:46,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 01:33:46,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-19 01:33:46,703 INFO L87 Difference]: Start difference. First operand 4162 states and 5409 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 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-19 01:33:47,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:47,693 INFO L93 Difference]: Finished difference Result 9480 states and 11940 transitions. [2023-12-19 01:33:47,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-19 01:33:47,693 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 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 76 [2023-12-19 01:33:47,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:47,710 INFO L225 Difference]: With dead ends: 9480 [2023-12-19 01:33:47,710 INFO L226 Difference]: Without dead ends: 6090 [2023-12-19 01:33:47,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2023-12-19 01:33:47,717 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 952 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:47,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 629 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 01:33:47,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6090 states. [2023-12-19 01:33:48,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6090 to 5830. [2023-12-19 01:33:48,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5830 states, 4439 states have (on average 1.2739355710745663) internal successors, (5655), 4535 states have internal predecessors, (5655), 707 states have call successors, (707), 561 states have call predecessors, (707), 682 states have return successors, (1049), 739 states have call predecessors, (1049), 706 states have call successors, (1049) [2023-12-19 01:33:48,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5830 states to 5830 states and 7411 transitions. [2023-12-19 01:33:48,095 INFO L78 Accepts]: Start accepts. Automaton has 5830 states and 7411 transitions. Word has length 76 [2023-12-19 01:33:48,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:48,095 INFO L495 AbstractCegarLoop]: Abstraction has 5830 states and 7411 transitions. [2023-12-19 01:33:48,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 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-19 01:33:48,095 INFO L276 IsEmpty]: Start isEmpty. Operand 5830 states and 7411 transitions. [2023-12-19 01:33:48,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-12-19 01:33:48,098 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:48,098 INFO L195 NwaCegarLoop]: trace histogram [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-19 01:33:48,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-19 01:33:48,099 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:48,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:48,099 INFO L85 PathProgramCache]: Analyzing trace with hash -870154435, now seen corresponding path program 1 times [2023-12-19 01:33:48,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:48,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597898155] [2023-12-19 01:33:48,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:48,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:48,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:48,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:48,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:33:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:48,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:33:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:48,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:33:48,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:48,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-19 01:33:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:48,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:33:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:48,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 01:33:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:48,156 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-19 01:33:48,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:48,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597898155] [2023-12-19 01:33:48,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597898155] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:33:48,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202073048] [2023-12-19 01:33:48,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:48,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:33:48,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:33:48,158 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-19 01:33:48,191 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-19 01:33:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:48,234 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:33:48,238 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:33:48,250 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-19 01:33:48,251 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:33:48,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202073048] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:48,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:33:48,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:33:48,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908416849] [2023-12-19 01:33:48,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:48,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:33:48,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:48,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:33:48,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:33:48,252 INFO L87 Difference]: Start difference. First operand 5830 states and 7411 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:33:48,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:48,747 INFO L93 Difference]: Finished difference Result 8647 states and 11540 transitions. [2023-12-19 01:33:48,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:33:48,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2023-12-19 01:33:48,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:48,770 INFO L225 Difference]: With dead ends: 8647 [2023-12-19 01:33:48,773 INFO L226 Difference]: Without dead ends: 7157 [2023-12-19 01:33:48,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:33:48,786 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 107 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:48,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 565 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:33:48,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7157 states. [2023-12-19 01:33:49,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7157 to 7157. [2023-12-19 01:33:49,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7157 states, 5482 states have (on average 1.2949653411163808) internal successors, (7099), 5595 states have internal predecessors, (7099), 866 states have call successors, (866), 667 states have call predecessors, (866), 807 states have return successors, (1348), 904 states have call predecessors, (1348), 865 states have call successors, (1348) [2023-12-19 01:33:49,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7157 states to 7157 states and 9313 transitions. [2023-12-19 01:33:49,328 INFO L78 Accepts]: Start accepts. Automaton has 7157 states and 9313 transitions. Word has length 83 [2023-12-19 01:33:49,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:49,328 INFO L495 AbstractCegarLoop]: Abstraction has 7157 states and 9313 transitions. [2023-12-19 01:33:49,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:33:49,329 INFO L276 IsEmpty]: Start isEmpty. Operand 7157 states and 9313 transitions. [2023-12-19 01:33:49,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-19 01:33:49,334 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:49,334 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, 1] [2023-12-19 01:33:49,342 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-19 01:33:49,540 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,SelfDestructingSolverStorable17 [2023-12-19 01:33:49,540 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:49,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:49,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1286896662, now seen corresponding path program 1 times [2023-12-19 01:33:49,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:49,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919100344] [2023-12-19 01:33:49,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:49,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:49,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:49,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:33:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:49,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:33:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:49,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:33:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:49,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:49,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:33:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:49,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:33:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:49,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-12-19 01:33:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:49,640 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-19 01:33:49,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:49,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919100344] [2023-12-19 01:33:49,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919100344] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:49,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:33:49,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 01:33:49,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129285549] [2023-12-19 01:33:49,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:49,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 01:33:49,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:49,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 01:33:49,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-19 01:33:49,643 INFO L87 Difference]: Start difference. First operand 7157 states and 9313 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 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-19 01:33:50,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:50,753 INFO L93 Difference]: Finished difference Result 10247 states and 13061 transitions. [2023-12-19 01:33:50,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-19 01:33:50,754 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 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 86 [2023-12-19 01:33:50,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:50,768 INFO L225 Difference]: With dead ends: 10247 [2023-12-19 01:33:50,768 INFO L226 Difference]: Without dead ends: 6404 [2023-12-19 01:33:50,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2023-12-19 01:33:50,775 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 1182 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1210 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:50,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1210 Valid, 640 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 01:33:50,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6404 states. [2023-12-19 01:33:51,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6404 to 6000. [2023-12-19 01:33:51,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6000 states, 4591 states have (on average 1.2973208451317795) internal successors, (5956), 4692 states have internal predecessors, (5956), 731 states have call successors, (731), 549 states have call predecessors, (731), 676 states have return successors, (1117), 768 states have call predecessors, (1117), 730 states have call successors, (1117) [2023-12-19 01:33:51,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6000 states to 6000 states and 7804 transitions. [2023-12-19 01:33:51,180 INFO L78 Accepts]: Start accepts. Automaton has 6000 states and 7804 transitions. Word has length 86 [2023-12-19 01:33:51,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:51,180 INFO L495 AbstractCegarLoop]: Abstraction has 6000 states and 7804 transitions. [2023-12-19 01:33:51,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 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-19 01:33:51,180 INFO L276 IsEmpty]: Start isEmpty. Operand 6000 states and 7804 transitions. [2023-12-19 01:33:51,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-19 01:33:51,186 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:51,186 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2023-12-19 01:33:51,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-19 01:33:51,186 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:51,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:51,186 INFO L85 PathProgramCache]: Analyzing trace with hash -2098998010, now seen corresponding path program 1 times [2023-12-19 01:33:51,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:51,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538292671] [2023-12-19 01:33:51,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:51,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:51,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:51,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:51,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:51,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:33:51,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:51,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:33:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:51,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:33:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:51,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-19 01:33:51,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:51,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:33:51,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:51,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-19 01:33:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:51,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:33:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:51,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-19 01:33:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:51,250 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-19 01:33:51,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:51,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538292671] [2023-12-19 01:33:51,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538292671] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:33:51,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729600648] [2023-12-19 01:33:51,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:51,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:33:51,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:33:51,251 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-19 01:33:51,280 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-19 01:33:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:51,338 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:33:51,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:33:51,419 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-19 01:33:51,419 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:33:51,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729600648] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:51,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:33:51,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-12-19 01:33:51,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814558749] [2023-12-19 01:33:51,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:51,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:33:51,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:51,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:33:51,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:33:51,421 INFO L87 Difference]: Start difference. First operand 6000 states and 7804 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-19 01:33:52,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:52,024 INFO L93 Difference]: Finished difference Result 9537 states and 12971 transitions. [2023-12-19 01:33:52,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:33:52,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 106 [2023-12-19 01:33:52,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:52,047 INFO L225 Difference]: With dead ends: 9537 [2023-12-19 01:33:52,047 INFO L226 Difference]: Without dead ends: 7398 [2023-12-19 01:33:52,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:33:52,056 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 187 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:52,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 347 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:33:52,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7398 states. [2023-12-19 01:33:52,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7398 to 7356. [2023-12-19 01:33:52,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7356 states, 5657 states have (on average 1.3155382711684638) internal successors, (7442), 5779 states have internal predecessors, (7442), 895 states have call successors, (895), 659 states have call predecessors, (895), 802 states have return successors, (1361), 927 states have call predecessors, (1361), 894 states have call successors, (1361) [2023-12-19 01:33:52,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7356 states to 7356 states and 9698 transitions. [2023-12-19 01:33:52,632 INFO L78 Accepts]: Start accepts. Automaton has 7356 states and 9698 transitions. Word has length 106 [2023-12-19 01:33:52,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:52,632 INFO L495 AbstractCegarLoop]: Abstraction has 7356 states and 9698 transitions. [2023-12-19 01:33:52,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-19 01:33:52,632 INFO L276 IsEmpty]: Start isEmpty. Operand 7356 states and 9698 transitions. [2023-12-19 01:33:52,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-19 01:33:52,642 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:52,642 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:33:52,650 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-19 01:33:52,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:33:52,851 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:52,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:52,851 INFO L85 PathProgramCache]: Analyzing trace with hash -227743173, now seen corresponding path program 1 times [2023-12-19 01:33:52,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:52,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344215846] [2023-12-19 01:33:52,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:52,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:52,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:52,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:52,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:52,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:33:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:52,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:33:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:52,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:33:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:52,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 01:33:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:52,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 01:33:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:52,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:33:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:52,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 01:33:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:52,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:33:52,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:52,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-19 01:33:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:52,927 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-12-19 01:33:52,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:52,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344215846] [2023-12-19 01:33:52,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344215846] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:33:52,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472049136] [2023-12-19 01:33:52,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:52,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:33:52,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:33:52,928 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-19 01:33:52,952 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-19 01:33:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:53,009 INFO L262 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:33:53,011 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:33:53,035 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-12-19 01:33:53,035 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:33:53,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472049136] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:53,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:33:53,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:33:53,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998734338] [2023-12-19 01:33:53,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:53,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:33:53,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:53,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:33:53,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:33:53,037 INFO L87 Difference]: Start difference. First operand 7356 states and 9698 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-19 01:33:53,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:53,563 INFO L93 Difference]: Finished difference Result 11932 states and 16445 transitions. [2023-12-19 01:33:53,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:33:53,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 121 [2023-12-19 01:33:53,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:53,584 INFO L225 Difference]: With dead ends: 11932 [2023-12-19 01:33:53,584 INFO L226 Difference]: Without dead ends: 7760 [2023-12-19 01:33:53,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:33:53,595 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 232 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:53,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 255 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:33:53,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7760 states. [2023-12-19 01:33:54,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7760 to 7665. [2023-12-19 01:33:54,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7665 states, 5941 states have (on average 1.2790775963642484) internal successors, (7599), 6058 states have internal predecessors, (7599), 891 states have call successors, (891), 685 states have call predecessors, (891), 831 states have return successors, (1343), 931 states have call predecessors, (1343), 890 states have call successors, (1343) [2023-12-19 01:33:54,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7665 states to 7665 states and 9833 transitions. [2023-12-19 01:33:54,139 INFO L78 Accepts]: Start accepts. Automaton has 7665 states and 9833 transitions. Word has length 121 [2023-12-19 01:33:54,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:54,139 INFO L495 AbstractCegarLoop]: Abstraction has 7665 states and 9833 transitions. [2023-12-19 01:33:54,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-19 01:33:54,139 INFO L276 IsEmpty]: Start isEmpty. Operand 7665 states and 9833 transitions. [2023-12-19 01:33:54,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-19 01:33:54,149 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:54,149 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:33:54,157 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-19 01:33:54,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:33:54,353 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:54,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:54,353 INFO L85 PathProgramCache]: Analyzing trace with hash -583652392, now seen corresponding path program 1 times [2023-12-19 01:33:54,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:54,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586167628] [2023-12-19 01:33:54,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:54,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:54,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:54,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:54,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:33:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:54,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:33:54,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:54,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:33:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:54,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 01:33:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:54,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 01:33:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:54,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:33:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:54,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 01:33:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:54,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:33:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:54,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-19 01:33:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:54,429 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-12-19 01:33:54,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:54,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586167628] [2023-12-19 01:33:54,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586167628] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:33:54,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834955102] [2023-12-19 01:33:54,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:54,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:33:54,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:33:54,433 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-19 01:33:54,436 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-19 01:33:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:54,518 INFO L262 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 01:33:54,524 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:33:54,549 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-19 01:33:54,549 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:33:54,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834955102] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:54,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:33:54,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:33:54,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643291043] [2023-12-19 01:33:54,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:54,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:33:54,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:54,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:33:54,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:33:54,551 INFO L87 Difference]: Start difference. First operand 7665 states and 9833 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-19 01:33:55,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:55,093 INFO L93 Difference]: Finished difference Result 12053 states and 15822 transitions. [2023-12-19 01:33:55,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:33:55,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 121 [2023-12-19 01:33:55,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:55,118 INFO L225 Difference]: With dead ends: 12053 [2023-12-19 01:33:55,118 INFO L226 Difference]: Without dead ends: 7880 [2023-12-19 01:33:55,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:33:55,130 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 212 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:55,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 358 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:33:55,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7880 states. [2023-12-19 01:33:55,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7880 to 7635. [2023-12-19 01:33:55,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7635 states, 5911 states have (on average 1.2652681441380478) internal successors, (7479), 6028 states have internal predecessors, (7479), 891 states have call successors, (891), 685 states have call predecessors, (891), 831 states have return successors, (1343), 931 states have call predecessors, (1343), 890 states have call successors, (1343) [2023-12-19 01:33:55,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7635 states to 7635 states and 9713 transitions. [2023-12-19 01:33:55,635 INFO L78 Accepts]: Start accepts. Automaton has 7635 states and 9713 transitions. Word has length 121 [2023-12-19 01:33:55,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:55,635 INFO L495 AbstractCegarLoop]: Abstraction has 7635 states and 9713 transitions. [2023-12-19 01:33:55,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-19 01:33:55,635 INFO L276 IsEmpty]: Start isEmpty. Operand 7635 states and 9713 transitions. [2023-12-19 01:33:55,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-19 01:33:55,642 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:55,643 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:33:55,650 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-19 01:33:55,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-12-19 01:33:55,848 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:55,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:55,849 INFO L85 PathProgramCache]: Analyzing trace with hash -625591146, now seen corresponding path program 1 times [2023-12-19 01:33:55,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:55,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089067482] [2023-12-19 01:33:55,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:55,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:55,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:55,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:55,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:33:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:55,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:33:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:55,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:33:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:55,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-19 01:33:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:55,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:33:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:55,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 01:33:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:55,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-19 01:33:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:55,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:33:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:55,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-19 01:33:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:55,921 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-12-19 01:33:55,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:55,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089067482] [2023-12-19 01:33:55,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089067482] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:33:55,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002358287] [2023-12-19 01:33:55,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:55,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:33:55,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:33:55,923 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-19 01:33:55,925 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-19 01:33:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:56,008 INFO L262 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:33:56,010 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:33:56,026 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-19 01:33:56,026 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:33:56,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002358287] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:56,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:33:56,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:33:56,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744380471] [2023-12-19 01:33:56,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:56,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:33:56,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:56,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:33:56,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:33:56,027 INFO L87 Difference]: Start difference. First operand 7635 states and 9713 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-19 01:33:56,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:56,749 INFO L93 Difference]: Finished difference Result 16245 states and 21461 transitions. [2023-12-19 01:33:56,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:33:56,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 122 [2023-12-19 01:33:56,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:56,784 INFO L225 Difference]: With dead ends: 16245 [2023-12-19 01:33:56,784 INFO L226 Difference]: Without dead ends: 11798 [2023-12-19 01:33:56,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:33:56,801 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 105 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:56,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 559 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:33:56,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11798 states. [2023-12-19 01:33:57,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11798 to 11796. [2023-12-19 01:33:57,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11796 states, 9186 states have (on average 1.2668190725016328) internal successors, (11637), 9368 states have internal predecessors, (11637), 1379 states have call successors, (1379), 1035 states have call predecessors, (1379), 1229 states have return successors, (2339), 1410 states have call predecessors, (2339), 1378 states have call successors, (2339) [2023-12-19 01:33:57,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11796 states to 11796 states and 15355 transitions. [2023-12-19 01:33:57,616 INFO L78 Accepts]: Start accepts. Automaton has 11796 states and 15355 transitions. Word has length 122 [2023-12-19 01:33:57,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:57,616 INFO L495 AbstractCegarLoop]: Abstraction has 11796 states and 15355 transitions. [2023-12-19 01:33:57,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-19 01:33:57,617 INFO L276 IsEmpty]: Start isEmpty. Operand 11796 states and 15355 transitions. [2023-12-19 01:33:57,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-19 01:33:57,629 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:57,630 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:33:57,637 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-19 01:33:57,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:33:57,836 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:57,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:57,837 INFO L85 PathProgramCache]: Analyzing trace with hash -331376281, now seen corresponding path program 1 times [2023-12-19 01:33:57,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:57,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889858345] [2023-12-19 01:33:57,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:57,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:57,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:57,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:57,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:57,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:57,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:33:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:57,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:33:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:57,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:33:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:57,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-19 01:33:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:57,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-19 01:33:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:57,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:33:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:57,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 01:33:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:57,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:33:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:57,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 01:33:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:57,914 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-12-19 01:33:57,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:57,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889858345] [2023-12-19 01:33:57,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889858345] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:33:57,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274088334] [2023-12-19 01:33:57,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:57,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:33:57,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:33:57,916 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:33:57,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-19 01:33:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:57,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 01:33:57,985 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:33:58,030 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-19 01:33:58,030 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:33:58,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274088334] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:33:58,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:33:58,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:33:58,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524066031] [2023-12-19 01:33:58,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:33:58,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:33:58,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:33:58,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:33:58,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:33:58,037 INFO L87 Difference]: Start difference. First operand 11796 states and 15355 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-19 01:33:58,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:33:58,797 INFO L93 Difference]: Finished difference Result 14994 states and 20001 transitions. [2023-12-19 01:33:58,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:33:58,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 123 [2023-12-19 01:33:58,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:33:58,821 INFO L225 Difference]: With dead ends: 14994 [2023-12-19 01:33:58,821 INFO L226 Difference]: Without dead ends: 10692 [2023-12-19 01:33:58,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:33:58,832 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 73 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:33:58,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 523 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:33:58,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10692 states. [2023-12-19 01:33:59,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10692 to 10562. [2023-12-19 01:33:59,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10562 states, 8218 states have (on average 1.253102944755415) internal successors, (10298), 8384 states have internal predecessors, (10298), 1235 states have call successors, (1235), 935 states have call predecessors, (1235), 1107 states have return successors, (1999), 1260 states have call predecessors, (1999), 1234 states have call successors, (1999) [2023-12-19 01:33:59,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10562 states to 10562 states and 13532 transitions. [2023-12-19 01:33:59,552 INFO L78 Accepts]: Start accepts. Automaton has 10562 states and 13532 transitions. Word has length 123 [2023-12-19 01:33:59,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:33:59,553 INFO L495 AbstractCegarLoop]: Abstraction has 10562 states and 13532 transitions. [2023-12-19 01:33:59,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-19 01:33:59,553 INFO L276 IsEmpty]: Start isEmpty. Operand 10562 states and 13532 transitions. [2023-12-19 01:33:59,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-19 01:33:59,564 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:33:59,565 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:33:59,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-19 01:33:59,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:33:59,769 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:33:59,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:33:59,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1388399477, now seen corresponding path program 1 times [2023-12-19 01:33:59,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:33:59,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078520061] [2023-12-19 01:33:59,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:59,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:33:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:59,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:33:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:59,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:33:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:59,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:33:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:59,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:33:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:59,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:33:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:59,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-19 01:33:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:59,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-19 01:33:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:59,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:33:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:59,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 01:33:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:59,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:33:59,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:59,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-19 01:33:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:59,846 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-12-19 01:33:59,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:33:59,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078520061] [2023-12-19 01:33:59,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078520061] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:33:59,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738043919] [2023-12-19 01:33:59,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:33:59,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:33:59,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:33:59,847 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:33:59,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-19 01:33:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:33:59,934 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-19 01:33:59,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:34:00,014 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-12-19 01:34:00,015 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:34:00,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738043919] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:00,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:34:00,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-12-19 01:34:00,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277712217] [2023-12-19 01:34:00,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:00,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 01:34:00,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:00,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 01:34:00,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-19 01:34:00,016 INFO L87 Difference]: Start difference. First operand 10562 states and 13532 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:34:00,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:00,834 INFO L93 Difference]: Finished difference Result 13680 states and 17820 transitions. [2023-12-19 01:34:00,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 01:34:00,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 124 [2023-12-19 01:34:00,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:00,856 INFO L225 Difference]: With dead ends: 13680 [2023-12-19 01:34:00,856 INFO L226 Difference]: Without dead ends: 9082 [2023-12-19 01:34:00,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-19 01:34:00,870 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 282 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:00,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 331 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 01:34:00,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9082 states. [2023-12-19 01:34:01,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9082 to 9022. [2023-12-19 01:34:01,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9022 states, 6998 states have (on average 1.2222063446699056) internal successors, (8553), 7118 states have internal predecessors, (8553), 1075 states have call successors, (1075), 815 states have call predecessors, (1075), 947 states have return successors, (1626), 1098 states have call predecessors, (1626), 1074 states have call successors, (1626) [2023-12-19 01:34:01,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9022 states to 9022 states and 11254 transitions. [2023-12-19 01:34:01,466 INFO L78 Accepts]: Start accepts. Automaton has 9022 states and 11254 transitions. Word has length 124 [2023-12-19 01:34:01,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:01,466 INFO L495 AbstractCegarLoop]: Abstraction has 9022 states and 11254 transitions. [2023-12-19 01:34:01,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:34:01,466 INFO L276 IsEmpty]: Start isEmpty. Operand 9022 states and 11254 transitions. [2023-12-19 01:34:01,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-19 01:34:01,472 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:01,472 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:34:01,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-19 01:34:01,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-12-19 01:34:01,673 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:01,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:01,673 INFO L85 PathProgramCache]: Analyzing trace with hash 504890487, now seen corresponding path program 1 times [2023-12-19 01:34:01,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:01,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676434542] [2023-12-19 01:34:01,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:01,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:01,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:01,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:01,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:01,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:34:01,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:01,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:34:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:01,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:34:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:01,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-19 01:34:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:01,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-19 01:34:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:01,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:01,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 01:34:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:01,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:01,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:01,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-19 01:34:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:01,754 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-12-19 01:34:01,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:01,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676434542] [2023-12-19 01:34:01,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676434542] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:34:01,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258507619] [2023-12-19 01:34:01,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:01,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:34:01,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:34:01,756 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:34:01,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-19 01:34:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:01,835 INFO L262 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-19 01:34:01,839 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:34:01,893 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-12-19 01:34:01,893 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:34:01,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258507619] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:01,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:34:01,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-12-19 01:34:01,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596245899] [2023-12-19 01:34:01,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:01,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 01:34:01,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:01,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 01:34:01,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-19 01:34:01,895 INFO L87 Difference]: Start difference. First operand 9022 states and 11254 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:34:02,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:02,667 INFO L93 Difference]: Finished difference Result 13976 states and 17854 transitions. [2023-12-19 01:34:02,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 01:34:02,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 124 [2023-12-19 01:34:02,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:02,688 INFO L225 Difference]: With dead ends: 13976 [2023-12-19 01:34:02,688 INFO L226 Difference]: Without dead ends: 8406 [2023-12-19 01:34:02,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-12-19 01:34:02,699 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 300 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:02,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 326 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 01:34:02,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8406 states. [2023-12-19 01:34:03,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8406 to 6580. [2023-12-19 01:34:03,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6580 states, 5092 states have (on average 1.1908876669285153) internal successors, (6064), 5180 states have internal predecessors, (6064), 775 states have call successors, (775), 599 states have call predecessors, (775), 711 states have return successors, (1147), 806 states have call predecessors, (1147), 774 states have call successors, (1147) [2023-12-19 01:34:03,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6580 states to 6580 states and 7986 transitions. [2023-12-19 01:34:03,184 INFO L78 Accepts]: Start accepts. Automaton has 6580 states and 7986 transitions. Word has length 124 [2023-12-19 01:34:03,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:03,184 INFO L495 AbstractCegarLoop]: Abstraction has 6580 states and 7986 transitions. [2023-12-19 01:34:03,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:34:03,184 INFO L276 IsEmpty]: Start isEmpty. Operand 6580 states and 7986 transitions. [2023-12-19 01:34:03,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-19 01:34:03,188 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:03,188 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:34:03,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-19 01:34:03,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-12-19 01:34:03,390 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:03,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:03,390 INFO L85 PathProgramCache]: Analyzing trace with hash 476390197, now seen corresponding path program 1 times [2023-12-19 01:34:03,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:03,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82193739] [2023-12-19 01:34:03,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:03,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:03,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:03,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:03,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:34:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:03,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:34:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:03,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:34:03,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:03,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-19 01:34:03,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:03,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-19 01:34:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:03,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:03,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 01:34:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:03,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:03,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-19 01:34:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:03,462 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-12-19 01:34:03,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:03,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82193739] [2023-12-19 01:34:03,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82193739] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:34:03,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862934331] [2023-12-19 01:34:03,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:03,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:34:03,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:34:03,464 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:34:03,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-19 01:34:03,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:03,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-19 01:34:03,545 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:34:03,564 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-12-19 01:34:03,564 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:34:03,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862934331] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:03,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:34:03,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-19 01:34:03,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092296042] [2023-12-19 01:34:03,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:03,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 01:34:03,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:03,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 01:34:03,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:34:03,565 INFO L87 Difference]: Start difference. First operand 6580 states and 7986 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:34:04,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:04,004 INFO L93 Difference]: Finished difference Result 8962 states and 11044 transitions. [2023-12-19 01:34:04,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 01:34:04,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 124 [2023-12-19 01:34:04,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:04,014 INFO L225 Difference]: With dead ends: 8962 [2023-12-19 01:34:04,014 INFO L226 Difference]: Without dead ends: 5017 [2023-12-19 01:34:04,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:34:04,020 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 11 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:04,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 674 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:34:04,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5017 states. [2023-12-19 01:34:04,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5017 to 5017. [2023-12-19 01:34:04,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5017 states, 3857 states have (on average 1.1817474721285974) internal successors, (4558), 3927 states have internal predecessors, (4558), 585 states have call successors, (585), 469 states have call predecessors, (585), 573 states have return successors, (804), 624 states have call predecessors, (804), 584 states have call successors, (804) [2023-12-19 01:34:04,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5017 states to 5017 states and 5947 transitions. [2023-12-19 01:34:04,375 INFO L78 Accepts]: Start accepts. Automaton has 5017 states and 5947 transitions. Word has length 124 [2023-12-19 01:34:04,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:04,375 INFO L495 AbstractCegarLoop]: Abstraction has 5017 states and 5947 transitions. [2023-12-19 01:34:04,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:34:04,375 INFO L276 IsEmpty]: Start isEmpty. Operand 5017 states and 5947 transitions. [2023-12-19 01:34:04,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-19 01:34:04,378 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:04,378 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:34:04,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-19 01:34:04,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-12-19 01:34:04,578 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:04,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:04,579 INFO L85 PathProgramCache]: Analyzing trace with hash -18663819, now seen corresponding path program 1 times [2023-12-19 01:34:04,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:04,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645938969] [2023-12-19 01:34:04,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:04,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:04,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:04,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:04,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:34:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:04,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:34:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:04,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:34:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:04,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-19 01:34:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:04,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-19 01:34:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:04,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:04,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 01:34:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:04,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:04,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-19 01:34:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:04,638 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-19 01:34:04,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:04,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645938969] [2023-12-19 01:34:04,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645938969] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:34:04,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946365020] [2023-12-19 01:34:04,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:04,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:34:04,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:34:04,639 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:34:04,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-19 01:34:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:04,724 INFO L262 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-19 01:34:04,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:34:04,735 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-12-19 01:34:04,736 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:34:04,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946365020] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:04,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:34:04,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-19 01:34:04,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137464528] [2023-12-19 01:34:04,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:04,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 01:34:04,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:04,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 01:34:04,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:34:04,737 INFO L87 Difference]: Start difference. First operand 5017 states and 5947 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:34:05,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:05,108 INFO L93 Difference]: Finished difference Result 6100 states and 7255 transitions. [2023-12-19 01:34:05,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 01:34:05,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 124 [2023-12-19 01:34:05,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:05,117 INFO L225 Difference]: With dead ends: 6100 [2023-12-19 01:34:05,117 INFO L226 Difference]: Without dead ends: 3895 [2023-12-19 01:34:05,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:34:05,121 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 2 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:05,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 673 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:34:05,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3895 states. [2023-12-19 01:34:05,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3895 to 3895. [2023-12-19 01:34:05,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3895 states, 2956 states have (on average 1.1830175913396481) internal successors, (3497), 3015 states have internal predecessors, (3497), 461 states have call successors, (461), 380 states have call predecessors, (461), 476 states have return successors, (621), 502 states have call predecessors, (621), 460 states have call successors, (621) [2023-12-19 01:34:05,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3895 states to 3895 states and 4579 transitions. [2023-12-19 01:34:05,443 INFO L78 Accepts]: Start accepts. Automaton has 3895 states and 4579 transitions. Word has length 124 [2023-12-19 01:34:05,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:05,443 INFO L495 AbstractCegarLoop]: Abstraction has 3895 states and 4579 transitions. [2023-12-19 01:34:05,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:34:05,444 INFO L276 IsEmpty]: Start isEmpty. Operand 3895 states and 4579 transitions. [2023-12-19 01:34:05,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-19 01:34:05,446 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:05,446 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:34:05,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-19 01:34:05,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-12-19 01:34:05,646 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:05,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:05,647 INFO L85 PathProgramCache]: Analyzing trace with hash 564461877, now seen corresponding path program 1 times [2023-12-19 01:34:05,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:05,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882100692] [2023-12-19 01:34:05,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:05,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:05,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:05,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:05,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:05,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:05,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-19 01:34:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:05,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 01:34:05,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:05,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 01:34:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:05,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-19 01:34:05,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:05,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-19 01:34:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:05,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:05,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:05,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 01:34:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:05,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:05,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-19 01:34:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:05,742 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-12-19 01:34:05,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:05,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882100692] [2023-12-19 01:34:05,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882100692] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:05,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:34:05,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 01:34:05,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194262450] [2023-12-19 01:34:05,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:05,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 01:34:05,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:05,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 01:34:05,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:34:05,744 INFO L87 Difference]: Start difference. First operand 3895 states and 4579 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-19 01:34:06,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:06,414 INFO L93 Difference]: Finished difference Result 4052 states and 4754 transitions. [2023-12-19 01:34:06,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 01:34:06,414 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 124 [2023-12-19 01:34:06,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:06,421 INFO L225 Difference]: With dead ends: 4052 [2023-12-19 01:34:06,421 INFO L226 Difference]: Without dead ends: 3175 [2023-12-19 01:34:06,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-12-19 01:34:06,423 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 526 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:06,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 517 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 01:34:06,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3175 states. [2023-12-19 01:34:06,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3175 to 3175. [2023-12-19 01:34:06,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3175 states, 2381 states have (on average 1.1978160436791263) internal successors, (2852), 2432 states have internal predecessors, (2852), 378 states have call successors, (378), 323 states have call predecessors, (378), 415 states have return successors, (527), 421 states have call predecessors, (527), 377 states have call successors, (527) [2023-12-19 01:34:06,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3175 states to 3175 states and 3757 transitions. [2023-12-19 01:34:06,678 INFO L78 Accepts]: Start accepts. Automaton has 3175 states and 3757 transitions. Word has length 124 [2023-12-19 01:34:06,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:06,678 INFO L495 AbstractCegarLoop]: Abstraction has 3175 states and 3757 transitions. [2023-12-19 01:34:06,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-19 01:34:06,678 INFO L276 IsEmpty]: Start isEmpty. Operand 3175 states and 3757 transitions. [2023-12-19 01:34:06,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-19 01:34:06,679 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:06,679 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, 1] [2023-12-19 01:34:06,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-19 01:34:06,680 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:06,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:06,680 INFO L85 PathProgramCache]: Analyzing trace with hash -2135958772, now seen corresponding path program 1 times [2023-12-19 01:34:06,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:06,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670094452] [2023-12-19 01:34:06,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:06,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:06,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:06,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:34:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:06,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:34:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:06,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:34:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:06,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:06,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:34:06,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:06,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:34:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:06,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-19 01:34:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:06,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-19 01:34:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:06,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 01:34:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:06,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 01:34:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:06,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:34:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:06,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:06,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-19 01:34:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:06,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-19 01:34:06,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:06,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 01:34:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:06,832 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-19 01:34:06,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:06,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670094452] [2023-12-19 01:34:06,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670094452] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:34:06,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931606109] [2023-12-19 01:34:06,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:06,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:34:06,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:34:06,845 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:34:06,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-19 01:34:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:06,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-19 01:34:06,943 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:34:06,963 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-19 01:34:06,964 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:34:06,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931606109] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:06,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:34:06,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2023-12-19 01:34:06,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184634361] [2023-12-19 01:34:06,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:06,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 01:34:06,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:06,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 01:34:06,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-12-19 01:34:06,965 INFO L87 Difference]: Start difference. First operand 3175 states and 3757 transitions. Second operand has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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-19 01:34:07,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:07,149 INFO L93 Difference]: Finished difference Result 4888 states and 5834 transitions. [2023-12-19 01:34:07,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 01:34:07,150 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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 131 [2023-12-19 01:34:07,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:07,153 INFO L225 Difference]: With dead ends: 4888 [2023-12-19 01:34:07,153 INFO L226 Difference]: Without dead ends: 1728 [2023-12-19 01:34:07,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 159 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-19 01:34:07,157 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 32 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:07,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 529 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:34:07,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2023-12-19 01:34:07,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1606. [2023-12-19 01:34:07,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1258 states have (on average 1.1915739268680445) internal successors, (1499), 1272 states have internal predecessors, (1499), 167 states have call successors, (167), 137 states have call predecessors, (167), 180 states have return successors, (234), 196 states have call predecessors, (234), 166 states have call successors, (234) [2023-12-19 01:34:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1900 transitions. [2023-12-19 01:34:07,278 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1900 transitions. Word has length 131 [2023-12-19 01:34:07,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:07,278 INFO L495 AbstractCegarLoop]: Abstraction has 1606 states and 1900 transitions. [2023-12-19 01:34:07,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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-19 01:34:07,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1900 transitions. [2023-12-19 01:34:07,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-19 01:34:07,280 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:07,280 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, 1] [2023-12-19 01:34:07,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-19 01:34:07,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:34:07,486 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:07,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:07,487 INFO L85 PathProgramCache]: Analyzing trace with hash 584859742, now seen corresponding path program 1 times [2023-12-19 01:34:07,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:07,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245333288] [2023-12-19 01:34:07,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:07,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:07,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:07,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:34:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:07,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:34:07,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:07,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:34:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:07,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:07,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:34:07,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:07,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:34:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:07,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-19 01:34:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:07,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-12-19 01:34:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:07,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-19 01:34:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:07,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 01:34:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:07,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:34:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:07,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:07,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:07,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-19 01:34:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:07,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-12-19 01:34:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:07,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-19 01:34:07,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:07,547 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-19 01:34:07,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:07,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245333288] [2023-12-19 01:34:07,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245333288] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:07,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:34:07,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 01:34:07,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532274740] [2023-12-19 01:34:07,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:07,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 01:34:07,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:07,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 01:34:07,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:34:07,549 INFO L87 Difference]: Start difference. First operand 1606 states and 1900 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 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-19 01:34:07,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:07,762 INFO L93 Difference]: Finished difference Result 1654 states and 1950 transitions. [2023-12-19 01:34:07,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 01:34:07,762 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 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 133 [2023-12-19 01:34:07,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:07,764 INFO L225 Difference]: With dead ends: 1654 [2023-12-19 01:34:07,764 INFO L226 Difference]: Without dead ends: 1314 [2023-12-19 01:34:07,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 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-19 01:34:07,765 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 248 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:07,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 139 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 01:34:07,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2023-12-19 01:34:07,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1269. [2023-12-19 01:34:07,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 1005 states have (on average 1.2009950248756218) internal successors, (1207), 1016 states have internal predecessors, (1207), 126 states have call successors, (126), 102 states have call predecessors, (126), 137 states have return successors, (179), 150 states have call predecessors, (179), 125 states have call successors, (179) [2023-12-19 01:34:07,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 1512 transitions. [2023-12-19 01:34:07,859 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 1512 transitions. Word has length 133 [2023-12-19 01:34:07,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:07,860 INFO L495 AbstractCegarLoop]: Abstraction has 1269 states and 1512 transitions. [2023-12-19 01:34:07,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 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-19 01:34:07,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 1512 transitions. [2023-12-19 01:34:07,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-19 01:34:07,861 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:07,861 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, 1] [2023-12-19 01:34:07,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-19 01:34:07,861 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:07,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:07,862 INFO L85 PathProgramCache]: Analyzing trace with hash -2138979480, now seen corresponding path program 1 times [2023-12-19 01:34:07,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:07,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430405146] [2023-12-19 01:34:07,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:07,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:07,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:07,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:07,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:34:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:07,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:34:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:07,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:34:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:07,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:07,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:34:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:07,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:34:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:07,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 01:34:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:07,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 01:34:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:07,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-19 01:34:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:07,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 01:34:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:07,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:34:07,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:07,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:07,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-19 01:34:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:07,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-19 01:34:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:07,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-12-19 01:34:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:07,924 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-19 01:34:07,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:07,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430405146] [2023-12-19 01:34:07,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430405146] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:07,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:34:07,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:34:07,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466779970] [2023-12-19 01:34:07,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:07,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:34:07,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:07,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:34:07,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:34:07,926 INFO L87 Difference]: Start difference. First operand 1269 states and 1512 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 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-19 01:34:08,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:08,195 INFO L93 Difference]: Finished difference Result 2420 states and 2896 transitions. [2023-12-19 01:34:08,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 01:34:08,196 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 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 145 [2023-12-19 01:34:08,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:08,197 INFO L225 Difference]: With dead ends: 2420 [2023-12-19 01:34:08,197 INFO L226 Difference]: Without dead ends: 1249 [2023-12-19 01:34:08,199 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-19 01:34:08,199 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 137 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:08,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 373 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 01:34:08,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2023-12-19 01:34:08,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1168. [2023-12-19 01:34:08,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 928 states have (on average 1.206896551724138) internal successors, (1120), 939 states have internal predecessors, (1120), 114 states have call successors, (114), 92 states have call predecessors, (114), 125 states have return successors, (161), 136 states have call predecessors, (161), 113 states have call successors, (161) [2023-12-19 01:34:08,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1395 transitions. [2023-12-19 01:34:08,288 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1395 transitions. Word has length 145 [2023-12-19 01:34:08,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:08,288 INFO L495 AbstractCegarLoop]: Abstraction has 1168 states and 1395 transitions. [2023-12-19 01:34:08,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 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-19 01:34:08,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1395 transitions. [2023-12-19 01:34:08,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-19 01:34:08,290 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:08,290 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, 1] [2023-12-19 01:34:08,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-19 01:34:08,290 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:08,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:08,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1972482544, now seen corresponding path program 1 times [2023-12-19 01:34:08,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:08,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103501792] [2023-12-19 01:34:08,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:08,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:08,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:08,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:34:08,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:08,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:34:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:08,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:34:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:08,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:08,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:34:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:08,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:34:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:08,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 01:34:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:08,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 01:34:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:08,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 01:34:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:08,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 01:34:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:08,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:34:08,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:08,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:08,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-19 01:34:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:08,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-19 01:34:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:08,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-19 01:34:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:08,423 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-19 01:34:08,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:08,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103501792] [2023-12-19 01:34:08,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103501792] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:34:08,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217434507] [2023-12-19 01:34:08,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:08,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:34:08,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:34:08,424 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:34:08,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-19 01:34:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:08,516 INFO L262 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-19 01:34:08,518 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:34:08,614 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-19 01:34:08,614 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 01:34:08,768 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-19 01:34:08,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217434507] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 01:34:08,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 01:34:08,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2023-12-19 01:34:08,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612294356] [2023-12-19 01:34:08,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 01:34:08,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-19 01:34:08,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:08,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-19 01:34:08,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2023-12-19 01:34:08,770 INFO L87 Difference]: Start difference. First operand 1168 states and 1395 transitions. Second operand has 14 states, 14 states have (on average 16.0) internal successors, (224), 12 states have internal predecessors, (224), 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-19 01:34:09,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:09,445 INFO L93 Difference]: Finished difference Result 2759 states and 3389 transitions. [2023-12-19 01:34:09,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-19 01:34:09,445 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 16.0) internal successors, (224), 12 states have internal predecessors, (224), 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 147 [2023-12-19 01:34:09,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:09,448 INFO L225 Difference]: With dead ends: 2759 [2023-12-19 01:34:09,448 INFO L226 Difference]: Without dead ends: 1536 [2023-12-19 01:34:09,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 327 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2023-12-19 01:34:09,451 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 591 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:09,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 364 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 01:34:09,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2023-12-19 01:34:09,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1428. [2023-12-19 01:34:09,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 1113 states have (on average 1.1725067385444743) internal successors, (1305), 1125 states have internal predecessors, (1305), 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-19 01:34:09,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1689 transitions. [2023-12-19 01:34:09,596 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1689 transitions. Word has length 147 [2023-12-19 01:34:09,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:09,597 INFO L495 AbstractCegarLoop]: Abstraction has 1428 states and 1689 transitions. [2023-12-19 01:34:09,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 16.0) internal successors, (224), 12 states have internal predecessors, (224), 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-19 01:34:09,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1689 transitions. [2023-12-19 01:34:09,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2023-12-19 01:34:09,599 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:09,599 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, 1] [2023-12-19 01:34:09,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-12-19 01:34:09,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-12-19 01:34:09,800 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:09,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:09,800 INFO L85 PathProgramCache]: Analyzing trace with hash -2132921149, now seen corresponding path program 1 times [2023-12-19 01:34:09,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:09,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184426382] [2023-12-19 01:34:09,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:09,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:09,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:09,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:34:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:09,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:34:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:09,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:34:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:09,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:09,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:34:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:09,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:34:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:09,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 01:34:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:09,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 01:34:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:09,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 01:34:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:09,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 01:34:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:09,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:34:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:09,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:09,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 01:34:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:09,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 01:34:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:09,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-19 01:34:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:09,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-12-19 01:34:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:09,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-12-19 01:34:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:09,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-12-19 01:34:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:09,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-12-19 01:34:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:09,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:34:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:09,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:09,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2023-12-19 01:34:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:09,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2023-12-19 01:34:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:09,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-12-19 01:34:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:09,910 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-19 01:34:09,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:09,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184426382] [2023-12-19 01:34:09,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184426382] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:34:09,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833889048] [2023-12-19 01:34:09,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:09,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:34:09,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:34:09,912 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:34:09,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-19 01:34:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:10,035 INFO L262 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-19 01:34:10,044 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:34:10,122 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-19 01:34:10,123 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 01:34:10,312 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-19 01:34:10,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833889048] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 01:34:10,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 01:34:10,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2023-12-19 01:34:10,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839290831] [2023-12-19 01:34:10,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 01:34:10,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 01:34:10,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:10,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 01:34:10,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-12-19 01:34:10,314 INFO L87 Difference]: Start difference. First operand 1428 states and 1689 transitions. Second operand has 11 states, 11 states have (on average 18.818181818181817) internal successors, (207), 8 states have internal predecessors, (207), 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-19 01:34:10,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:10,814 INFO L93 Difference]: Finished difference Result 1759 states and 2061 transitions. [2023-12-19 01:34:10,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-19 01:34:10,815 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 18.818181818181817) internal successors, (207), 8 states have internal predecessors, (207), 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 230 [2023-12-19 01:34:10,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:10,815 INFO L225 Difference]: With dead ends: 1759 [2023-12-19 01:34:10,815 INFO L226 Difference]: Without dead ends: 0 [2023-12-19 01:34:10,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 505 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2023-12-19 01:34:10,818 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 335 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:10,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 287 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 01:34:10,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-19 01:34:10,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-19 01:34:10,818 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-19 01:34:10,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-19 01:34:10,819 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 230 [2023-12-19 01:34:10,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:10,819 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-19 01:34:10,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.818181818181817) internal successors, (207), 8 states have internal predecessors, (207), 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-19 01:34:10,819 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-19 01:34:10,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-19 01:34:10,821 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-19 01:34:10,822 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-19 01:34:10,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-12-19 01:34:11,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:34:11,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-19 01:34:24,802 WARN L293 SmtUtils]: Spent 9.22s on a formula simplification. DAG size of input: 126 DAG size of output: 134 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-19 01:34:53,663 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 812 822) no Hoare annotation was computed. [2023-12-19 01:34:53,664 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 812 822) no Hoare annotation was computed. [2023-12-19 01:34:53,664 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 812 822) the Hoare annotation is: (let ((.cse5 (< ~E_M~0 2)) (.cse0 (< ~T1_E~0 2)) (.cse1 (not (= ~q_req_up~0 0))) (.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~c_dr_pc~0 0))) (.cse4 (and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))) (.cse13 (not (= ~t1_pc~0 1))) (.cse6 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse7 (not (= ~p_num_write~0 0))) (.cse8 (not (= ~p_dw_pc~0 0))) (.cse9 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (not (= ~c_num_read~0 0))) (.cse11 (not (= ~q_free~0 0))) (.cse14 (< |old(~m_st~0)| 2)) (.cse15 (< ~E_1~0 2)) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 (not (= ~m_pc~0 ~t1_pc~0)) .cse2 (< 0 ~t1_pc~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse2 .cse3 .cse4 (< |old(~t1_st~0)| 2) .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ~token~0 ~local~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 .cse12 (and (<= 1 ~m_pc~0) (< ~m_pc~0 2))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 (not (= (+ ~local~0 1) ~token~0)) .cse12))) [2023-12-19 01:34:53,664 INFO L899 garLoopResultBuilder]: For program point update_channels1EXIT(lines 226 240) no Hoare annotation was computed. [2023-12-19 01:34:53,664 INFO L899 garLoopResultBuilder]: For program point L48-1(lines 48 52) no Hoare annotation was computed. [2023-12-19 01:34:53,664 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 47) no Hoare annotation was computed. [2023-12-19 01:34:53,665 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 226 240) the Hoare annotation is: (let ((.cse25 (= ~c_dr_pc~0 1)) (.cse17 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse36 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse15 (= ~q_ev~0 |old(~q_ev~0)|)) (.cse16 (= ~q_req_up~0 0)) (.cse18 (= ~q_read_ev~0 2))) (let ((.cse26 (= ~m_pc~0 1)) (.cse29 (not (= ~c_dr_pc~0 0))) (.cse30 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) (.cse31 (not (= ~p_num_write~0 0))) (.cse32 (not (= ~p_dw_pc~0 0))) (.cse33 (not (= ~c_num_read~0 0))) (.cse34 (and .cse15 .cse16 (= ~q_write_ev~0 2) .cse18)) (.cse3 (< |old(~q_write_ev~0)| 2)) (.cse27 (not (= |old(~q_req_up~0)| 1))) (.cse20 (and .cse15 .cse17 (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse36)) (.cse21 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse22 (not .cse25)) (.cse23 (not (= ~q_free~0 1))) (.cse35 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (< 0 ~t1_pc~0)) (.cse4 (not (= ~M_E~0 2))) (.cse24 (and .cse15 .cse17 .cse36 .cse18)) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse7 (not (= ~q_free~0 0))) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (not (= ~T1_E~0 ~M_E~0))) (.cse10 (not (= ~m_st~0 0))) (.cse11 (not (= |old(~q_read_ev~0)| 2))) (.cse12 (< ~E_1~0 2)) (.cse13 (not (= ~p_dw_i~0 1))) (.cse14 (not (= |old(~q_req_up~0)| 0))) (.cse28 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse19 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (and .cse15 .cse16 .cse17 .cse18) .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse21 .cse8 .cse9 .cse10 .cse22 .cse12 .cse13 .cse23 .cse14 .cse19) (or .cse0 .cse1 .cse4 .cse24 .cse5 .cse25 .cse6 .cse26 .cse7 .cse9 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse27 .cse5 .cse6 .cse7 .cse8 (and (= ~q_req_up~0 1) .cse15 .cse17 .cse18) .cse9 .cse10 .cse11 .cse12 .cse13 .cse28 .cse19) (or .cse0 .cse1 .cse4 .cse29 .cse30 .cse5 .cse31 .cse32 .cse6 .cse26 .cse33 .cse34 .cse9 .cse11 .cse23 .cse14 .cse35) (or .cse1 (not .cse8) .cse2 .cse4 .cse29 .cse30 .cse5 .cse31 .cse32 .cse6 .cse33 .cse34 .cse9 .cse10 .cse11 .cse12 .cse13 .cse23 .cse14 .cse35 .cse19) (or .cse0 (< |old(~q_read_ev~0)| 1) .cse1 .cse2 .cse3 .cse4 .cse27 .cse20 .cse5 .cse6 .cse21 .cse8 .cse9 .cse10 .cse22 .cse12 .cse13 .cse23 .cse35 .cse19) (or .cse0 .cse1 .cse2 .cse4 .cse24 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= |old(~q_write_ev~0)| 0) .cse14 .cse28 .cse19)))) [2023-12-19 01:34:53,665 INFO L899 garLoopResultBuilder]: For program point L43-2(lines 42 57) no Hoare annotation was computed. [2023-12-19 01:34:53,665 INFO L899 garLoopResultBuilder]: For program point L230-1(lines 226 240) no Hoare annotation was computed. [2023-12-19 01:34:53,665 INFO L899 garLoopResultBuilder]: For program point L803-2(lines 787 811) no Hoare annotation was computed. [2023-12-19 01:34:53,665 INFO L899 garLoopResultBuilder]: For program point L795(lines 795 799) no Hoare annotation was computed. [2023-12-19 01:34:53,665 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 606) no Hoare annotation was computed. [2023-12-19 01:34:53,665 INFO L899 garLoopResultBuilder]: For program point L795-2(lines 795 799) no Hoare annotation was computed. [2023-12-19 01:34:53,665 INFO L899 garLoopResultBuilder]: For program point L630(lines 618 632) no Hoare annotation was computed. [2023-12-19 01:34:53,665 INFO L899 garLoopResultBuilder]: For program point L620(lines 620 625) no Hoare annotation was computed. [2023-12-19 01:34:53,665 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 787 811) the Hoare annotation is: (let ((.cse18 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse16 (not (= ~token~0 ~local~0))) (.cse19 (< |old(~t1_st~0)| 2)) (.cse5 (not (= ~t1_pc~0 1))) (.cse20 (not (= (+ ~local~0 1) ~token~0))) (.cse0 (< ~T1_E~0 2)) (.cse1 (not (= ~q_req_up~0 0))) (.cse2 (not (= ~p_dw_st~0 0))) (.cse17 (< 0 ~t1_pc~0)) (.cse3 (not (= ~c_dr_pc~0 0))) (.cse4 (and .cse18 (= ~m_st~0 |old(~m_st~0)|))) (.cse6 (< ~E_M~0 2)) (.cse7 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse8 (not (= ~p_num_write~0 0))) (.cse9 (not (= ~p_dw_pc~0 0))) (.cse10 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse11 (not (= ~c_num_read~0 0))) (.cse12 (not (= ~q_free~0 0))) (.cse13 (< |old(~m_st~0)| 2)) (.cse14 (< ~E_1~0 2)) (.cse15 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 (not (= ~m_pc~0 ~t1_pc~0)) .cse2 .cse17 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15) (or .cse0 (and .cse18 (= ~m_st~0 0)) .cse1 .cse2 .cse3 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= |old(~m_st~0)| 0)) .cse14 .cse20 .cse15) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (and (<= 1 ~m_pc~0) (< ~m_pc~0 2))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse20 .cse15) (or .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)))) [2023-12-19 01:34:53,665 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 787 811) no Hoare annotation was computed. [2023-12-19 01:34:53,666 INFO L899 garLoopResultBuilder]: For program point L600(lines 600 609) no Hoare annotation was computed. [2023-12-19 01:34:53,666 INFO L899 garLoopResultBuilder]: For program point L600-2(lines 600 609) no Hoare annotation was computed. [2023-12-19 01:34:53,666 INFO L899 garLoopResultBuilder]: For program point L619(lines 619 628) no Hoare annotation was computed. [2023-12-19 01:34:53,666 INFO L899 garLoopResultBuilder]: For program point L619-2(lines 619 628) no Hoare annotation was computed. [2023-12-19 01:34:53,666 INFO L899 garLoopResultBuilder]: For program point L611(lines 599 613) no Hoare annotation was computed. [2023-12-19 01:34:53,666 INFO L899 garLoopResultBuilder]: For program point L803(lines 803 807) no Hoare annotation was computed. [2023-12-19 01:34:53,666 INFO L895 garLoopResultBuilder]: At program point L321(line 321) the Hoare annotation is: (let ((.cse22 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse17 (not (= ~c_dr_pc~0 0))) (.cse18 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse19 (not (= ~p_num_write~0 0))) (.cse20 (not (= ~p_dw_pc~0 0))) (.cse26 (= ~m_pc~0 1)) (.cse21 (not (= ~c_num_read~0 0))) (.cse24 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse25 (= ~c_dr_pc~0 1)) (.cse23 (not (= ~q_free~0 1))) (.cse14 (< ~q_write_ev~0 2)) (.cse0 (not (= ~q_req_up~0 0))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (< 0 ~t1_pc~0)) (.cse3 (not (= ~M_E~0 2))) (.cse4 (= |old(~p_dw_st~0)| 0)) (.cse5 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse22)) (.cse6 (not (= ~E_M~0 ~M_E~0))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (= ~q_free~0 0))) (.cse9 (not (= ~T1_E~0 ~M_E~0))) (.cse10 (not (= ~m_st~0 0))) (.cse11 (< ~E_1~0 2)) (.cse12 (not (= ~p_dw_i~0 1))) (.cse13 (= |old(~c_dr_st~0)| 0)) (.cse15 (not (= ~q_read_ev~0 2))) (.cse16 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse17 .cse6 .cse18 .cse19 .cse20 .cse7 .cse21 .cse9 .cse10 (and .cse22 (= ~p_dw_st~0 0)) .cse11 .cse12 .cse23 (not .cse4) .cse15 .cse24 .cse16) (or .cse1 .cse3 .cse5 .cse6 .cse25 .cse7 .cse26 .cse8 .cse9 .cse13 .cse15) (or .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse18 .cse19 .cse20 .cse7 .cse26 .cse21 .cse9 .cse23 .cse13 .cse15 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~c_num_read~0 ~p_num_write~0)) .cse9 .cse10 (not .cse25) .cse11 .cse12 .cse23 .cse13 .cse14 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~q_write_ev~0 0) .cse11 .cse12 .cse13 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse15 .cse16)))) [2023-12-19 01:34:53,666 INFO L895 garLoopResultBuilder]: At program point L323-2(lines 323 327) the Hoare annotation is: (let ((.cse28 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse20 (= activate_threads1_~tmp~1 0)) (.cse21 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse3 (= ~c_dr_pc~0 1))) (let ((.cse12 (not (= ~c_dr_pc~0 0))) (.cse13 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse14 (not (= ~p_num_write~0 0))) (.cse15 (not (= ~p_dw_pc~0 0))) (.cse16 (not (= ~c_num_read~0 0))) (.cse18 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse22 (= ~p_dw_st~0 0)) (.cse19 (< 0 ~t1_pc~0)) (.cse5 (= ~m_pc~0 1)) (.cse29 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse30 (not .cse3)) (.cse17 (not (= ~q_free~0 1))) (.cse11 (not (= ~q_req_up~0 0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse26 (= |old(~p_dw_st~0)| 0)) (.cse2 (not (= ~E_M~0 ~M_E~0))) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (not (= ~q_free~0 0))) (.cse7 (not (= ~T1_E~0 ~M_E~0))) (.cse9 (= |old(~c_dr_st~0)| 0)) (.cse10 (not (= ~q_read_ev~0 2))) (.cse23 (not (= ~m_st~0 0))) (.cse8 (and .cse28 .cse20 .cse21)) (.cse24 (< ~E_1~0 2)) (.cse25 (not (= ~p_dw_i~0 1))) (.cse31 (< ~q_write_ev~0 2)) (.cse27 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse0 .cse1 .cse12 .cse2 .cse13 .cse14 .cse15 .cse4 .cse5 .cse16 .cse7 .cse8 .cse17 .cse9 .cse10 .cse18) (or .cse11 .cse0 .cse19 .cse1 .cse12 .cse2 .cse13 .cse14 (and .cse20 .cse21 .cse22) .cse15 .cse4 .cse16 .cse7 .cse23 .cse24 .cse25 .cse17 (not .cse26) .cse10 .cse18 .cse27) (or .cse11 .cse0 .cse19 .cse1 .cse26 .cse2 .cse4 .cse6 .cse7 .cse23 (= ~q_write_ev~0 0) .cse8 .cse24 .cse25 .cse9 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse10 .cse27) (or .cse11 .cse0 (and (= ~q_read_ev~0 1) (not (= ~c_dr_st~0 0)) .cse22) .cse19 .cse1 .cse26 (and .cse28 .cse21) .cse2 .cse4 .cse5 .cse29 .cse7 .cse23 .cse30 .cse24 .cse25 .cse17 .cse9 .cse31 .cse27) (or .cse19 (and (or .cse11 .cse0 .cse1 .cse26 .cse2 .cse4 .cse5 .cse29 .cse7 .cse30 .cse17 .cse9 .cse10) (or .cse11 .cse0 .cse1 .cse26 .cse2 .cse4 .cse6 .cse7 .cse9 .cse10)) .cse23 .cse8 .cse24 .cse25 .cse31 .cse27)))) [2023-12-19 01:34:53,666 INFO L899 garLoopResultBuilder]: For program point L321-1(line 321) no Hoare annotation was computed. [2023-12-19 01:34:53,666 INFO L899 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 315 339) no Hoare annotation was computed. [2023-12-19 01:34:53,667 INFO L899 garLoopResultBuilder]: For program point L331(lines 331 335) no Hoare annotation was computed. [2023-12-19 01:34:53,667 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 315 339) the Hoare annotation is: (let ((.cse22 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse17 (not (= ~c_dr_pc~0 0))) (.cse18 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse19 (not (= ~p_num_write~0 0))) (.cse20 (not (= ~p_dw_pc~0 0))) (.cse26 (= ~m_pc~0 1)) (.cse21 (not (= ~c_num_read~0 0))) (.cse24 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse25 (= ~c_dr_pc~0 1)) (.cse23 (not (= ~q_free~0 1))) (.cse14 (< ~q_write_ev~0 2)) (.cse0 (not (= ~q_req_up~0 0))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (< 0 ~t1_pc~0)) (.cse3 (not (= ~M_E~0 2))) (.cse4 (= |old(~p_dw_st~0)| 0)) (.cse5 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse22)) (.cse6 (not (= ~E_M~0 ~M_E~0))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (= ~q_free~0 0))) (.cse9 (not (= ~T1_E~0 ~M_E~0))) (.cse10 (not (= ~m_st~0 0))) (.cse11 (< ~E_1~0 2)) (.cse12 (not (= ~p_dw_i~0 1))) (.cse13 (= |old(~c_dr_st~0)| 0)) (.cse15 (not (= ~q_read_ev~0 2))) (.cse16 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse17 .cse6 .cse18 .cse19 .cse20 .cse7 .cse21 .cse9 .cse10 (and .cse22 (= ~p_dw_st~0 0)) .cse11 .cse12 .cse23 (not .cse4) .cse15 .cse24 .cse16) (or .cse1 .cse3 .cse5 .cse6 .cse25 .cse7 .cse26 .cse8 .cse9 .cse13 .cse15) (or .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse18 .cse19 .cse20 .cse7 .cse26 .cse21 .cse9 .cse23 .cse13 .cse15 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~c_num_read~0 ~p_num_write~0)) .cse9 .cse10 (not .cse25) .cse11 .cse12 .cse23 .cse13 .cse14 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~q_write_ev~0 0) .cse11 .cse12 .cse13 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse15 .cse16)))) [2023-12-19 01:34:53,667 INFO L899 garLoopResultBuilder]: For program point L329(line 329) no Hoare annotation was computed. [2023-12-19 01:34:53,667 INFO L899 garLoopResultBuilder]: For program point L331-2(lines 315 339) no Hoare annotation was computed. [2023-12-19 01:34:53,667 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2023-12-19 01:34:53,667 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 634 641) no Hoare annotation was computed. [2023-12-19 01:34:53,667 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 634 641) the Hoare annotation is: true [2023-12-19 01:34:53,667 INFO L899 garLoopResultBuilder]: For program point L735-1(lines 734 757) no Hoare annotation was computed. [2023-12-19 01:34:53,667 INFO L899 garLoopResultBuilder]: For program point L750-1(lines 731 758) no Hoare annotation was computed. [2023-12-19 01:34:53,667 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 731 758) the Hoare annotation is: (let ((.cse18 (< ~t1_st~0 2)) (.cse4 (not (= ~t1_pc~0 1))) (.cse7 (and (<= 1 ~m_pc~0) (or (< ~m_pc~0 2) (< 1 ~t1_pc~0)))) (.cse3 (< ~m_st~0 2)) (.cse0 (not (= ~q_req_up~0 0))) (.cse20 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse21 (< 0 ~t1_pc~0)) (.cse2 (not (= ~c_dr_pc~0 0))) (.cse5 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse6 (not (= ~p_num_write~0 0))) (.cse8 (not (= ~p_dw_pc~0 0))) (.cse9 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (not (= ~c_num_read~0 0))) (.cse11 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))) (.cse12 (not (= ~q_free~0 0))) (.cse13 (< |old(~E_1~0)| 2)) (.cse14 (< |old(~E_M~0)| 2)) (.cse19 (not (= ~m_st~0 0))) (.cse15 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse16 (< |old(~T1_E~0)| 2)) (.cse17 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse18 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 (not (= (+ ~local~0 1) ~token~0)) .cse15 .cse16) (or .cse0 .cse18 .cse20 .cse1 .cse21 .cse2 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse15 .cse16) (or .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse18 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse21 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse20 .cse1 .cse21 .cse2 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse15 .cse16 .cse17))) [2023-12-19 01:34:53,667 INFO L899 garLoopResultBuilder]: For program point L745-1(lines 734 757) no Hoare annotation was computed. [2023-12-19 01:34:53,668 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 731 758) no Hoare annotation was computed. [2023-12-19 01:34:53,668 INFO L899 garLoopResultBuilder]: For program point L740-1(lines 734 757) no Hoare annotation was computed. [2023-12-19 01:34:53,668 INFO L899 garLoopResultBuilder]: For program point L288-1(lines 279 296) no Hoare annotation was computed. [2023-12-19 01:34:53,668 INFO L899 garLoopResultBuilder]: For program point L283-1(lines 282 295) no Hoare annotation was computed. [2023-12-19 01:34:53,668 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 279 296) the Hoare annotation is: (let ((.cse28 (= ~q_read_ev~0 2)) (.cse29 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse4 (< |old(~q_write_ev~0)| 2)) (.cse8 (and .cse29 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse22 (= ~m_pc~0 1)) (.cse26 (not (= ~q_free~0 0))) (.cse27 (and .cse29 .cse28)) (.cse1 (not (= ~q_req_up~0 0))) (.cse2 (not (= ~m_pc~0 ~t1_pc~0))) (.cse9 (= ~p_dw_st~0 0)) (.cse3 (< 0 ~t1_pc~0)) (.cse5 (not (= ~M_E~0 2))) (.cse17 (and (= ~q_write_ev~0 2) .cse28)) (.cse18 (not (= ~c_dr_pc~0 0))) (.cse19 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) (.cse6 (not (= ~E_M~0 ~M_E~0))) (.cse20 (not (= ~p_num_write~0 0))) (.cse21 (not (= ~p_dw_pc~0 0))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse23 (not (= ~c_num_read~0 0))) (.cse10 (not (= ~T1_E~0 ~M_E~0))) (.cse11 (not (= ~m_st~0 0))) (.cse24 (not (= |old(~q_read_ev~0)| 2))) (.cse13 (< ~E_1~0 2)) (.cse14 (not (= ~p_dw_i~0 1))) (.cse15 (not (= ~q_free~0 1))) (.cse25 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse16 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ~c_num_read~0 ~p_num_write~0)) .cse9 .cse10 .cse11 (not .cse12) .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse5 .cse17 .cse18 .cse19 .cse6 .cse20 .cse21 .cse7 .cse22 .cse23 .cse10 .cse24 .cse15 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse26 .cse9 .cse10 .cse11 .cse24 .cse13 .cse14 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse27 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse26 .cse9 .cse10 .cse11 .cse24 .cse13 .cse14 .cse16) (or .cse0 .cse2 .cse5 .cse6 .cse12 .cse7 .cse22 .cse26 .cse10 .cse24 .cse27) (or .cse1 .cse2 (not .cse9) .cse3 .cse5 .cse17 .cse18 .cse19 .cse6 .cse20 .cse21 .cse7 .cse23 .cse10 .cse11 .cse24 .cse13 .cse14 .cse15 .cse25 .cse16)))) [2023-12-19 01:34:53,668 INFO L899 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 279 296) no Hoare annotation was computed. [2023-12-19 01:34:53,668 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 98) no Hoare annotation was computed. [2023-12-19 01:34:53,668 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 101) no Hoare annotation was computed. [2023-12-19 01:34:53,668 INFO L899 garLoopResultBuilder]: For program point L92-2(lines 92 101) no Hoare annotation was computed. [2023-12-19 01:34:53,668 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 88 106) the Hoare annotation is: true [2023-12-19 01:34:53,668 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 88 106) no Hoare annotation was computed. [2023-12-19 01:34:53,668 INFO L899 garLoopResultBuilder]: For program point L103(lines 91 105) no Hoare annotation was computed. [2023-12-19 01:34:53,668 INFO L899 garLoopResultBuilder]: For program point L960(lines 960 966) no Hoare annotation was computed. [2023-12-19 01:34:53,669 INFO L895 garLoopResultBuilder]: At program point L927(line 927) the Hoare annotation is: (let ((.cse10 (not (= ~m_pc~0 1))) (.cse1 (<= 2 ~t1_st~0)) (.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse17 (= ~token~0 ~local~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse11 (= ~q_free~0 0)) (.cse20 (<= 2 ~m_st~0)) (.cse19 (<= ~t1_pc~0 0)) (.cse12 (= ~q_req_up~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse14 (= ~p_dw_st~0 0)) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-12-19 01:34:53,669 INFO L899 garLoopResultBuilder]: For program point L927-1(line 927) no Hoare annotation was computed. [2023-12-19 01:34:53,669 INFO L899 garLoopResultBuilder]: For program point L250-1(lines 241 258) no Hoare annotation was computed. [2023-12-19 01:34:53,669 INFO L899 garLoopResultBuilder]: For program point L696-1(lines 686 724) no Hoare annotation was computed. [2023-12-19 01:34:53,669 INFO L899 garLoopResultBuilder]: For program point L564(lines 564 572) no Hoare annotation was computed. [2023-12-19 01:34:53,669 INFO L899 garLoopResultBuilder]: For program point L878(lines 878 883) no Hoare annotation was computed. [2023-12-19 01:34:53,669 INFO L899 garLoopResultBuilder]: For program point L713(lines 713 720) no Hoare annotation was computed. [2023-12-19 01:34:53,669 INFO L899 garLoopResultBuilder]: For program point L713-2(lines 713 720) no Hoare annotation was computed. [2023-12-19 01:34:53,669 INFO L899 garLoopResultBuilder]: For program point L350(line 350) no Hoare annotation was computed. [2023-12-19 01:34:53,669 INFO L899 garLoopResultBuilder]: For program point do_write_p_returnLabel#1(lines 132 171) no Hoare annotation was computed. [2023-12-19 01:34:53,669 INFO L895 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: (let ((.cse11 (= ~c_num_read~0 ~p_num_write~0)) (.cse13 (= ~q_free~0 1)) (.cse14 (<= 2 ~q_write_ev~0)) (.cse10 (<= 2 ~E_1~0)) (.cse19 (not (= ~p_dw_st~0 0))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~T1_E~0 2)) (.cse12 (= ~m_st~0 0)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= ~q_free~0 0)) (.cse15 (<= ~t1_pc~0 0)) (.cse16 (= ~q_req_up~0 0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse6 (= ~q_read_ev~0 2)) (.cse17 (= ~p_dw_i~0 1)) (.cse8 (= ~E_M~0 2)) (.cse18 (= ~token~0 ~local~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not .cse7) .cse8 .cse9) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse13 .cse3 .cse14 .cse4 .cse15 .cse16 .cse7 .cse6 .cse17 .cse8 .cse18 .cse9) (and .cse10 .cse19 .cse0 .cse20 .cse1 .cse2 .cse12 .cse3 .cse14 .cse5 .cse15 .cse16 .cse7 .cse6 .cse17 .cse8 .cse18 .cse9) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse16 (= ~q_write_ev~0 2) .cse6 (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) .cse8 .cse9) (and .cse10 .cse19 .cse11 .cse0 .cse1 .cse2 .cse12 .cse13 .cse3 .cse14 .cse4 .cse15 .cse16 .cse7 .cse17 .cse8 .cse18 .cse9) (and .cse10 .cse19 .cse0 .cse1 .cse2 .cse12 .cse14 .cse4 .cse5 .cse15 .cse16 .cse6 .cse17 .cse8 .cse18 .cse9) (and .cse10 .cse19 .cse0 .cse20 .cse1 (not (= ~q_write_ev~0 0)) .cse2 .cse12 .cse3 .cse4 .cse5 .cse15 .cse16 .cse7 .cse6 .cse17 .cse8 .cse18 .cse9))) [2023-12-19 01:34:53,669 INFO L895 garLoopResultBuilder]: At program point L912(line 912) the Hoare annotation is: (let ((.cse10 (not (= ~m_pc~0 1))) (.cse1 (<= 2 ~t1_st~0)) (.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse17 (= ~token~0 ~local~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse11 (= ~q_free~0 0)) (.cse20 (<= 2 ~m_st~0)) (.cse19 (<= ~t1_pc~0 0)) (.cse12 (= ~q_req_up~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse14 (= ~p_dw_st~0 0)) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-12-19 01:34:53,669 INFO L899 garLoopResultBuilder]: For program point L400-1(line 400) no Hoare annotation was computed. [2023-12-19 01:34:53,669 INFO L899 garLoopResultBuilder]: For program point L912-1(line 912) no Hoare annotation was computed. [2023-12-19 01:34:53,670 INFO L899 garLoopResultBuilder]: For program point L846-1(lines 835 858) no Hoare annotation was computed. [2023-12-19 01:34:53,670 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 144) no Hoare annotation was computed. [2023-12-19 01:34:53,670 INFO L899 garLoopResultBuilder]: For program point L962(lines 962 965) no Hoare annotation was computed. [2023-12-19 01:34:53,670 INFO L895 garLoopResultBuilder]: At program point L897(line 897) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~q_write_ev~0 ~q_read_ev~0) (= ~m_st~0 0) (= ~q_free~0 0) (<= ~t1_pc~0 0) (= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2023-12-19 01:34:53,670 INFO L899 garLoopResultBuilder]: For program point L352(lines 352 356) no Hoare annotation was computed. [2023-12-19 01:34:53,670 INFO L899 garLoopResultBuilder]: For program point L897-1(line 897) no Hoare annotation was computed. [2023-12-19 01:34:53,670 INFO L899 garLoopResultBuilder]: For program point L352-1(lines 347 387) no Hoare annotation was computed. [2023-12-19 01:34:53,670 INFO L899 garLoopResultBuilder]: For program point L699(lines 699 706) no Hoare annotation was computed. [2023-12-19 01:34:53,670 INFO L899 garLoopResultBuilder]: For program point L699-2(lines 699 706) no Hoare annotation was computed. [2023-12-19 01:34:53,670 INFO L899 garLoopResultBuilder]: For program point L567(lines 567 571) no Hoare annotation was computed. [2023-12-19 01:34:53,670 INFO L895 garLoopResultBuilder]: At program point L435(line 435) the Hoare annotation is: (let ((.cse16 (not (= ~m_pc~0 1))) (.cse22 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (= ~c_num_read~0 ~p_num_write~0)) (.cse20 (= ~q_free~0 1)) (.cse17 (= ~c_dr_pc~0 1)) (.cse10 (= ~q_req_up~0 0)) (.cse18 (= ~q_req_up~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= ~m_st~0 0)) (.cse21 (<= 2 ~q_write_ev~0)) (.cse7 (not (= ~c_dr_st~0 0))) (.cse8 (= ~q_free~0 0)) (.cse9 (<= ~t1_pc~0 0)) (.cse11 (= ~q_read_ev~0 2)) (.cse12 (= ~p_dw_i~0 1)) (.cse13 (= ~E_M~0 2)) (.cse14 (= ~token~0 ~local~0)) (.cse15 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~q_write_ev~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse2 .cse4 .cse5 .cse16 .cse7 .cse8 .cse11 (not .cse17) .cse13 .cse15) (and .cse18 .cse0 .cse1 .cse19 .cse2 .cse4 .cse5 .cse6 .cse20 .cse21 .cse7 .cse9 .cse17 (<= 1 ~q_read_ev~0) .cse12 .cse22 .cse13 .cse14 .cse15) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse2 .cse4 .cse5 .cse20 .cse16 .cse7 .cse10 (= ~q_write_ev~0 2) .cse11 (= ~c_dr_pc~0 0) .cse22 .cse13 .cse15) (and .cse0 .cse1 .cse19 .cse2 .cse4 .cse5 .cse6 .cse20 .cse21 .cse7 .cse9 .cse10 .cse17 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse21 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15))) [2023-12-19 01:34:53,670 INFO L899 garLoopResultBuilder]: For program point L435-1(line 435) no Hoare annotation was computed. [2023-12-19 01:34:53,670 INFO L899 garLoopResultBuilder]: For program point L402(lines 402 407) no Hoare annotation was computed. [2023-12-19 01:34:53,670 INFO L899 garLoopResultBuilder]: For program point transmit1_returnLabel#1(lines 560 595) no Hoare annotation was computed. [2023-12-19 01:34:53,670 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 143) no Hoare annotation was computed. [2023-12-19 01:34:53,670 INFO L899 garLoopResultBuilder]: For program point L651-1(lines 642 659) no Hoare annotation was computed. [2023-12-19 01:34:53,671 INFO L895 garLoopResultBuilder]: At program point L585(line 585) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (<= 2 ~m_st~0)) (.cse9 (= ~q_req_up~0 0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_dr_pc~0 0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2023-12-19 01:34:53,671 INFO L899 garLoopResultBuilder]: For program point L585-1(line 585) no Hoare annotation was computed. [2023-12-19 01:34:53,671 INFO L895 garLoopResultBuilder]: At program point L420(line 420) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 1) (<= ~t1_pc~0 0) (= ~q_req_up~0 0) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2023-12-19 01:34:53,671 INFO L899 garLoopResultBuilder]: For program point L420-1(line 420) no Hoare annotation was computed. [2023-12-19 01:34:53,671 INFO L895 garLoopResultBuilder]: At program point L899(line 899) the Hoare annotation is: (let ((.cse8 (= ~m_st~0 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (= ~T1_E~0 2)) (.cse7 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse9 (= ~q_free~0 0)) (.cse10 (<= ~t1_pc~0 0)) (.cse11 (= ~q_req_up~0 0)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~E_M~0 2)) (.cse16 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~token~0 ~local~0) .cse16) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 (<= 2 ~m_st~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-12-19 01:34:53,671 INFO L895 garLoopResultBuilder]: At program point L899-1(line 899) the Hoare annotation is: (let ((.cse8 (= ~m_st~0 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (= ~T1_E~0 2)) (.cse7 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse9 (= ~q_free~0 0)) (.cse10 (<= ~t1_pc~0 0)) (.cse11 (= ~q_req_up~0 0)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~E_M~0 2)) (.cse16 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~token~0 ~local~0) .cse16) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 (<= 2 ~m_st~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-12-19 01:34:53,671 INFO L899 garLoopResultBuilder]: For program point L189(lines 188 219) no Hoare annotation was computed. [2023-12-19 01:34:53,671 INFO L895 garLoopResultBuilder]: At program point L916(line 916) the Hoare annotation is: (let ((.cse10 (not (= ~m_pc~0 1))) (.cse1 (<= 2 ~t1_st~0)) (.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse17 (= ~token~0 ~local~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse11 (= ~q_free~0 0)) (.cse20 (<= 2 ~m_st~0)) (.cse19 (<= ~t1_pc~0 0)) (.cse12 (= ~q_req_up~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse14 (= ~p_dw_st~0 0)) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-12-19 01:34:53,671 INFO L895 garLoopResultBuilder]: At program point L916-1(line 916) the Hoare annotation is: (let ((.cse10 (not (= ~m_pc~0 1))) (.cse1 (<= 2 ~t1_st~0)) (.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse17 (= ~token~0 ~local~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse11 (= ~q_free~0 0)) (.cse20 (<= 2 ~m_st~0)) (.cse19 (<= ~t1_pc~0 0)) (.cse12 (= ~q_req_up~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse14 (= ~p_dw_st~0 0)) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-12-19 01:34:53,671 INFO L899 garLoopResultBuilder]: For program point start_simulation2_returnLabel#1(lines 889 947) no Hoare annotation was computed. [2023-12-19 01:34:53,671 INFO L899 garLoopResultBuilder]: For program point L206(lines 206 218) no Hoare annotation was computed. [2023-12-19 01:34:53,671 INFO L899 garLoopResultBuilder]: For program point L520(lines 520 528) no Hoare annotation was computed. [2023-12-19 01:34:53,672 INFO L895 garLoopResultBuilder]: At program point L900(line 900) the Hoare annotation is: (let ((.cse8 (= ~m_st~0 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (= ~T1_E~0 2)) (.cse7 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse9 (= ~q_free~0 0)) (.cse10 (<= ~t1_pc~0 0)) (.cse11 (= ~q_req_up~0 0)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~E_M~0 2)) (.cse16 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~token~0 ~local~0) .cse16) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 (<= 2 ~m_st~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-12-19 01:34:53,672 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-19 01:34:53,672 INFO L899 garLoopResultBuilder]: For program point master_returnLabel#1(lines 516 559) no Hoare annotation was computed. [2023-12-19 01:34:53,672 INFO L899 garLoopResultBuilder]: For program point L190-1(lines 190 200) no Hoare annotation was computed. [2023-12-19 01:34:53,672 INFO L895 garLoopResultBuilder]: At program point L537(line 537) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~q_req_up~0 0)) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (= ~p_dw_st~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~m_pc~0 ~t1_pc~0) .cse4 .cse5 .cse6 (<= ~t1_pc~0 0) .cse7 .cse8 .cse9 .cse10 .cse11) (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~token~0 ~local~0)))) [2023-12-19 01:34:53,672 INFO L899 garLoopResultBuilder]: For program point L537-1(line 537) no Hoare annotation was computed. [2023-12-19 01:34:53,672 INFO L895 garLoopResultBuilder]: At program point L917(line 917) the Hoare annotation is: (let ((.cse10 (not (= ~m_pc~0 1))) (.cse1 (<= 2 ~t1_st~0)) (.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse17 (= ~token~0 ~local~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse11 (= ~q_free~0 0)) (.cse20 (<= 2 ~m_st~0)) (.cse19 (<= ~t1_pc~0 0)) (.cse12 (= ~q_req_up~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse14 (= ~p_dw_st~0 0)) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-12-19 01:34:53,672 INFO L895 garLoopResultBuilder]: At program point L372(lines 347 387) the Hoare annotation is: (let ((.cse27 (= ~p_dw_st~0 0)) (.cse18 (= ~c_dr_pc~0 1))) (let ((.cse23 (= ~p_dw_pc~0 0)) (.cse24 (= ~p_num_write~0 0)) (.cse28 (= ~c_dr_pc~0 0)) (.cse20 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (= ~c_num_read~0 0)) (.cse26 (= ~q_write_ev~0 2)) (.cse7 (not .cse18)) (.cse13 (= ~c_num_read~0 ~p_num_write~0)) (.cse15 (= ~q_free~0 1)) (.cse10 (= ~q_req_up~0 1)) (.cse16 (<= 2 ~q_write_ev~0)) (.cse11 (<= 2 ~E_1~0)) (.cse12 (not .cse27)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse29 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~T1_E~0 2)) (.cse14 (= ~m_st~0 0)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= ~q_free~0 0)) (.cse17 (<= ~t1_pc~0 0)) (.cse22 (= ~q_req_up~0 0)) (.cse6 (= ~q_read_ev~0 2)) (.cse19 (= ~p_dw_i~0 1)) (.cse8 (= ~E_M~0 2)) (.cse21 (= ~token~0 ~local~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse11 .cse12 .cse13 .cse0 .cse1 .cse2 .cse14 .cse15 .cse16 .cse4 .cse17 .cse18 (<= 1 ~q_read_ev~0) .cse19 .cse20 .cse8 .cse21 .cse9) (and .cse11 .cse13 .cse0 .cse1 .cse2 .cse14 .cse15 .cse3 .cse16 .cse4 .cse17 .cse22 .cse18 .cse6 .cse19 .cse8 .cse21 .cse9) (and .cse23 .cse11 .cse24 .cse25 .cse0 .cse1 .cse2 .cse14 .cse15 .cse17 .cse22 .cse26 .cse27 .cse6 .cse28 .cse19 .cse20 .cse8 .cse21 .cse9) (and .cse11 .cse12 .cse0 .cse29 .cse1 .cse2 .cse14 .cse3 .cse16 .cse5 .cse17 .cse22 .cse18 .cse6 .cse19 .cse8 .cse21 .cse9) (and .cse23 .cse24 .cse25 .cse0 .cse1 .cse2 .cse15 .cse3 .cse4 .cse22 .cse26 .cse6 .cse28 .cse20 .cse8 .cse9) (and .cse10 .cse11 .cse12 .cse25 .cse0 .cse1 .cse2 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|) .cse14 .cse5 .cse17 .cse26 .cse6 .cse7 .cse19 (= ~p_num_write~0 1) .cse8 .cse21 .cse9) (and .cse11 .cse12 .cse13 .cse0 .cse1 .cse2 .cse14 .cse15 .cse3 .cse16 .cse4 .cse17 .cse22 .cse18 .cse19 .cse8 .cse21 .cse9) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse14 .cse16 .cse4 .cse5 .cse17 .cse22 .cse6 .cse19 .cse8 .cse21 .cse9) (and .cse10 .cse11 .cse12 .cse0 .cse29 .cse1 .cse2 .cse14 .cse16 .cse4 .cse5 .cse17 .cse6 .cse19 .cse8 .cse21 .cse9) (and .cse11 .cse12 .cse0 .cse29 .cse1 (not (= ~q_write_ev~0 0)) .cse2 .cse14 .cse3 .cse4 .cse5 .cse17 .cse22 .cse18 .cse6 .cse19 .cse8 .cse21 .cse9)))) [2023-12-19 01:34:53,672 INFO L899 garLoopResultBuilder]: For program point L851-1(lines 832 859) no Hoare annotation was computed. [2023-12-19 01:34:53,672 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 213) no Hoare annotation was computed. [2023-12-19 01:34:53,672 INFO L895 garLoopResultBuilder]: At program point L422(line 422) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= ~q_free~0 1)) (.cse7 (= ~q_req_up~0 0)) (.cse8 (= ~q_write_ev~0 2)) (.cse9 (= ~q_read_ev~0 2)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (= ~E_M~0 2)) (.cse13 (= ~M_E~0 2))) (or (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_st~0 0) .cse6 (<= ~t1_pc~0 0) .cse7 .cse8 (= ~p_dw_st~0 0) .cse9 .cse10 (= ~p_dw_i~0 1) .cse11 .cse12 (= ~token~0 ~local~0) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_pc~0 1)) (not (= ~c_dr_st~0 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2023-12-19 01:34:53,673 INFO L895 garLoopResultBuilder]: At program point L422-1(line 422) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= ~q_free~0 1)) (.cse7 (= ~q_req_up~0 0)) (.cse8 (= ~q_write_ev~0 2)) (.cse9 (= ~q_read_ev~0 2)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (= ~E_M~0 2)) (.cse13 (= ~M_E~0 2))) (or (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_st~0 0) .cse6 (<= ~t1_pc~0 0) .cse7 .cse8 (= ~p_dw_st~0 0) .cse9 .cse10 (= ~p_dw_i~0 1) .cse11 .cse12 (= ~token~0 ~local~0) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_pc~0 1)) (not (= ~c_dr_st~0 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2023-12-19 01:34:53,673 INFO L895 garLoopResultBuilder]: At program point L439(line 439) the Hoare annotation is: (let ((.cse3 (not (= ~m_pc~0 1))) (.cse10 (= ~q_free~0 1)) (.cse7 (= ~c_dr_pc~0 1)) (.cse15 (<= 2 ~q_write_ev~0)) (.cse12 (<= 2 ~E_1~0)) (.cse13 (not (= ~p_dw_st~0 0))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~T1_E~0 2)) (.cse14 (= ~m_st~0 0)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= ~q_free~0 0)) (.cse16 (<= ~t1_pc~0 0)) (.cse11 (= ~q_req_up~0 0)) (.cse6 (= ~q_read_ev~0 2)) (.cse17 (= ~p_dw_i~0 1)) (.cse8 (= ~E_M~0 2)) (.cse18 (= ~token~0 ~local~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not .cse7) .cse8 .cse9) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse2 .cse10 .cse3 .cse4 .cse11 (= ~q_write_ev~0 2) .cse6 (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) .cse8 .cse9) (and .cse12 .cse13 (= ~c_num_read~0 ~p_num_write~0) .cse0 .cse1 .cse2 .cse14 .cse10 .cse15 .cse4 .cse16 .cse11 .cse7 .cse17 .cse8 .cse18 .cse9) (and .cse12 .cse13 .cse0 .cse1 .cse2 .cse14 .cse15 .cse4 .cse5 .cse16 .cse11 .cse6 .cse17 .cse8 .cse18 .cse9) (and .cse12 .cse13 .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1 .cse2 .cse14 .cse4 .cse5 .cse16 .cse11 .cse6 .cse17 .cse8 .cse18 .cse9))) [2023-12-19 01:34:53,673 INFO L895 garLoopResultBuilder]: At program point L439-1(line 439) the Hoare annotation is: (let ((.cse15 (not (= ~m_pc~0 1))) (.cse17 (= ~q_free~0 1)) (.cse16 (= ~c_dr_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~T1_E~0 2)) (.cse5 (= ~m_st~0 0)) (.cse18 (<= 2 ~q_write_ev~0)) (.cse6 (not (= ~c_dr_st~0 0))) (.cse7 (= ~q_free~0 0)) (.cse8 (<= ~t1_pc~0 0)) (.cse9 (= ~q_req_up~0 0)) (.cse10 (= ~q_read_ev~0 2)) (.cse11 (= ~p_dw_i~0 1)) (.cse12 (= ~E_M~0 2)) (.cse13 (= ~token~0 ~local~0)) (.cse14 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 (not (= ~q_write_ev~0 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse15 .cse6 .cse7 .cse10 (not .cse16) .cse12 .cse14) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse17 .cse15 .cse6 .cse9 (= ~q_write_ev~0 2) .cse10 (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) .cse12 .cse14) (and .cse0 .cse1 (= ~c_num_read~0 ~p_num_write~0) .cse2 .cse3 .cse4 .cse5 .cse17 .cse18 .cse6 .cse8 .cse9 .cse16 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2023-12-19 01:34:53,673 INFO L899 garLoopResultBuilder]: For program point start_simulation1_returnLabel#1(lines 413 455) no Hoare annotation was computed. [2023-12-19 01:34:53,673 INFO L895 garLoopResultBuilder]: At program point L918(line 918) the Hoare annotation is: (let ((.cse10 (not (= ~m_pc~0 1))) (.cse1 (<= 2 ~t1_st~0)) (.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse17 (= ~token~0 ~local~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse11 (= ~q_free~0 0)) (.cse20 (<= 2 ~m_st~0)) (.cse19 (<= ~t1_pc~0 0)) (.cse12 (= ~q_req_up~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse14 (= ~p_dw_st~0 0)) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-12-19 01:34:53,673 INFO L899 garLoopResultBuilder]: For program point L885(lines 874 887) no Hoare annotation was computed. [2023-12-19 01:34:53,673 INFO L895 garLoopResultBuilder]: At program point L687(line 687) the Hoare annotation is: (let ((.cse10 (not (= ~m_pc~0 1))) (.cse1 (<= 2 ~t1_st~0)) (.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse17 (= ~token~0 ~local~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse11 (= ~q_free~0 0)) (.cse20 (<= 2 ~m_st~0)) (.cse19 (<= ~t1_pc~0 0)) (.cse12 (= ~q_req_up~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse14 (= ~p_dw_st~0 0)) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-12-19 01:34:53,673 INFO L895 garLoopResultBuilder]: At program point L423(line 423) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= ~q_free~0 1)) (.cse7 (= ~q_req_up~0 0)) (.cse8 (= ~q_write_ev~0 2)) (.cse9 (= ~q_read_ev~0 2)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (= ~E_M~0 2)) (.cse13 (= ~M_E~0 2))) (or (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_st~0 0) .cse6 (<= ~t1_pc~0 0) .cse7 .cse8 (= ~p_dw_st~0 0) .cse9 .cse10 (= ~p_dw_i~0 1) .cse11 .cse12 (= ~token~0 ~local~0) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_pc~0 1)) (not (= ~c_dr_st~0 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2023-12-19 01:34:53,673 INFO L899 garLoopResultBuilder]: For program point L357(lines 347 387) no Hoare annotation was computed. [2023-12-19 01:34:53,673 INFO L899 garLoopResultBuilder]: For program point L836(lines 836 840) no Hoare annotation was computed. [2023-12-19 01:34:53,673 INFO L899 garLoopResultBuilder]: For program point L836-2(lines 835 858) no Hoare annotation was computed. [2023-12-19 01:34:53,674 INFO L895 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse13 (<= 1 ~q_write_ev~0)) (.cse17 (= ~c_num_read~0 ~p_num_write~0)) (.cse18 (= ~q_free~0 1)) (.cse20 (<= 2 ~q_write_ev~0)) (.cse10 (<= 2 ~E_1~0)) (.cse16 (not (= ~p_dw_st~0 0))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~T1_E~0 2)) (.cse11 (= ~m_st~0 0)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= ~q_free~0 0)) (.cse12 (<= ~t1_pc~0 0)) (.cse19 (= ~q_req_up~0 0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse6 (= ~q_read_ev~0 2)) (.cse14 (= ~p_dw_i~0 1)) (.cse8 (= ~E_M~0 2)) (.cse15 (= ~token~0 ~local~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not .cse7) .cse8 .cse9) (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (or (and .cse16 .cse17 .cse0 .cse1 .cse2 .cse18 .cse3 .cse4 .cse19 .cse7 .cse6 .cse8 .cse9) (and .cse16 .cse0 .cse1 .cse2 .cse4 .cse5 .cse19 .cse6 .cse8 .cse9))) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse2 .cse18 .cse3 .cse4 .cse19 (= ~q_write_ev~0 2) .cse6 (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) .cse8 .cse9) (and .cse10 .cse16 .cse17 .cse0 .cse1 .cse2 .cse11 .cse18 .cse3 .cse20 .cse4 .cse12 .cse19 .cse7 .cse14 .cse8 .cse15 .cse9) (and .cse10 .cse16 .cse0 .cse21 .cse1 .cse2 .cse11 .cse3 .cse5 .cse12 .cse19 .cse7 .cse13 .cse6 .cse14 .cse8 .cse15 .cse9) (and .cse10 .cse17 .cse0 .cse1 .cse2 .cse11 .cse18 (= ~q_read_ev~0 1) .cse3 .cse20 .cse4 .cse12 .cse19 .cse7 .cse14 .cse8 .cse15 .cse9) (and .cse10 .cse16 .cse0 .cse21 .cse1 (not (= ~q_write_ev~0 0)) .cse2 .cse11 .cse3 .cse4 .cse5 .cse12 .cse19 .cse7 .cse6 .cse14 .cse8 .cse15 .cse9))) [2023-12-19 01:34:53,674 INFO L899 garLoopResultBuilder]: For program point L523(lines 523 527) no Hoare annotation was computed. [2023-12-19 01:34:53,674 INFO L899 garLoopResultBuilder]: For program point L936(lines 936 940) no Hoare annotation was computed. [2023-12-19 01:34:53,674 INFO L899 garLoopResultBuilder]: For program point eval2_returnLabel#1(lines 680 730) no Hoare annotation was computed. [2023-12-19 01:34:53,674 INFO L899 garLoopResultBuilder]: For program point L441(line 441) no Hoare annotation was computed. [2023-12-19 01:34:53,674 INFO L899 garLoopResultBuilder]: For program point L177(lines 177 185) no Hoare annotation was computed. [2023-12-19 01:34:53,674 INFO L899 garLoopResultBuilder]: For program point L689(line 689) no Hoare annotation was computed. [2023-12-19 01:34:53,674 INFO L895 garLoopResultBuilder]: At program point L904-1(lines 904 941) the Hoare annotation is: (let ((.cse10 (not (= ~m_pc~0 1))) (.cse1 (<= 2 ~t1_st~0)) (.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse17 (= ~token~0 ~local~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse11 (= ~q_free~0 0)) (.cse20 (<= 2 ~m_st~0)) (.cse19 (<= ~t1_pc~0 0)) (.cse12 (= ~q_req_up~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse14 (= ~p_dw_st~0 0)) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-12-19 01:34:53,674 INFO L899 garLoopResultBuilder]: For program point do_read_c_returnLabel#1(lines 173 225) no Hoare annotation was computed. [2023-12-19 01:34:53,674 INFO L899 garLoopResultBuilder]: For program point L409(lines 398 411) no Hoare annotation was computed. [2023-12-19 01:34:53,674 INFO L899 garLoopResultBuilder]: For program point L921(line 921) no Hoare annotation was computed. [2023-12-19 01:34:53,674 INFO L899 garLoopResultBuilder]: For program point L376(lines 376 383) no Hoare annotation was computed. [2023-12-19 01:34:53,674 INFO L895 garLoopResultBuilder]: At program point L211(line 211) the Hoare annotation is: false [2023-12-19 01:34:53,674 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-19 01:34:53,674 INFO L895 garLoopResultBuilder]: At program point L575-1(lines 575 588) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse13 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~q_req_up~0 0)) (.cse9 (<= 2 ~T1_E~0)) (.cse10 (= ~p_dw_st~0 0)) (.cse11 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~m_st~0) .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 (not (= ~m_pc~0 1)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~token~0 ~local~0)) (and .cse0 .cse1 .cse2 .cse3 (= (+ ~local~0 1) ~token~0) .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2023-12-19 01:34:53,674 INFO L899 garLoopResultBuilder]: For program point L245(lines 245 249) no Hoare annotation was computed. [2023-12-19 01:34:53,674 INFO L899 garLoopResultBuilder]: For program point L245-2(lines 244 257) no Hoare annotation was computed. [2023-12-19 01:34:53,674 INFO L899 garLoopResultBuilder]: For program point L691(lines 691 695) no Hoare annotation was computed. [2023-12-19 01:34:53,675 INFO L899 garLoopResultBuilder]: For program point L691-1(lines 686 724) no Hoare annotation was computed. [2023-12-19 01:34:53,675 INFO L895 garLoopResultBuilder]: At program point L427-1(lines 427 449) the Hoare annotation is: (let ((.cse23 (= ~p_dw_st~0 0))) (let ((.cse19 (= ~p_dw_pc~0 0)) (.cse20 (= ~p_num_write~0 0)) (.cse21 (= ~c_num_read~0 0)) (.cse22 (= ~q_write_ev~0 2)) (.cse24 (= ~c_dr_pc~0 0)) (.cse25 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~c_num_read~0 ~p_num_write~0)) (.cse13 (= ~q_free~0 1)) (.cse14 (<= 2 ~q_write_ev~0)) (.cse10 (<= 2 ~E_1~0)) (.cse26 (not .cse23)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse27 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~T1_E~0 2)) (.cse12 (= ~m_st~0 0)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= ~q_free~0 0)) (.cse15 (<= ~t1_pc~0 0)) (.cse16 (= ~q_req_up~0 0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse6 (= ~q_read_ev~0 2)) (.cse17 (= ~p_dw_i~0 1)) (.cse8 (= ~E_M~0 2)) (.cse18 (= ~token~0 ~local~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not .cse7) .cse8 .cse9) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse13 .cse3 .cse14 .cse4 .cse15 .cse16 .cse7 .cse6 .cse17 .cse8 .cse18 .cse9) (and .cse19 .cse10 .cse20 .cse21 .cse0 .cse1 .cse2 .cse12 .cse13 .cse15 .cse16 .cse22 .cse23 .cse6 .cse24 .cse17 .cse25 .cse8 .cse18 .cse9) (and .cse10 .cse26 .cse0 .cse27 .cse1 .cse2 .cse12 .cse3 .cse14 .cse5 .cse15 .cse16 .cse7 .cse6 .cse17 .cse8 .cse18 .cse9) (and .cse19 .cse20 .cse21 .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse16 .cse22 .cse6 .cse24 .cse25 .cse8 .cse9) (and .cse10 .cse26 .cse11 .cse0 .cse1 .cse2 .cse12 .cse13 .cse3 .cse14 .cse4 .cse15 .cse16 .cse7 .cse17 .cse8 .cse18 .cse9) (and .cse10 .cse26 .cse0 .cse1 .cse2 .cse12 .cse14 .cse4 .cse5 .cse15 .cse16 .cse6 .cse17 .cse8 .cse18 .cse9) (and .cse10 .cse26 .cse0 .cse27 .cse1 (not (= ~q_write_ev~0 0)) .cse2 .cse12 .cse3 .cse4 .cse5 .cse15 .cse16 .cse7 .cse6 .cse17 .cse8 .cse18 .cse9)))) [2023-12-19 01:34:53,675 INFO L899 garLoopResultBuilder]: For program point L361(lines 361 368) no Hoare annotation was computed. [2023-12-19 01:34:53,675 INFO L899 garLoopResultBuilder]: For program point eval1_returnLabel#1(lines 340 393) no Hoare annotation was computed. [2023-12-19 01:34:53,675 INFO L899 garLoopResultBuilder]: For program point L444(lines 444 448) no Hoare annotation was computed. [2023-12-19 01:34:53,675 INFO L899 garLoopResultBuilder]: For program point L923(lines 923 932) no Hoare annotation was computed. [2023-12-19 01:34:53,675 INFO L899 garLoopResultBuilder]: For program point L923-2(lines 923 932) no Hoare annotation was computed. [2023-12-19 01:34:53,675 INFO L899 garLoopResultBuilder]: For program point L180(lines 180 184) no Hoare annotation was computed. [2023-12-19 01:34:53,675 INFO L895 garLoopResultBuilder]: At program point L147-1(lines 147 165) the Hoare annotation is: (let ((.cse27 (= ~c_dr_pc~0 1))) (let ((.cse18 (not .cse27)) (.cse19 (= ~q_req_up~0 1)) (.cse9 (= ~q_free~0 0)) (.cse17 (not (= ~m_pc~0 1))) (.cse7 (<= 2 ~q_write_ev~0)) (.cse8 (not (= ~c_dr_st~0 0))) (.cse22 (= ~p_dw_pc~0 0)) (.cse0 (<= 2 ~E_1~0)) (.cse23 (= ~p_num_write~0 0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse20 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~T1_E~0 2)) (.cse5 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse6 (= ~m_st~0 0)) (.cse24 (= ~q_free~0 1)) (.cse10 (<= ~t1_pc~0 0)) (.cse11 (= ~q_req_up~0 0)) (.cse21 (= ~q_write_ev~0 2)) (.cse12 (= ~q_read_ev~0 2)) (.cse25 (= ~c_dr_pc~0 0)) (.cse13 (= ~p_dw_i~0 1)) (.cse26 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (= ~E_M~0 2)) (.cse15 (= ~token~0 ~local~0)) (.cse16 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse2 .cse3 .cse4 .cse17 .cse8 .cse9 .cse12 .cse18 .cse14 .cse16) (and .cse19 .cse0 .cse1 .cse20 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse9 .cse10 .cse21 .cse12 .cse18 .cse13 (= ~p_num_write~0 1) .cse14 .cse15 .cse16) (and .cse19 .cse0 .cse1 .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse22 .cse23 .cse20 .cse2 .cse3 .cse4 .cse24 .cse17 .cse8 .cse11 .cse21 .cse12 .cse25 .cse26 .cse14 .cse16) (and .cse0 .cse1 (= ~c_num_read~0 ~p_num_write~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse24 .cse7 .cse8 .cse10 .cse27 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse22 .cse0 .cse23 .cse1 .cse20 .cse2 .cse3 .cse4 .cse5 .cse6 .cse24 .cse10 .cse11 .cse21 .cse12 .cse25 .cse13 .cse26 .cse14 .cse15 .cse16)))) [2023-12-19 01:34:53,675 INFO L899 garLoopResultBuilder]: For program point L841-1(lines 835 858) no Hoare annotation was computed. [2023-12-19 01:34:53,675 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 496) no Hoare annotation was computed. [2023-12-19 01:34:53,675 INFO L899 garLoopResultBuilder]: For program point L148(lines 147 165) no Hoare annotation was computed. [2023-12-19 01:34:53,675 INFO L895 garLoopResultBuilder]: At program point L710-1(lines 686 724) the Hoare annotation is: (let ((.cse10 (not (= ~m_pc~0 1))) (.cse1 (<= 2 ~t1_st~0)) (.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse17 (= ~token~0 ~local~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse11 (= ~q_free~0 0)) (.cse20 (<= 2 ~m_st~0)) (.cse19 (<= ~t1_pc~0 0)) (.cse12 (= ~q_req_up~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse14 (= ~p_dw_st~0 0)) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-12-19 01:34:53,676 INFO L899 garLoopResultBuilder]: For program point $Ultimate##101(lines 545 551) no Hoare annotation was computed. [2023-12-19 01:34:53,676 INFO L895 garLoopResultBuilder]: At program point L545-1(lines 531 552) the Hoare annotation is: (let ((.cse13 (= ~t1_pc~0 1)) (.cse14 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~q_req_up~0 0)) (.cse9 (<= 2 ~T1_E~0)) (.cse10 (= ~p_dw_st~0 0)) (.cse11 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 .cse7 (<= ~t1_pc~0 0) .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse14 .cse0 .cse1 .cse2 .cse3 (= (+ ~local~0 1) ~token~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~token~0 ~local~0)))) [2023-12-19 01:34:53,676 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 157) no Hoare annotation was computed. [2023-12-19 01:34:53,676 INFO L899 garLoopResultBuilder]: For program point L496(line 496) no Hoare annotation was computed. [2023-12-19 01:34:53,676 INFO L895 garLoopResultBuilder]: At program point L876(line 876) the Hoare annotation is: (let ((.cse10 (not (= ~m_pc~0 1))) (.cse1 (<= 2 ~t1_st~0)) (.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse17 (= ~token~0 ~local~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse11 (= ~q_free~0 0)) (.cse20 (<= 2 ~m_st~0)) (.cse19 (<= ~t1_pc~0 0)) (.cse12 (= ~q_req_up~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse14 (= ~p_dw_st~0 0)) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse20 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-12-19 01:34:53,676 INFO L899 garLoopResultBuilder]: For program point L876-1(line 876) no Hoare annotation was computed. [2023-12-19 01:34:53,676 INFO L895 garLoopResultBuilder]: At program point L348(line 348) the Hoare annotation is: (let ((.cse27 (= ~p_dw_st~0 0)) (.cse18 (= ~c_dr_pc~0 1))) (let ((.cse23 (= ~p_dw_pc~0 0)) (.cse24 (= ~p_num_write~0 0)) (.cse28 (= ~c_dr_pc~0 0)) (.cse20 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (= ~c_num_read~0 0)) (.cse26 (= ~q_write_ev~0 2)) (.cse7 (not .cse18)) (.cse13 (= ~c_num_read~0 ~p_num_write~0)) (.cse15 (= ~q_free~0 1)) (.cse10 (= ~q_req_up~0 1)) (.cse16 (<= 2 ~q_write_ev~0)) (.cse11 (<= 2 ~E_1~0)) (.cse12 (not .cse27)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse29 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~T1_E~0 2)) (.cse14 (= ~m_st~0 0)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= ~q_free~0 0)) (.cse17 (<= ~t1_pc~0 0)) (.cse22 (= ~q_req_up~0 0)) (.cse6 (= ~q_read_ev~0 2)) (.cse19 (= ~p_dw_i~0 1)) (.cse8 (= ~E_M~0 2)) (.cse21 (= ~token~0 ~local~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse11 .cse12 .cse13 .cse0 .cse1 .cse2 .cse14 .cse15 .cse16 .cse4 .cse17 .cse18 (<= 1 ~q_read_ev~0) .cse19 .cse20 .cse8 .cse21 .cse9) (and .cse11 .cse13 .cse0 .cse1 .cse2 .cse14 .cse15 .cse3 .cse16 .cse4 .cse17 .cse22 .cse18 .cse6 .cse19 .cse8 .cse21 .cse9) (and .cse23 .cse11 .cse24 .cse25 .cse0 .cse1 .cse2 .cse14 .cse15 .cse17 .cse22 .cse26 .cse27 .cse6 .cse28 .cse19 .cse20 .cse8 .cse21 .cse9) (and .cse11 .cse12 .cse0 .cse29 .cse1 .cse2 .cse14 .cse3 .cse16 .cse5 .cse17 .cse22 .cse18 .cse6 .cse19 .cse8 .cse21 .cse9) (and .cse23 .cse24 .cse25 .cse0 .cse1 .cse2 .cse15 .cse3 .cse4 .cse22 .cse26 .cse6 .cse28 .cse20 .cse8 .cse9) (and .cse10 .cse11 .cse12 .cse25 .cse0 .cse1 .cse2 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|) .cse14 .cse5 .cse17 .cse26 .cse6 .cse7 .cse19 (= ~p_num_write~0 1) .cse8 .cse21 .cse9) (and .cse11 .cse12 .cse13 .cse0 .cse1 .cse2 .cse14 .cse15 .cse3 .cse16 .cse4 .cse17 .cse22 .cse18 .cse19 .cse8 .cse21 .cse9) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse14 .cse16 .cse4 .cse5 .cse17 .cse22 .cse6 .cse19 .cse8 .cse21 .cse9) (and .cse10 .cse11 .cse12 .cse0 .cse29 .cse1 .cse2 .cse14 .cse16 .cse4 .cse5 .cse17 .cse6 .cse19 .cse8 .cse21 .cse9) (and .cse11 .cse12 .cse0 .cse29 .cse1 (not (= ~q_write_ev~0 0)) .cse2 .cse14 .cse3 .cse4 .cse5 .cse17 .cse22 .cse18 .cse6 .cse19 .cse8 .cse21 .cse9)))) [2023-12-19 01:34:53,676 INFO L895 garLoopResultBuilder]: At program point L216(line 216) the Hoare annotation is: false [2023-12-19 01:34:53,676 INFO L895 garLoopResultBuilder]: At program point L216-1(lines 188 219) the Hoare annotation is: (let ((.cse19 (= ~c_dr_pc~0 1)) (.cse22 (= ~p_dw_st~0 0))) (let ((.cse0 (= ~q_req_up~0 1)) (.cse2 (not .cse22)) (.cse1 (<= 2 ~E_1~0)) (.cse20 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (= ~T1_E~0 2)) (.cse7 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse8 (= ~m_st~0 0)) (.cse9 (= ~q_free~0 1)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse11 (<= ~t1_pc~0 0)) (.cse12 (= ~q_write_ev~0 2)) (.cse13 (= ~q_read_ev~0 2)) (.cse21 (not .cse19)) (.cse14 (= ~p_dw_i~0 1)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~E_M~0 2)) (.cse17 (= ~token~0 ~local~0)) (.cse18 (= ~M_E~0 2))) (or (and (<= 2 ~q_write_ev~0) (let ((.cse3 (= ~c_num_read~0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse14 .cse15 .cse16 .cse17 .cse18))) (<= 1 ~q_read_ev~0)) (and .cse0 .cse1 .cse2 .cse20 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 (= ~q_free~0 0) .cse11 .cse12 .cse13 .cse21 .cse14 (= ~p_num_write~0 1) .cse16 .cse17 .cse18) (and (= ~p_dw_pc~0 0) .cse1 (= ~p_num_write~0 0) .cse20 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~q_req_up~0 0) .cse12 .cse22 .cse13 .cse21 .cse14 .cse15 .cse16 .cse17 .cse18)))) [2023-12-19 01:34:53,676 INFO L899 garLoopResultBuilder]: For program point L646(lines 646 650) no Hoare annotation was computed. [2023-12-19 01:34:53,676 INFO L899 garLoopResultBuilder]: For program point L646-2(lines 645 658) no Hoare annotation was computed. [2023-12-19 01:34:53,676 INFO L899 garLoopResultBuilder]: For program point L84(lines 72 86) no Hoare annotation was computed. [2023-12-19 01:34:53,677 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 69 87) no Hoare annotation was computed. [2023-12-19 01:34:53,677 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 79) no Hoare annotation was computed. [2023-12-19 01:34:53,677 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 69 87) the Hoare annotation is: true [2023-12-19 01:34:53,677 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 82) no Hoare annotation was computed. [2023-12-19 01:34:53,677 INFO L899 garLoopResultBuilder]: For program point L73-2(lines 73 82) no Hoare annotation was computed. [2023-12-19 01:34:53,677 INFO L899 garLoopResultBuilder]: For program point L275(lines 262 277) no Hoare annotation was computed. [2023-12-19 01:34:53,677 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 272) no Hoare annotation was computed. [2023-12-19 01:34:53,677 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 259 278) the Hoare annotation is: true [2023-12-19 01:34:53,677 INFO L899 garLoopResultBuilder]: For program point L263(lines 263 273) no Hoare annotation was computed. [2023-12-19 01:34:53,677 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 259 278) no Hoare annotation was computed. [2023-12-19 01:34:53,677 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 24 31) the Hoare annotation is: true [2023-12-19 01:34:53,677 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 28) no Hoare annotation was computed. [2023-12-19 01:34:53,677 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 24 31) no Hoare annotation was computed. [2023-12-19 01:34:53,677 INFO L899 garLoopResultBuilder]: For program point L668(lines 668 673) no Hoare annotation was computed. [2023-12-19 01:34:53,677 INFO L899 garLoopResultBuilder]: For program point L664(lines 664 674) no Hoare annotation was computed. [2023-12-19 01:34:53,677 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 660 679) the Hoare annotation is: true [2023-12-19 01:34:53,677 INFO L899 garLoopResultBuilder]: For program point L676(lines 663 678) no Hoare annotation was computed. [2023-12-19 01:34:53,677 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 660 679) no Hoare annotation was computed. [2023-12-19 01:34:53,677 INFO L899 garLoopResultBuilder]: For program point L306-1(lines 297 314) no Hoare annotation was computed. [2023-12-19 01:34:53,677 INFO L899 garLoopResultBuilder]: For program point L301-1(lines 300 313) no Hoare annotation was computed. [2023-12-19 01:34:53,678 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 297 314) the Hoare annotation is: (let ((.cse32 (= ~c_dr_pc~0 1)) (.cse30 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse33 (= ~q_read_ev~0 2))) (let ((.cse3 (< |old(~q_write_ev~0)| 1)) (.cse16 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse8 (not (= ~q_free~0 0))) (.cse17 (and .cse30 .cse33)) (.cse20 (and (= ~q_write_ev~0 2) .cse33)) (.cse21 (not (= ~c_dr_pc~0 0))) (.cse22 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) (.cse23 (not (= ~p_num_write~0 0))) (.cse24 (not (= ~p_dw_pc~0 0))) (.cse25 (not (= ~c_num_read~0 0))) (.cse12 (not (= |old(~q_read_ev~0)| 2))) (.cse27 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse19 (= ~c_dr_st~0 0)) (.cse0 (not (= ~q_req_up~0 0))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (< 0 ~t1_pc~0)) (.cse31 (< |old(~q_write_ev~0)| 2)) (.cse4 (not (= ~M_E~0 2))) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse7 (= ~m_pc~0 1)) (.cse28 (and .cse30 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse29 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse9 (= ~p_dw_st~0 0)) (.cse10 (not (= ~T1_E~0 ~M_E~0))) (.cse11 (not (= ~m_st~0 0))) (.cse13 (not .cse32)) (.cse14 (< ~E_1~0 2)) (.cse15 (not (= ~p_dw_i~0 1))) (.cse26 (not (= ~q_free~0 1))) (.cse18 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse19 .cse0 .cse1 .cse4 .cse20 .cse21 .cse22 .cse5 .cse23 .cse24 .cse6 .cse7 .cse25 .cse10 .cse12 .cse26 .cse27) (or .cse2 .cse3 .cse28 .cse11 (and (or .cse19 .cse0 .cse1 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12) (or .cse19 .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse29 .cse9 .cse10 .cse12 .cse13 .cse26)) .cse14 .cse15 .cse18) (or .cse19 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= |old(~q_write_ev~0)| 0) .cse16 .cse17 .cse18) (or .cse19 .cse0 .cse1 .cse2 (and (= ~q_read_ev~0 1) .cse30) .cse31 .cse4 .cse5 .cse6 .cse29 .cse10 .cse11 (not (= |old(~q_read_ev~0)| 1)) .cse13 .cse14 .cse15 .cse26 .cse18) (or .cse19 .cse1 .cse4 .cse5 .cse32 .cse6 .cse7 .cse8 .cse10 .cse12 .cse17) (or .cse0 .cse1 (not .cse9) .cse2 .cse4 .cse20 .cse21 .cse22 .cse5 .cse23 .cse24 .cse6 .cse25 .cse10 .cse11 .cse12 .cse14 .cse15 .cse26 .cse27 .cse18) (or .cse19 .cse0 .cse1 .cse2 .cse31 .cse4 .cse5 .cse6 .cse7 .cse28 .cse29 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse26 .cse18)))) [2023-12-19 01:34:53,678 INFO L899 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 297 314) no Hoare annotation was computed. [2023-12-19 01:34:53,678 INFO L899 garLoopResultBuilder]: For program point L768-1(lines 762 785) no Hoare annotation was computed. [2023-12-19 01:34:53,678 INFO L899 garLoopResultBuilder]: For program point L763-1(lines 762 785) no Hoare annotation was computed. [2023-12-19 01:34:53,678 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 759 786) no Hoare annotation was computed. [2023-12-19 01:34:53,678 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 759 786) the Hoare annotation is: (let ((.cse18 (< ~t1_st~0 2)) (.cse4 (not (= ~t1_pc~0 1))) (.cse7 (and (<= 1 ~m_pc~0) (or (< ~m_pc~0 2) (< 1 ~t1_pc~0)))) (.cse3 (< ~m_st~0 2)) (.cse0 (not (= ~q_req_up~0 0))) (.cse20 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse21 (< 0 ~t1_pc~0)) (.cse2 (not (= ~c_dr_pc~0 0))) (.cse5 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse6 (not (= ~p_num_write~0 0))) (.cse8 (not (= ~p_dw_pc~0 0))) (.cse9 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (not (= ~c_num_read~0 0))) (.cse11 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))) (.cse12 (not (= ~q_free~0 0))) (.cse13 (< |old(~E_1~0)| 2)) (.cse14 (< |old(~E_M~0)| 2)) (.cse19 (not (= ~m_st~0 0))) (.cse15 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse16 (< |old(~T1_E~0)| 2)) (.cse17 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse18 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 (not (= (+ ~local~0 1) ~token~0)) .cse15 .cse16) (or .cse0 .cse18 .cse20 .cse1 .cse21 .cse2 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse15 .cse16) (or .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse18 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse21 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse20 .cse1 .cse21 .cse2 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse15 .cse16 .cse17))) [2023-12-19 01:34:53,678 INFO L899 garLoopResultBuilder]: For program point L778-1(lines 759 786) no Hoare annotation was computed. [2023-12-19 01:34:53,678 INFO L899 garLoopResultBuilder]: For program point L773-1(lines 762 785) no Hoare annotation was computed. [2023-12-19 01:34:53,694 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:34:53,695 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 01:34:53,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 01:34:53 BoogieIcfgContainer [2023-12-19 01:34:53,755 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 01:34:53,756 INFO L158 Benchmark]: Toolchain (without parser) took 86214.57ms. Allocated memory was 212.9MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 167.8MB in the beginning and 947.5MB in the end (delta: -779.7MB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2023-12-19 01:34:53,756 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 212.9MB. Free memory is still 170.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 01:34:53,756 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.00ms. Allocated memory is still 212.9MB. Free memory was 167.8MB in the beginning and 150.4MB in the end (delta: 17.4MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-19 01:34:53,756 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.39ms. Allocated memory is still 212.9MB. Free memory was 150.4MB in the beginning and 147.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-19 01:34:53,756 INFO L158 Benchmark]: Boogie Preprocessor took 46.96ms. Allocated memory is still 212.9MB. Free memory was 147.6MB in the beginning and 144.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 01:34:53,756 INFO L158 Benchmark]: RCFGBuilder took 681.65ms. Allocated memory is still 212.9MB. Free memory was 144.5MB in the beginning and 183.3MB in the end (delta: -38.8MB). Peak memory consumption was 35.6MB. Max. memory is 8.0GB. [2023-12-19 01:34:53,757 INFO L158 Benchmark]: TraceAbstraction took 85137.76ms. Allocated memory was 212.9MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 182.8MB in the beginning and 947.5MB in the end (delta: -764.7MB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2023-12-19 01:34:53,757 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.13ms. Allocated memory is still 212.9MB. Free memory is still 170.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 296.00ms. Allocated memory is still 212.9MB. Free memory was 167.8MB in the beginning and 150.4MB in the end (delta: 17.4MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.39ms. Allocated memory is still 212.9MB. Free memory was 150.4MB in the beginning and 147.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.96ms. Allocated memory is still 212.9MB. Free memory was 147.6MB in the beginning and 144.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 681.65ms. Allocated memory is still 212.9MB. Free memory was 144.5MB in the beginning and 183.3MB in the end (delta: -38.8MB). Peak memory consumption was 35.6MB. Max. memory is 8.0GB. * TraceAbstraction took 85137.76ms. Allocated memory was 212.9MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 182.8MB in the beginning and 947.5MB in the end (delta: -764.7MB). Peak memory consumption was 1.4GB. 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: 496]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 28]: 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 15 procedures, 186 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 85.0s, OverallIterations: 34, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 23.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 42.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16688 SdHoareTripleChecker+Valid, 9.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16286 mSDsluCounter, 18600 SdHoareTripleChecker+Invalid, 8.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12593 mSDsCounter, 3805 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16319 IncrementalHoareTripleChecker+Invalid, 20124 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3805 mSolverCounterUnsat, 6007 mSDtfsCounter, 16319 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3381 GetRequests, 2946 SyntacticMatches, 5 SemanticMatches, 430 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1446 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11796occurred in iteration=23, InterpolantAutomatonStates: 383, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.4s AutomataMinimizationTime, 34 MinimizatonAttempts, 7613 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 50 LocationsWithAnnotation, 8611 PreInvPairs, 9181 NumberOfFragments, 14482 HoareAnnotationTreeSize, 8611 FormulaSimplifications, 364701 FormulaSimplificationTreeSizeReduction, 21.3s HoareSimplificationTime, 50 FormulaSimplificationsInter, 126849 FormulaSimplificationTreeSizeReductionInter, 21.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 4937 NumberOfCodeBlocks, 4937 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 5331 ConstructedInterpolants, 0 QuantifiedInterpolants, 9551 SizeOfPredicates, 3 NumberOfNonLiveVariables, 6125 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 51 InterpolantComputations, 31 PerfectInterpolantSequences, 2555/2756 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 2 specifications checked. All of them hold - InvariantResult [Line: 575]: Loop Invariant Derived loop invariant: ((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) || ((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) || (((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && ((local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) - InvariantResult [Line: 904]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) || (((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) || ((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && ((local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((((((((((2 <= t1_st) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) || (((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (q_free == 0)) && (2 <= m_st)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: (((((2 <= q_write_ev) && (((((((((((((((((((q_req_up == 1) && (2 <= E_1)) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (q_write_ev == 2)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (M_E == 2)) || (((((((((((((((((q_req_up == 1) && (2 <= E_1)) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (M_E == 2)))) && (1 <= q_read_ev)) || (((((((((((((((((((q_req_up == 1) && (2 <= E_1)) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (q_write_ev == 2)) && (q_read_ev == 2)) && !((c_dr_pc == 1))) && (p_dw_i == 1)) && (p_num_write == 1)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || (((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (q_req_up == 0)) && (q_write_ev == 2)) && (p_dw_st == 0)) && (q_read_ev == 2)) && !((c_dr_pc == 1))) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (M_E == 2))) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (M_E == 2)) || ((((((((((p_last_write == q_buf_0) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && !((c_dr_st == 0))) && (q_free == 0)) && (q_read_ev == 2)) && !((c_dr_pc == 1))) && (E_M == 2)) && (M_E == 2))) || (((((((((((((((((((q_req_up == 1) && (2 <= E_1)) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (t1_pc <= 0)) && (q_write_ev == 2)) && (q_read_ev == 2)) && !((c_dr_pc == 1))) && (p_dw_i == 1)) && (p_num_write == 1)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || (((((((((((((((((q_req_up == 1) && (2 <= E_1)) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || ((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && !((c_dr_st == 0))) && (q_req_up == 0)) && (q_write_ev == 2)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (M_E == 2))) || (((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || ((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_pc <= 0)) && (q_req_up == 0)) && (q_write_ev == 2)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (M_E == 2))) - InvariantResult [Line: 531]: Loop Invariant Derived loop invariant: (((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) || ((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && ((local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && !((m_pc == 1))) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) - InvariantResult [Line: 686]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) || (((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) || ((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && ((local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((((((((((2 <= t1_st) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) || (((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (q_free == 0)) && (2 <= m_st)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) - InvariantResult [Line: 427]: Loop Invariant Derived loop invariant: (((((((((((((((((p_last_write == q_buf_0) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && !((c_dr_st == 0))) && (q_free == 0)) && (q_read_ev == 2)) && !((c_dr_pc == 1))) && (E_M == 2)) && (M_E == 2)) || ((((((((((((((((((2 <= E_1) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && !((m_pc == 1))) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || ((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_pc <= 0)) && (q_req_up == 0)) && (q_write_ev == 2)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || ((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && !((m_pc == 1))) && (2 <= q_write_ev)) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || ((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && !((c_dr_st == 0))) && (q_req_up == 0)) && (q_write_ev == 2)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (M_E == 2))) || ((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && !((m_pc == 1))) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || ((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || (((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && !((q_write_ev == 0))) && (T1_E == 2)) && (m_st == 0)) && !((m_pc == 1))) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (M_E == 2))) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: ((((((((((((((((((((p_last_write == q_buf_0) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && !((c_dr_st == 0))) && (q_free == 0)) && (q_read_ev == 2)) && !((c_dr_pc == 1))) && (E_M == 2)) && (M_E == 2)) || (((((((((((((((((((q_req_up == 1) && (2 <= E_1)) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || ((((((((((((((((((2 <= E_1) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && !((m_pc == 1))) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || ((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_pc <= 0)) && (q_req_up == 0)) && (q_write_ev == 2)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || ((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && !((m_pc == 1))) && (2 <= q_write_ev)) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || ((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && !((c_dr_st == 0))) && (q_req_up == 0)) && (q_write_ev == 2)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (M_E == 2))) || (((((((((((((((((((q_req_up == 1) && (2 <= E_1)) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (1 <= tmp___1)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (q_write_ev == 2)) && (q_read_ev == 2)) && !((c_dr_pc == 1))) && (p_dw_i == 1)) && (p_num_write == 1)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || ((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && !((m_pc == 1))) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || ((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || (((((((((((((((((q_req_up == 1) && (2 <= E_1)) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || (((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && !((q_write_ev == 0))) && (T1_E == 2)) && (m_st == 0)) && !((m_pc == 1))) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (M_E == 2))) RESULT: Ultimate proved your program to be correct! [2023-12-19 01:34:53,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...