./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1bc25ea26c5b0a3f713e59ee991d97185223a272bca137eca8d49c3babbebcf9 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 21:18:01,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 21:18:01,566 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 21:18:01,579 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 21:18:01,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 21:18:01,580 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 21:18:01,581 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 21:18:01,581 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 21:18:01,582 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 21:18:01,583 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 21:18:01,584 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 21:18:01,584 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 21:18:01,584 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 21:18:01,585 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 21:18:01,586 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 21:18:01,586 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 21:18:01,587 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 21:18:01,587 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 21:18:01,588 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 21:18:01,589 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 21:18:01,590 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 21:18:01,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 21:18:01,592 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 21:18:01,592 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 21:18:01,594 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 21:18:01,594 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 21:18:01,595 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 21:18:01,595 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 21:18:01,595 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 21:18:01,596 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 21:18:01,596 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 21:18:01,597 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 21:18:01,597 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 21:18:01,598 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 21:18:01,598 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 21:18:01,598 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 21:18:01,599 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 21:18:01,599 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 21:18:01,599 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 21:18:01,600 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 21:18:01,600 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 21:18:01,601 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 21:18:01,614 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 21:18:01,614 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 21:18:01,615 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 21:18:01,615 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 21:18:01,615 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 21:18:01,615 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 21:18:01,616 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 21:18:01,616 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 21:18:01,616 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 21:18:01,616 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 21:18:01,616 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 21:18:01,616 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 21:18:01,616 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 21:18:01,616 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 21:18:01,617 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 21:18:01,617 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 21:18:01,617 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 21:18:01,617 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 21:18:01,617 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 21:18:01,617 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 21:18:01,617 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 21:18:01,617 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 21:18:01,617 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 21:18:01,617 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 21:18:01,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:18:01,618 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 21:18:01,618 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 21:18:01,618 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 21:18:01,618 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 21:18:01,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 21:18:01,618 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 21:18:01,618 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 21:18:01,618 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 21:18:01,618 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 21:18:01,619 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 21:18:01,619 INFO L138 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1bc25ea26c5b0a3f713e59ee991d97185223a272bca137eca8d49c3babbebcf9 [2022-12-13 21:18:01,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 21:18:01,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 21:18:01,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 21:18:01,798 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 21:18:01,798 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 21:18:01,799 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2022-12-13 21:18:04,415 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 21:18:04,599 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 21:18:04,599 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2022-12-13 21:18:04,609 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/data/1ed112c23/01e675b1685b4fd5927db66d81d17904/FLAG93c3ebd4e [2022-12-13 21:18:04,620 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/data/1ed112c23/01e675b1685b4fd5927db66d81d17904 [2022-12-13 21:18:04,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 21:18:04,623 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 21:18:04,624 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 21:18:04,624 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 21:18:04,627 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 21:18:04,627 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:18:04" (1/1) ... [2022-12-13 21:18:04,628 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@655d5d3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:18:04, skipping insertion in model container [2022-12-13 21:18:04,628 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:18:04" (1/1) ... [2022-12-13 21:18:04,633 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 21:18:04,655 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 21:18:04,756 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[913,926] [2022-12-13 21:18:04,785 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[5977,5990] [2022-12-13 21:18:04,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:18:04,813 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 21:18:04,821 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[913,926] [2022-12-13 21:18:04,833 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[5977,5990] [2022-12-13 21:18:04,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:18:04,859 INFO L208 MainTranslator]: Completed translation [2022-12-13 21:18:04,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:18:04 WrapperNode [2022-12-13 21:18:04,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 21:18:04,860 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 21:18:04,860 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 21:18:04,860 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 21:18:04,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:18:04" (1/1) ... [2022-12-13 21:18:04,872 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:18:04" (1/1) ... [2022-12-13 21:18:04,892 INFO L138 Inliner]: procedures = 50, calls = 51, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 417 [2022-12-13 21:18:04,893 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 21:18:04,893 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 21:18:04,893 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 21:18:04,893 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 21:18:04,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:18:04" (1/1) ... [2022-12-13 21:18:04,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:18:04" (1/1) ... [2022-12-13 21:18:04,904 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:18:04" (1/1) ... [2022-12-13 21:18:04,905 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:18:04" (1/1) ... [2022-12-13 21:18:04,911 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:18:04" (1/1) ... [2022-12-13 21:18:04,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:18:04" (1/1) ... [2022-12-13 21:18:04,920 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:18:04" (1/1) ... [2022-12-13 21:18:04,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:18:04" (1/1) ... [2022-12-13 21:18:04,925 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 21:18:04,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 21:18:04,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 21:18:04,926 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 21:18:04,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:18:04" (1/1) ... [2022-12-13 21:18:04,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:18:04,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:18:04,955 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 21:18:04,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 21:18:04,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 21:18:04,990 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-12-13 21:18:04,990 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-12-13 21:18:04,990 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2022-12-13 21:18:04,990 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2022-12-13 21:18:04,991 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-12-13 21:18:04,991 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-12-13 21:18:04,991 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-12-13 21:18:04,991 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-12-13 21:18:04,991 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-12-13 21:18:04,991 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-12-13 21:18:04,991 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-12-13 21:18:04,992 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-12-13 21:18:04,992 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-12-13 21:18:04,992 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-12-13 21:18:04,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 21:18:04,992 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-12-13 21:18:04,992 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-12-13 21:18:04,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 21:18:04,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 21:18:04,993 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-12-13 21:18:04,993 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-12-13 21:18:05,072 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 21:18:05,075 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 21:18:05,439 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 21:18:05,447 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 21:18:05,448 INFO L300 CfgBuilder]: Removed 8 assume(true) statements. [2022-12-13 21:18:05,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:18:05 BoogieIcfgContainer [2022-12-13 21:18:05,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 21:18:05,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 21:18:05,453 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 21:18:05,456 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 21:18:05,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:18:04" (1/3) ... [2022-12-13 21:18:05,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a737ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:18:05, skipping insertion in model container [2022-12-13 21:18:05,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:18:04" (2/3) ... [2022-12-13 21:18:05,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a737ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:18:05, skipping insertion in model container [2022-12-13 21:18:05,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:18:05" (3/3) ... [2022-12-13 21:18:05,458 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2022-12-13 21:18:05,474 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 21:18:05,474 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 21:18:05,526 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 21:18:05,531 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=LoopsAndPotentialCycles, 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;@cc6861a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 21:18:05,531 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-13 21:18:05,535 INFO L276 IsEmpty]: Start isEmpty. Operand has 179 states, 146 states have (on average 1.5410958904109588) internal successors, (225), 151 states have internal predecessors, (225), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-12-13 21:18:05,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-13 21:18:05,544 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:18:05,545 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] [2022-12-13 21:18:05,545 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:18:05,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:18:05,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1946471914, now seen corresponding path program 1 times [2022-12-13 21:18:05,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:18:05,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382127670] [2022-12-13 21:18:05,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:05,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:18:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:05,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:18:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:05,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 21:18:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:05,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:18:05,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:18:05,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382127670] [2022-12-13 21:18:05,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382127670] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:18:05,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:18:05,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:18:05,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630619108] [2022-12-13 21:18:05,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:18:05,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:18:05,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:18:05,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:18:05,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:18:05,847 INFO L87 Difference]: Start difference. First operand has 179 states, 146 states have (on average 1.5410958904109588) internal successors, (225), 151 states have internal predecessors, (225), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 21:18:06,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:18:06,096 INFO L93 Difference]: Finished difference Result 414 states and 624 transitions. [2022-12-13 21:18:06,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:18:06,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-12-13 21:18:06,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:18:06,108 INFO L225 Difference]: With dead ends: 414 [2022-12-13 21:18:06,109 INFO L226 Difference]: Without dead ends: 239 [2022-12-13 21:18:06,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:18:06,115 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 284 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:18:06,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 418 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 21:18:06,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-12-13 21:18:06,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 233. [2022-12-13 21:18:06,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 195 states have (on average 1.405128205128205) internal successors, (274), 199 states have internal predecessors, (274), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (29), 23 states have call predecessors, (29), 23 states have call successors, (29) [2022-12-13 21:18:06,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 328 transitions. [2022-12-13 21:18:06,172 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 328 transitions. Word has length 44 [2022-12-13 21:18:06,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:18:06,173 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 328 transitions. [2022-12-13 21:18:06,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 21:18:06,173 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 328 transitions. [2022-12-13 21:18:06,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 21:18:06,175 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:18:06,175 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] [2022-12-13 21:18:06,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 21:18:06,175 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:18:06,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:18:06,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1644174286, now seen corresponding path program 1 times [2022-12-13 21:18:06,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:18:06,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187287003] [2022-12-13 21:18:06,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:06,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:18:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:06,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:18:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:06,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 21:18:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:06,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:18:06,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:18:06,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187287003] [2022-12-13 21:18:06,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187287003] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:18:06,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:18:06,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:18:06,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391490162] [2022-12-13 21:18:06,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:18:06,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:18:06,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:18:06,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:18:06,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:18:06,242 INFO L87 Difference]: Start difference. First operand 233 states and 328 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 21:18:06,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:18:06,421 INFO L93 Difference]: Finished difference Result 481 states and 668 transitions. [2022-12-13 21:18:06,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:18:06,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-12-13 21:18:06,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:18:06,425 INFO L225 Difference]: With dead ends: 481 [2022-12-13 21:18:06,425 INFO L226 Difference]: Without dead ends: 357 [2022-12-13 21:18:06,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:18:06,427 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 149 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:18:06,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 515 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:18:06,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-12-13 21:18:06,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 300. [2022-12-13 21:18:06,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 256 states have (on average 1.3984375) internal successors, (358), 260 states have internal predecessors, (358), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) [2022-12-13 21:18:06,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 418 transitions. [2022-12-13 21:18:06,465 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 418 transitions. Word has length 45 [2022-12-13 21:18:06,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:18:06,465 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 418 transitions. [2022-12-13 21:18:06,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 21:18:06,465 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 418 transitions. [2022-12-13 21:18:06,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 21:18:06,468 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:18:06,468 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] [2022-12-13 21:18:06,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 21:18:06,468 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:18:06,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:18:06,469 INFO L85 PathProgramCache]: Analyzing trace with hash 359816825, now seen corresponding path program 1 times [2022-12-13 21:18:06,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:18:06,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380895849] [2022-12-13 21:18:06,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:06,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:18:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:06,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:18:06,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:06,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 21:18:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:06,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:18:06,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:18:06,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380895849] [2022-12-13 21:18:06,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380895849] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:18:06,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:18:06,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:18:06,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162883181] [2022-12-13 21:18:06,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:18:06,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:18:06,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:18:06,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:18:06,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:18:06,533 INFO L87 Difference]: Start difference. First operand 300 states and 418 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 21:18:06,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:18:06,705 INFO L93 Difference]: Finished difference Result 708 states and 977 transitions. [2022-12-13 21:18:06,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:18:06,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-12-13 21:18:06,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:18:06,709 INFO L225 Difference]: With dead ends: 708 [2022-12-13 21:18:06,709 INFO L226 Difference]: Without dead ends: 517 [2022-12-13 21:18:06,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:18:06,712 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 293 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:18:06,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 408 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:18:06,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2022-12-13 21:18:06,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 465. [2022-12-13 21:18:06,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 402 states have (on average 1.36318407960199) internal successors, (548), 409 states have internal predecessors, (548), 39 states have call successors, (39), 21 states have call predecessors, (39), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2022-12-13 21:18:06,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 636 transitions. [2022-12-13 21:18:06,752 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 636 transitions. Word has length 45 [2022-12-13 21:18:06,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:18:06,753 INFO L495 AbstractCegarLoop]: Abstraction has 465 states and 636 transitions. [2022-12-13 21:18:06,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 21:18:06,753 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 636 transitions. [2022-12-13 21:18:06,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 21:18:06,755 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:18:06,755 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] [2022-12-13 21:18:06,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 21:18:06,756 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:18:06,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:18:06,756 INFO L85 PathProgramCache]: Analyzing trace with hash -443803124, now seen corresponding path program 1 times [2022-12-13 21:18:06,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:18:06,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911652164] [2022-12-13 21:18:06,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:06,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:18:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:06,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:18:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:06,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 21:18:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:06,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 21:18:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:06,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:18:06,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:06,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 21:18:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:06,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:18:06,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:18:06,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911652164] [2022-12-13 21:18:06,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911652164] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:18:06,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:18:06,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:18:06,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262327370] [2022-12-13 21:18:06,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:18:06,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:18:06,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:18:06,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:18:06,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:18:06,827 INFO L87 Difference]: Start difference. First operand 465 states and 636 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:18:07,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:18:07,113 INFO L93 Difference]: Finished difference Result 582 states and 808 transitions. [2022-12-13 21:18:07,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:18:07,113 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-12-13 21:18:07,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:18:07,115 INFO L225 Difference]: With dead ends: 582 [2022-12-13 21:18:07,115 INFO L226 Difference]: Without dead ends: 486 [2022-12-13 21:18:07,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:18:07,116 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 267 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:18:07,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 436 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 21:18:07,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2022-12-13 21:18:07,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 465. [2022-12-13 21:18:07,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 402 states have (on average 1.3606965174129353) internal successors, (547), 409 states have internal predecessors, (547), 39 states have call successors, (39), 21 states have call predecessors, (39), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2022-12-13 21:18:07,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 635 transitions. [2022-12-13 21:18:07,141 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 635 transitions. Word has length 57 [2022-12-13 21:18:07,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:18:07,141 INFO L495 AbstractCegarLoop]: Abstraction has 465 states and 635 transitions. [2022-12-13 21:18:07,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:18:07,142 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 635 transitions. [2022-12-13 21:18:07,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 21:18:07,143 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:18:07,143 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] [2022-12-13 21:18:07,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 21:18:07,143 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:18:07,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:18:07,144 INFO L85 PathProgramCache]: Analyzing trace with hash -428284406, now seen corresponding path program 1 times [2022-12-13 21:18:07,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:18:07,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197289106] [2022-12-13 21:18:07,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:07,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:18:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:07,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:18:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:07,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 21:18:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:07,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 21:18:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:07,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:18:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:07,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 21:18:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:07,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:18:07,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:18:07,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197289106] [2022-12-13 21:18:07,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197289106] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:18:07,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:18:07,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:18:07,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269145973] [2022-12-13 21:18:07,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:18:07,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:18:07,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:18:07,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:18:07,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:18:07,227 INFO L87 Difference]: Start difference. First operand 465 states and 635 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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) [2022-12-13 21:18:07,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:18:07,665 INFO L93 Difference]: Finished difference Result 689 states and 962 transitions. [2022-12-13 21:18:07,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 21:18:07,666 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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 57 [2022-12-13 21:18:07,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:18:07,669 INFO L225 Difference]: With dead ends: 689 [2022-12-13 21:18:07,669 INFO L226 Difference]: Without dead ends: 596 [2022-12-13 21:18:07,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-13 21:18:07,671 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 442 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 21:18:07,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 579 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 21:18:07,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-12-13 21:18:07,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 555. [2022-12-13 21:18:07,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 475 states have (on average 1.3726315789473684) internal successors, (652), 483 states have internal predecessors, (652), 49 states have call successors, (49), 27 states have call predecessors, (49), 29 states have return successors, (62), 45 states have call predecessors, (62), 47 states have call successors, (62) [2022-12-13 21:18:07,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 763 transitions. [2022-12-13 21:18:07,718 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 763 transitions. Word has length 57 [2022-12-13 21:18:07,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:18:07,718 INFO L495 AbstractCegarLoop]: Abstraction has 555 states and 763 transitions. [2022-12-13 21:18:07,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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) [2022-12-13 21:18:07,719 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 763 transitions. [2022-12-13 21:18:07,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 21:18:07,720 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:18:07,720 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] [2022-12-13 21:18:07,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 21:18:07,720 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:18:07,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:18:07,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1340236402, now seen corresponding path program 1 times [2022-12-13 21:18:07,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:18:07,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389810831] [2022-12-13 21:18:07,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:07,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:18:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:07,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:18:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:07,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 21:18:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:07,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 21:18:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:07,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:18:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:07,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 21:18:07,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:07,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:18:07,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:18:07,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389810831] [2022-12-13 21:18:07,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389810831] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:18:07,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:18:07,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:18:07,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707401920] [2022-12-13 21:18:07,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:18:07,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:18:07,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:18:07,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:18:07,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:18:07,814 INFO L87 Difference]: Start difference. First operand 555 states and 763 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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) [2022-12-13 21:18:08,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:18:08,380 INFO L93 Difference]: Finished difference Result 887 states and 1237 transitions. [2022-12-13 21:18:08,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 21:18:08,381 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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 57 [2022-12-13 21:18:08,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:18:08,383 INFO L225 Difference]: With dead ends: 887 [2022-12-13 21:18:08,383 INFO L226 Difference]: Without dead ends: 704 [2022-12-13 21:18:08,384 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 [2022-12-13 21:18:08,384 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 441 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 21:18:08,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 895 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 21:18:08,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2022-12-13 21:18:08,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 640. [2022-12-13 21:18:08,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 543 states have (on average 1.3756906077348066) internal successors, (747), 552 states have internal predecessors, (747), 59 states have call successors, (59), 33 states have call predecessors, (59), 36 states have return successors, (74), 56 states have call predecessors, (74), 57 states have call successors, (74) [2022-12-13 21:18:08,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 880 transitions. [2022-12-13 21:18:08,413 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 880 transitions. Word has length 57 [2022-12-13 21:18:08,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:18:08,413 INFO L495 AbstractCegarLoop]: Abstraction has 640 states and 880 transitions. [2022-12-13 21:18:08,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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) [2022-12-13 21:18:08,413 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 880 transitions. [2022-12-13 21:18:08,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 21:18:08,414 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:18:08,414 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] [2022-12-13 21:18:08,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 21:18:08,415 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:18:08,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:18:08,415 INFO L85 PathProgramCache]: Analyzing trace with hash 905343052, now seen corresponding path program 1 times [2022-12-13 21:18:08,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:18:08,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369798304] [2022-12-13 21:18:08,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:08,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:18:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:08,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:18:08,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:08,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 21:18:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:08,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 21:18:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:08,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:18:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:08,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 21:18:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:08,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:18:08,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:18:08,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369798304] [2022-12-13 21:18:08,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369798304] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:18:08,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:18:08,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:18:08,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290545972] [2022-12-13 21:18:08,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:18:08,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:18:08,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:18:08,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:18:08,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:18:08,507 INFO L87 Difference]: Start difference. First operand 640 states and 880 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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) [2022-12-13 21:18:09,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:18:09,105 INFO L93 Difference]: Finished difference Result 1198 states and 1670 transitions. [2022-12-13 21:18:09,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 21:18:09,106 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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 57 [2022-12-13 21:18:09,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:18:09,110 INFO L225 Difference]: With dead ends: 1198 [2022-12-13 21:18:09,110 INFO L226 Difference]: Without dead ends: 930 [2022-12-13 21:18:09,111 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 [2022-12-13 21:18:09,112 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 449 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 21:18:09,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 879 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 21:18:09,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2022-12-13 21:18:09,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 798. [2022-12-13 21:18:09,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 669 states have (on average 1.3811659192825112) internal successors, (924), 680 states have internal predecessors, (924), 77 states have call successors, (77), 45 states have call predecessors, (77), 50 states have return successors, (100), 76 states have call predecessors, (100), 75 states have call successors, (100) [2022-12-13 21:18:09,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1101 transitions. [2022-12-13 21:18:09,178 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1101 transitions. Word has length 57 [2022-12-13 21:18:09,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:18:09,178 INFO L495 AbstractCegarLoop]: Abstraction has 798 states and 1101 transitions. [2022-12-13 21:18:09,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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) [2022-12-13 21:18:09,178 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1101 transitions. [2022-12-13 21:18:09,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 21:18:09,179 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:18:09,179 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] [2022-12-13 21:18:09,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 21:18:09,179 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:18:09,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:18:09,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1153489546, now seen corresponding path program 1 times [2022-12-13 21:18:09,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:18:09,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372032750] [2022-12-13 21:18:09,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:09,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:18:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:09,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:18:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:09,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 21:18:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:09,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 21:18:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:09,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:18:09,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:09,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 21:18:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:09,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:18:09,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:18:09,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372032750] [2022-12-13 21:18:09,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372032750] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:18:09,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:18:09,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:18:09,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396791249] [2022-12-13 21:18:09,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:18:09,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:18:09,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:18:09,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:18:09,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:18:09,267 INFO L87 Difference]: Start difference. First operand 798 states and 1101 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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) [2022-12-13 21:18:09,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:18:09,721 INFO L93 Difference]: Finished difference Result 1381 states and 1951 transitions. [2022-12-13 21:18:09,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 21:18:09,721 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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 57 [2022-12-13 21:18:09,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:18:09,725 INFO L225 Difference]: With dead ends: 1381 [2022-12-13 21:18:09,726 INFO L226 Difference]: Without dead ends: 956 [2022-12-13 21:18:09,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-12-13 21:18:09,728 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 229 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 21:18:09,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 793 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 21:18:09,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2022-12-13 21:18:09,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 813. [2022-12-13 21:18:09,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 684 states have (on average 1.3728070175438596) internal successors, (939), 695 states have internal predecessors, (939), 77 states have call successors, (77), 45 states have call predecessors, (77), 50 states have return successors, (100), 76 states have call predecessors, (100), 75 states have call successors, (100) [2022-12-13 21:18:09,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1116 transitions. [2022-12-13 21:18:09,807 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1116 transitions. Word has length 57 [2022-12-13 21:18:09,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:18:09,808 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 1116 transitions. [2022-12-13 21:18:09,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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) [2022-12-13 21:18:09,808 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1116 transitions. [2022-12-13 21:18:09,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 21:18:09,809 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:18:09,810 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] [2022-12-13 21:18:09,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 21:18:09,810 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:18:09,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:18:09,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1081102988, now seen corresponding path program 1 times [2022-12-13 21:18:09,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:18:09,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085957703] [2022-12-13 21:18:09,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:09,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:18:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:09,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:18:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:09,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 21:18:09,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:09,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 21:18:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:09,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:18:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:09,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 21:18:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:09,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:18:09,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:18:09,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085957703] [2022-12-13 21:18:09,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085957703] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:18:09,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:18:09,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:18:09,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170953731] [2022-12-13 21:18:09,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:18:09,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:18:09,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:18:09,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:18:09,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:18:09,889 INFO L87 Difference]: Start difference. First operand 813 states and 1116 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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) [2022-12-13 21:18:10,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:18:10,351 INFO L93 Difference]: Finished difference Result 1803 states and 2499 transitions. [2022-12-13 21:18:10,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 21:18:10,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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 57 [2022-12-13 21:18:10,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:18:10,356 INFO L225 Difference]: With dead ends: 1803 [2022-12-13 21:18:10,356 INFO L226 Difference]: Without dead ends: 1363 [2022-12-13 21:18:10,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-12-13 21:18:10,358 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 581 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 21:18:10,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 680 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 21:18:10,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2022-12-13 21:18:10,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1204. [2022-12-13 21:18:10,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 1001 states have (on average 1.3716283716283717) internal successors, (1373), 1016 states have internal predecessors, (1373), 119 states have call successors, (119), 73 states have call predecessors, (119), 82 states have return successors, (152), 118 states have call predecessors, (152), 117 states have call successors, (152) [2022-12-13 21:18:10,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1644 transitions. [2022-12-13 21:18:10,423 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1644 transitions. Word has length 57 [2022-12-13 21:18:10,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:18:10,423 INFO L495 AbstractCegarLoop]: Abstraction has 1204 states and 1644 transitions. [2022-12-13 21:18:10,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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) [2022-12-13 21:18:10,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1644 transitions. [2022-12-13 21:18:10,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 21:18:10,424 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:18:10,425 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] [2022-12-13 21:18:10,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 21:18:10,425 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:18:10,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:18:10,425 INFO L85 PathProgramCache]: Analyzing trace with hash -690367987, now seen corresponding path program 1 times [2022-12-13 21:18:10,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:18:10,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989943150] [2022-12-13 21:18:10,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:10,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:18:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:10,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:18:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:10,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 21:18:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:10,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 21:18:10,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:10,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:18:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:10,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 21:18:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:10,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:18:10,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:18:10,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989943150] [2022-12-13 21:18:10,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989943150] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:18:10,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:18:10,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:18:10,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601462757] [2022-12-13 21:18:10,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:18:10,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:18:10,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:18:10,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:18:10,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:18:10,501 INFO L87 Difference]: Start difference. First operand 1204 states and 1644 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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) [2022-12-13 21:18:10,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:18:10,960 INFO L93 Difference]: Finished difference Result 2242 states and 3103 transitions. [2022-12-13 21:18:10,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 21:18:10,960 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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 57 [2022-12-13 21:18:10,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:18:10,964 INFO L225 Difference]: With dead ends: 2242 [2022-12-13 21:18:10,965 INFO L226 Difference]: Without dead ends: 1411 [2022-12-13 21:18:10,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-12-13 21:18:10,967 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 195 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 21:18:10,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 789 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 21:18:10,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2022-12-13 21:18:11,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1219. [2022-12-13 21:18:11,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 1016 states have (on average 1.361220472440945) internal successors, (1383), 1031 states have internal predecessors, (1383), 119 states have call successors, (119), 73 states have call predecessors, (119), 82 states have return successors, (152), 118 states have call predecessors, (152), 117 states have call successors, (152) [2022-12-13 21:18:11,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1654 transitions. [2022-12-13 21:18:11,035 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1654 transitions. Word has length 57 [2022-12-13 21:18:11,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:18:11,035 INFO L495 AbstractCegarLoop]: Abstraction has 1219 states and 1654 transitions. [2022-12-13 21:18:11,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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) [2022-12-13 21:18:11,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1654 transitions. [2022-12-13 21:18:11,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 21:18:11,036 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:18:11,036 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] [2022-12-13 21:18:11,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 21:18:11,036 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:18:11,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:18:11,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1232860047, now seen corresponding path program 1 times [2022-12-13 21:18:11,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:18:11,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460748251] [2022-12-13 21:18:11,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:11,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:18:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:11,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:18:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:11,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 21:18:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:11,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 21:18:11,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:11,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:18:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:11,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 21:18:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:11,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:18:11,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:18:11,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460748251] [2022-12-13 21:18:11,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460748251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:18:11,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:18:11,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 21:18:11,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228400679] [2022-12-13 21:18:11,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:18:11,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 21:18:11,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:18:11,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 21:18:11,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:18:11,128 INFO L87 Difference]: Start difference. First operand 1219 states and 1654 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:18:11,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:18:11,617 INFO L93 Difference]: Finished difference Result 1767 states and 2397 transitions. [2022-12-13 21:18:11,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 21:18:11,617 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-12-13 21:18:11,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:18:11,624 INFO L225 Difference]: With dead ends: 1767 [2022-12-13 21:18:11,624 INFO L226 Difference]: Without dead ends: 1237 [2022-12-13 21:18:11,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-12-13 21:18:11,626 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 504 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 21:18:11,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 813 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 21:18:11,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2022-12-13 21:18:11,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1051. [2022-12-13 21:18:11,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 879 states have (on average 1.3515358361774743) internal successors, (1188), 890 states have internal predecessors, (1188), 103 states have call successors, (103), 62 states have call predecessors, (103), 67 states have return successors, (120), 100 states have call predecessors, (120), 101 states have call successors, (120) [2022-12-13 21:18:11,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1411 transitions. [2022-12-13 21:18:11,682 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1411 transitions. Word has length 57 [2022-12-13 21:18:11,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:18:11,683 INFO L495 AbstractCegarLoop]: Abstraction has 1051 states and 1411 transitions. [2022-12-13 21:18:11,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:18:11,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1411 transitions. [2022-12-13 21:18:11,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 21:18:11,684 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:18:11,684 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] [2022-12-13 21:18:11,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 21:18:11,684 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:18:11,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:18:11,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1451714765, now seen corresponding path program 1 times [2022-12-13 21:18:11,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:18:11,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565663311] [2022-12-13 21:18:11,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:11,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:18:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:11,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:18:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:11,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 21:18:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:11,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 21:18:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:11,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:18:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:11,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 21:18:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:11,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:18:11,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:18:11,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565663311] [2022-12-13 21:18:11,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565663311] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:18:11,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:18:11,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 21:18:11,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571780124] [2022-12-13 21:18:11,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:18:11,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 21:18:11,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:18:11,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 21:18:11,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:18:11,770 INFO L87 Difference]: Start difference. First operand 1051 states and 1411 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:18:12,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:18:12,285 INFO L93 Difference]: Finished difference Result 2334 states and 3104 transitions. [2022-12-13 21:18:12,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 21:18:12,285 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-12-13 21:18:12,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:18:12,290 INFO L225 Difference]: With dead ends: 2334 [2022-12-13 21:18:12,291 INFO L226 Difference]: Without dead ends: 1657 [2022-12-13 21:18:12,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-12-13 21:18:12,292 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 516 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 21:18:12,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 812 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 21:18:12,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2022-12-13 21:18:12,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1365. [2022-12-13 21:18:12,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 1131 states have (on average 1.3386383731211318) internal successors, (1514), 1148 states have internal predecessors, (1514), 137 states have call successors, (137), 84 states have call predecessors, (137), 95 states have return successors, (168), 136 states have call predecessors, (168), 135 states have call successors, (168) [2022-12-13 21:18:12,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 1819 transitions. [2022-12-13 21:18:12,364 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 1819 transitions. Word has length 57 [2022-12-13 21:18:12,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:18:12,365 INFO L495 AbstractCegarLoop]: Abstraction has 1365 states and 1819 transitions. [2022-12-13 21:18:12,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:18:12,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1819 transitions. [2022-12-13 21:18:12,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 21:18:12,366 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:18:12,366 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] [2022-12-13 21:18:12,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 21:18:12,366 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:18:12,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:18:12,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1874416591, now seen corresponding path program 1 times [2022-12-13 21:18:12,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:18:12,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783568423] [2022-12-13 21:18:12,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:12,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:18:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:12,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:18:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:12,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 21:18:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:12,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 21:18:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:12,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:18:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:12,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 21:18:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:12,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:18:12,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:18:12,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783568423] [2022-12-13 21:18:12,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783568423] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:18:12,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:18:12,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 21:18:12,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902820681] [2022-12-13 21:18:12,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:18:12,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 21:18:12,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:18:12,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 21:18:12,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:18:12,464 INFO L87 Difference]: Start difference. First operand 1365 states and 1819 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:18:13,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:18:13,000 INFO L93 Difference]: Finished difference Result 2334 states and 3094 transitions. [2022-12-13 21:18:13,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 21:18:13,001 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-12-13 21:18:13,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:18:13,005 INFO L225 Difference]: With dead ends: 2334 [2022-12-13 21:18:13,005 INFO L226 Difference]: Without dead ends: 1633 [2022-12-13 21:18:13,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-12-13 21:18:13,006 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 504 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 21:18:13,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 805 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 21:18:13,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2022-12-13 21:18:13,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1355. [2022-12-13 21:18:13,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1355 states, 1125 states have (on average 1.3351111111111111) internal successors, (1502), 1138 states have internal predecessors, (1502), 137 states have call successors, (137), 84 states have call predecessors, (137), 91 states have return successors, (158), 134 states have call predecessors, (158), 135 states have call successors, (158) [2022-12-13 21:18:13,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 1797 transitions. [2022-12-13 21:18:13,081 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 1797 transitions. Word has length 57 [2022-12-13 21:18:13,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:18:13,081 INFO L495 AbstractCegarLoop]: Abstraction has 1355 states and 1797 transitions. [2022-12-13 21:18:13,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:18:13,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1797 transitions. [2022-12-13 21:18:13,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 21:18:13,082 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:18:13,082 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] [2022-12-13 21:18:13,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 21:18:13,082 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:18:13,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:18:13,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1056768141, now seen corresponding path program 1 times [2022-12-13 21:18:13,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:18:13,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458873932] [2022-12-13 21:18:13,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:13,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:18:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:13,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:18:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:13,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 21:18:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:13,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 21:18:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:13,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:18:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:13,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 21:18:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:13,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:18:13,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:18:13,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458873932] [2022-12-13 21:18:13,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458873932] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:18:13,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:18:13,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:18:13,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182472685] [2022-12-13 21:18:13,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:18:13,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:18:13,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:18:13,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:18:13,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:18:13,126 INFO L87 Difference]: Start difference. First operand 1355 states and 1797 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-13 21:18:13,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:18:13,584 INFO L93 Difference]: Finished difference Result 2962 states and 3933 transitions. [2022-12-13 21:18:13,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 21:18:13,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2022-12-13 21:18:13,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:18:13,589 INFO L225 Difference]: With dead ends: 2962 [2022-12-13 21:18:13,589 INFO L226 Difference]: Without dead ends: 1977 [2022-12-13 21:18:13,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:18:13,591 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 463 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 21:18:13,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 444 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 21:18:13,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2022-12-13 21:18:13,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1759. [2022-12-13 21:18:13,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1759 states, 1447 states have (on average 1.318590186592951) internal successors, (1908), 1470 states have internal predecessors, (1908), 185 states have call successors, (185), 116 states have call predecessors, (185), 125 states have return successors, (208), 174 states have call predecessors, (208), 183 states have call successors, (208) [2022-12-13 21:18:13,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 2301 transitions. [2022-12-13 21:18:13,714 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 2301 transitions. Word has length 57 [2022-12-13 21:18:13,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:18:13,715 INFO L495 AbstractCegarLoop]: Abstraction has 1759 states and 2301 transitions. [2022-12-13 21:18:13,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-13 21:18:13,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2301 transitions. [2022-12-13 21:18:13,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-12-13 21:18:13,716 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:18:13,716 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 21:18:13,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 21:18:13,717 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:18:13,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:18:13,717 INFO L85 PathProgramCache]: Analyzing trace with hash 2041766118, now seen corresponding path program 1 times [2022-12-13 21:18:13,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:18:13,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196487542] [2022-12-13 21:18:13,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:13,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:18:13,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:13,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:18:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:13,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 21:18:13,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:13,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 21:18:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:13,753 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 21:18:13,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:18:13,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196487542] [2022-12-13 21:18:13,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196487542] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:18:13,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:18:13,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:18:13,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722234185] [2022-12-13 21:18:13,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:18:13,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:18:13,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:18:13,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:18:13,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:18:13,755 INFO L87 Difference]: Start difference. First operand 1759 states and 2301 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 21:18:14,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:18:14,045 INFO L93 Difference]: Finished difference Result 2343 states and 3086 transitions. [2022-12-13 21:18:14,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:18:14,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2022-12-13 21:18:14,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:18:14,050 INFO L225 Difference]: With dead ends: 2343 [2022-12-13 21:18:14,050 INFO L226 Difference]: Without dead ends: 1987 [2022-12-13 21:18:14,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:18:14,052 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 133 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:18:14,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 564 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:18:14,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2022-12-13 21:18:14,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1949. [2022-12-13 21:18:14,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1949 states, 1613 states have (on average 1.3068815871047736) internal successors, (2108), 1638 states have internal predecessors, (2108), 199 states have call successors, (199), 124 states have call predecessors, (199), 135 states have return successors, (232), 188 states have call predecessors, (232), 197 states have call successors, (232) [2022-12-13 21:18:14,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 2539 transitions. [2022-12-13 21:18:14,162 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 2539 transitions. Word has length 62 [2022-12-13 21:18:14,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:18:14,162 INFO L495 AbstractCegarLoop]: Abstraction has 1949 states and 2539 transitions. [2022-12-13 21:18:14,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 21:18:14,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 2539 transitions. [2022-12-13 21:18:14,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-13 21:18:14,163 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:18:14,164 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 21:18:14,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 21:18:14,164 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:18:14,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:18:14,164 INFO L85 PathProgramCache]: Analyzing trace with hash -2064164623, now seen corresponding path program 1 times [2022-12-13 21:18:14,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:18:14,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339152901] [2022-12-13 21:18:14,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:14,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:18:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:14,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:18:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:14,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 21:18:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:14,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 21:18:14,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:14,189 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 21:18:14,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:18:14,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339152901] [2022-12-13 21:18:14,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339152901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:18:14,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:18:14,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:18:14,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433594025] [2022-12-13 21:18:14,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:18:14,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:18:14,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:18:14,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:18:14,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:18:14,190 INFO L87 Difference]: Start difference. First operand 1949 states and 2539 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 21:18:14,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:18:14,411 INFO L93 Difference]: Finished difference Result 2602 states and 3392 transitions. [2022-12-13 21:18:14,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:18:14,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2022-12-13 21:18:14,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:18:14,420 INFO L225 Difference]: With dead ends: 2602 [2022-12-13 21:18:14,420 INFO L226 Difference]: Without dead ends: 2148 [2022-12-13 21:18:14,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:18:14,422 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 279 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:18:14,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 404 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:18:14,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2022-12-13 21:18:14,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 2093. [2022-12-13 21:18:14,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2093 states, 1741 states have (on average 1.2975301550832854) internal successors, (2259), 1768 states have internal predecessors, (2259), 207 states have call successors, (207), 130 states have call predecessors, (207), 143 states have return successors, (246), 196 states have call predecessors, (246), 205 states have call successors, (246) [2022-12-13 21:18:14,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 2712 transitions. [2022-12-13 21:18:14,594 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 2712 transitions. Word has length 67 [2022-12-13 21:18:14,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:18:14,594 INFO L495 AbstractCegarLoop]: Abstraction has 2093 states and 2712 transitions. [2022-12-13 21:18:14,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 21:18:14,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 2712 transitions. [2022-12-13 21:18:14,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-13 21:18:14,596 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:18:14,596 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] [2022-12-13 21:18:14,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 21:18:14,596 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:18:14,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:18:14,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1473250423, now seen corresponding path program 1 times [2022-12-13 21:18:14,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:18:14,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052090238] [2022-12-13 21:18:14,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:14,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:18:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:14,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:18:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:14,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 21:18:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:14,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 21:18:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:14,662 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 21:18:14,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:18:14,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052090238] [2022-12-13 21:18:14,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052090238] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:18:14,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188183456] [2022-12-13 21:18:14,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:14,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:18:14,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:18:14,664 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:18:14,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 21:18:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:14,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 21:18:14,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:18:14,815 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:18:14,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:18:14,845 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-13 21:18:14,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188183456] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 21:18:14,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 21:18:14,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2022-12-13 21:18:14,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790791799] [2022-12-13 21:18:14,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:18:14,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:18:14,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:18:14,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:18:14,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:18:14,847 INFO L87 Difference]: Start difference. First operand 2093 states and 2712 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 21:18:15,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:18:15,080 INFO L93 Difference]: Finished difference Result 2149 states and 2780 transitions. [2022-12-13 21:18:15,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:18:15,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2022-12-13 21:18:15,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:18:15,085 INFO L225 Difference]: With dead ends: 2149 [2022-12-13 21:18:15,085 INFO L226 Difference]: Without dead ends: 2146 [2022-12-13 21:18:15,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:18:15,086 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 399 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:18:15,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 328 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:18:15,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2022-12-13 21:18:15,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 2092. [2022-12-13 21:18:15,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2092 states, 1741 states have (on average 1.296381390005744) internal successors, (2257), 1767 states have internal predecessors, (2257), 206 states have call successors, (206), 130 states have call predecessors, (206), 143 states have return successors, (246), 196 states have call predecessors, (246), 205 states have call successors, (246) [2022-12-13 21:18:15,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 2092 states and 2709 transitions. [2022-12-13 21:18:15,225 INFO L78 Accepts]: Start accepts. Automaton has 2092 states and 2709 transitions. Word has length 68 [2022-12-13 21:18:15,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:18:15,225 INFO L495 AbstractCegarLoop]: Abstraction has 2092 states and 2709 transitions. [2022-12-13 21:18:15,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 21:18:15,225 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 2709 transitions. [2022-12-13 21:18:15,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 21:18:15,227 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:18:15,227 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] [2022-12-13 21:18:15,233 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 21:18:15,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 21:18:15,428 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:18:15,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:18:15,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1574463180, now seen corresponding path program 1 times [2022-12-13 21:18:15,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:18:15,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519884255] [2022-12-13 21:18:15,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:15,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:18:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:15,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:18:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:15,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 21:18:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:15,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 21:18:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:15,488 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 21:18:15,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:18:15,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519884255] [2022-12-13 21:18:15,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519884255] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:18:15,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547994370] [2022-12-13 21:18:15,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:15,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:18:15,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:18:15,490 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:18:15,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 21:18:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:15,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 21:18:15,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:18:15,708 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:18:15,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:18:15,758 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-13 21:18:15,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547994370] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:18:15,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 21:18:15,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2022-12-13 21:18:15,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576401325] [2022-12-13 21:18:15,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 21:18:15,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 21:18:15,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:18:15,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 21:18:15,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 21:18:15,760 INFO L87 Difference]: Start difference. First operand 2092 states and 2709 transitions. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-12-13 21:18:16,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:18:16,764 INFO L93 Difference]: Finished difference Result 3792 states and 4929 transitions. [2022-12-13 21:18:16,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-13 21:18:16,765 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 69 [2022-12-13 21:18:16,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:18:16,775 INFO L225 Difference]: With dead ends: 3792 [2022-12-13 21:18:16,775 INFO L226 Difference]: Without dead ends: 3248 [2022-12-13 21:18:16,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=324, Invalid=1482, Unknown=0, NotChecked=0, Total=1806 [2022-12-13 21:18:16,778 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 607 mSDsluCounter, 1875 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 2182 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 21:18:16,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 2182 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 21:18:16,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3248 states. [2022-12-13 21:18:16,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3248 to 2481. [2022-12-13 21:18:16,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2481 states, 2091 states have (on average 1.2869440459110473) internal successors, (2691), 2125 states have internal predecessors, (2691), 226 states have call successors, (226), 144 states have call predecessors, (226), 162 states have return successors, (280), 213 states have call predecessors, (280), 225 states have call successors, (280) [2022-12-13 21:18:16,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3197 transitions. [2022-12-13 21:18:16,973 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3197 transitions. Word has length 69 [2022-12-13 21:18:16,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:18:16,974 INFO L495 AbstractCegarLoop]: Abstraction has 2481 states and 3197 transitions. [2022-12-13 21:18:16,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-12-13 21:18:16,974 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3197 transitions. [2022-12-13 21:18:16,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-12-13 21:18:16,976 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:18:16,977 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:18:16,983 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 21:18:17,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 21:18:17,178 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:18:17,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:18:17,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1815627380, now seen corresponding path program 1 times [2022-12-13 21:18:17,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:18:17,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275303538] [2022-12-13 21:18:17,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:17,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:18:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:17,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:18:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:17,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 21:18:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:17,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 21:18:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:17,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 21:18:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:17,356 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-13 21:18:17,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:18:17,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275303538] [2022-12-13 21:18:17,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275303538] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:18:17,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767489802] [2022-12-13 21:18:17,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:17,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:18:17,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:18:17,358 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:18:17,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 21:18:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:17,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 21:18:17,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:18:17,442 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-13 21:18:17,442 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:18:17,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767489802] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:18:17,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:18:17,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-12-13 21:18:17,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973730076] [2022-12-13 21:18:17,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:18:17,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:18:17,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:18:17,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:18:17,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:18:17,444 INFO L87 Difference]: Start difference. First operand 2481 states and 3197 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 21:18:17,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:18:17,660 INFO L93 Difference]: Finished difference Result 3204 states and 4135 transitions. [2022-12-13 21:18:17,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:18:17,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 88 [2022-12-13 21:18:17,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:18:17,665 INFO L225 Difference]: With dead ends: 3204 [2022-12-13 21:18:17,666 INFO L226 Difference]: Without dead ends: 2359 [2022-12-13 21:18:17,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:18:17,667 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 196 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:18:17,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 342 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:18:17,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2022-12-13 21:18:17,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 2344. [2022-12-13 21:18:17,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2344 states, 1970 states have (on average 1.2857868020304568) internal successors, (2533), 2003 states have internal predecessors, (2533), 218 states have call successors, (218), 138 states have call predecessors, (218), 154 states have return successors, (266), 204 states have call predecessors, (266), 217 states have call successors, (266) [2022-12-13 21:18:17,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 2344 states and 3017 transitions. [2022-12-13 21:18:17,833 INFO L78 Accepts]: Start accepts. Automaton has 2344 states and 3017 transitions. Word has length 88 [2022-12-13 21:18:17,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:18:17,833 INFO L495 AbstractCegarLoop]: Abstraction has 2344 states and 3017 transitions. [2022-12-13 21:18:17,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 21:18:17,833 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 3017 transitions. [2022-12-13 21:18:17,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-12-13 21:18:17,835 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:18:17,835 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, 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] [2022-12-13 21:18:17,841 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 21:18:18,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:18:18,037 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:18:18,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:18:18,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1196332864, now seen corresponding path program 1 times [2022-12-13 21:18:18,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:18:18,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548556398] [2022-12-13 21:18:18,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:18,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:18:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:18,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:18:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:18,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 21:18:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:18,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 21:18:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:18,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:18:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:18,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 21:18:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:18,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 21:18:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:18,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:18:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:18,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 21:18:18,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:18,268 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-13 21:18:18,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:18:18,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548556398] [2022-12-13 21:18:18,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548556398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:18:18,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:18:18,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:18:18,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104547225] [2022-12-13 21:18:18,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:18:18,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:18:18,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:18:18,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:18:18,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:18:18,270 INFO L87 Difference]: Start difference. First operand 2344 states and 3017 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-13 21:18:18,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:18:18,955 INFO L93 Difference]: Finished difference Result 5463 states and 7157 transitions. [2022-12-13 21:18:18,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 21:18:18,956 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 92 [2022-12-13 21:18:18,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:18:18,965 INFO L225 Difference]: With dead ends: 5463 [2022-12-13 21:18:18,965 INFO L226 Difference]: Without dead ends: 4080 [2022-12-13 21:18:18,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-12-13 21:18:18,968 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 788 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 21:18:18,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 446 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 21:18:18,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4080 states. [2022-12-13 21:18:19,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4080 to 3682. [2022-12-13 21:18:19,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3682 states, 3029 states have (on average 1.2822713766919775) internal successors, (3884), 3089 states have internal predecessors, (3884), 371 states have call successors, (371), 238 states have call predecessors, (371), 280 states have return successors, (512), 358 states have call predecessors, (512), 370 states have call successors, (512) [2022-12-13 21:18:19,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 3682 states and 4767 transitions. [2022-12-13 21:18:19,280 INFO L78 Accepts]: Start accepts. Automaton has 3682 states and 4767 transitions. Word has length 92 [2022-12-13 21:18:19,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:18:19,280 INFO L495 AbstractCegarLoop]: Abstraction has 3682 states and 4767 transitions. [2022-12-13 21:18:19,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-13 21:18:19,281 INFO L276 IsEmpty]: Start isEmpty. Operand 3682 states and 4767 transitions. [2022-12-13 21:18:19,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-12-13 21:18:19,283 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:18:19,283 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, 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] [2022-12-13 21:18:19,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 21:18:19,284 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:18:19,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:18:19,284 INFO L85 PathProgramCache]: Analyzing trace with hash 128523330, now seen corresponding path program 1 times [2022-12-13 21:18:19,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:18:19,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761472839] [2022-12-13 21:18:19,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:19,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:18:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:19,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:18:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:19,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 21:18:19,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:19,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 21:18:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:19,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:18:19,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:19,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 21:18:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:19,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 21:18:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:19,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:18:19,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:19,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 21:18:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:19,325 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-13 21:18:19,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:18:19,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761472839] [2022-12-13 21:18:19,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761472839] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:18:19,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:18:19,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:18:19,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602371789] [2022-12-13 21:18:19,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:18:19,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:18:19,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:18:19,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:18:19,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:18:19,327 INFO L87 Difference]: Start difference. First operand 3682 states and 4767 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 21:18:19,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:18:19,866 INFO L93 Difference]: Finished difference Result 6081 states and 7883 transitions. [2022-12-13 21:18:19,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:18:19,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 92 [2022-12-13 21:18:19,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:18:19,873 INFO L225 Difference]: With dead ends: 6081 [2022-12-13 21:18:19,873 INFO L226 Difference]: Without dead ends: 3360 [2022-12-13 21:18:19,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:18:19,877 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 317 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:18:19,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 422 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 21:18:19,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3360 states. [2022-12-13 21:18:20,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3360 to 3048. [2022-12-13 21:18:20,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3048 states, 2528 states have (on average 1.2796677215189873) internal successors, (3235), 2579 states have internal predecessors, (3235), 292 states have call successors, (292), 188 states have call predecessors, (292), 226 states have return successors, (402), 282 states have call predecessors, (402), 291 states have call successors, (402) [2022-12-13 21:18:20,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3048 states to 3048 states and 3929 transitions. [2022-12-13 21:18:20,107 INFO L78 Accepts]: Start accepts. Automaton has 3048 states and 3929 transitions. Word has length 92 [2022-12-13 21:18:20,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:18:20,107 INFO L495 AbstractCegarLoop]: Abstraction has 3048 states and 3929 transitions. [2022-12-13 21:18:20,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 21:18:20,108 INFO L276 IsEmpty]: Start isEmpty. Operand 3048 states and 3929 transitions. [2022-12-13 21:18:20,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-12-13 21:18:20,109 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:18:20,109 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, 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] [2022-12-13 21:18:20,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 21:18:20,110 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:18:20,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:18:20,110 INFO L85 PathProgramCache]: Analyzing trace with hash 172011463, now seen corresponding path program 1 times [2022-12-13 21:18:20,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:18:20,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059040461] [2022-12-13 21:18:20,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:20,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:18:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:20,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:18:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:20,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 21:18:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:20,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 21:18:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:20,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:18:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:20,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 21:18:20,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:20,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 21:18:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:20,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:18:20,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:20,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-12-13 21:18:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:20,173 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 21:18:20,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:18:20,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059040461] [2022-12-13 21:18:20,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059040461] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:18:20,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:18:20,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:18:20,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713582678] [2022-12-13 21:18:20,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:18:20,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:18:20,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:18:20,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:18:20,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:18:20,175 INFO L87 Difference]: Start difference. First operand 3048 states and 3929 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-13 21:18:21,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:18:21,192 INFO L93 Difference]: Finished difference Result 6551 states and 8590 transitions. [2022-12-13 21:18:21,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 21:18:21,193 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 93 [2022-12-13 21:18:21,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:18:21,203 INFO L225 Difference]: With dead ends: 6551 [2022-12-13 21:18:21,203 INFO L226 Difference]: Without dead ends: 4464 [2022-12-13 21:18:21,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2022-12-13 21:18:21,206 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 1216 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1230 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 21:18:21,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1230 Valid, 732 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 21:18:21,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4464 states. [2022-12-13 21:18:21,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4464 to 4168. [2022-12-13 21:18:21,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4168 states, 3452 states have (on average 1.2604287369640788) internal successors, (4351), 3527 states have internal predecessors, (4351), 387 states have call successors, (387), 259 states have call predecessors, (387), 327 states have return successors, (558), 383 states have call predecessors, (558), 386 states have call successors, (558) [2022-12-13 21:18:21,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 5296 transitions. [2022-12-13 21:18:21,544 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 5296 transitions. Word has length 93 [2022-12-13 21:18:21,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:18:21,544 INFO L495 AbstractCegarLoop]: Abstraction has 4168 states and 5296 transitions. [2022-12-13 21:18:21,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-13 21:18:21,544 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 5296 transitions. [2022-12-13 21:18:21,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-12-13 21:18:21,546 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:18:21,547 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:18:21,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 21:18:21,547 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:18:21,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:18:21,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1890951514, now seen corresponding path program 1 times [2022-12-13 21:18:21,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:18:21,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201642342] [2022-12-13 21:18:21,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:21,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:18:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:21,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:18:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:21,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 21:18:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:21,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-12-13 21:18:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:21,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-12-13 21:18:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:21,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 21:18:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:21,611 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-13 21:18:21,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:18:21,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201642342] [2022-12-13 21:18:21,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201642342] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:18:21,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026989816] [2022-12-13 21:18:21,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:21,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:18:21,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:18:21,613 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:18:21,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 21:18:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:21,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 21:18:21,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:18:21,706 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 21:18:21,706 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:18:21,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026989816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:18:21,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:18:21,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-12-13 21:18:21,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959448971] [2022-12-13 21:18:21,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:18:21,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:18:21,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:18:21,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:18:21,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:18:21,708 INFO L87 Difference]: Start difference. First operand 4168 states and 5296 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 21:18:22,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:18:22,050 INFO L93 Difference]: Finished difference Result 4547 states and 5764 transitions. [2022-12-13 21:18:22,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:18:22,050 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 103 [2022-12-13 21:18:22,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:18:22,058 INFO L225 Difference]: With dead ends: 4547 [2022-12-13 21:18:22,058 INFO L226 Difference]: Without dead ends: 3221 [2022-12-13 21:18:22,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:18:22,060 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 62 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:18:22,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 490 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:18:22,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3221 states. [2022-12-13 21:18:22,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3221 to 3221. [2022-12-13 21:18:22,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3221 states, 2608 states have (on average 1.2626533742331287) internal successors, (3293), 2667 states have internal predecessors, (3293), 330 states have call successors, (330), 222 states have call predecessors, (330), 282 states have return successors, (466), 333 states have call predecessors, (466), 330 states have call successors, (466) [2022-12-13 21:18:22,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3221 states to 3221 states and 4089 transitions. [2022-12-13 21:18:22,377 INFO L78 Accepts]: Start accepts. Automaton has 3221 states and 4089 transitions. Word has length 103 [2022-12-13 21:18:22,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:18:22,377 INFO L495 AbstractCegarLoop]: Abstraction has 3221 states and 4089 transitions. [2022-12-13 21:18:22,377 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 21:18:22,377 INFO L276 IsEmpty]: Start isEmpty. Operand 3221 states and 4089 transitions. [2022-12-13 21:18:22,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-12-13 21:18:22,379 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:18:22,379 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:18:22,384 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 21:18:22,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 21:18:22,580 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:18:22,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:18:22,580 INFO L85 PathProgramCache]: Analyzing trace with hash 199854852, now seen corresponding path program 1 times [2022-12-13 21:18:22,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:18:22,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302491288] [2022-12-13 21:18:22,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:22,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:18:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:22,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:18:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:22,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 21:18:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:22,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 21:18:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:22,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:18:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:22,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 21:18:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:22,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 21:18:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:22,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 21:18:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:22,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:18:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:22,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 21:18:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:22,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:18:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:22,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-12-13 21:18:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:22,694 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-12-13 21:18:22,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:18:22,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302491288] [2022-12-13 21:18:22,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302491288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:18:22,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:18:22,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 21:18:22,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37565572] [2022-12-13 21:18:22,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:18:22,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 21:18:22,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:18:22,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 21:18:22,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:18:22,696 INFO L87 Difference]: Start difference. First operand 3221 states and 4089 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 6 states have internal predecessors, (86), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-12-13 21:18:23,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:18:23,704 INFO L93 Difference]: Finished difference Result 7795 states and 10213 transitions. [2022-12-13 21:18:23,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 21:18:23,705 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 6 states have internal predecessors, (86), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 135 [2022-12-13 21:18:23,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:18:23,712 INFO L225 Difference]: With dead ends: 7795 [2022-12-13 21:18:23,713 INFO L226 Difference]: Without dead ends: 4713 [2022-12-13 21:18:23,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2022-12-13 21:18:23,717 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 813 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 21:18:23,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 373 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 21:18:23,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4713 states. [2022-12-13 21:18:24,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4713 to 4229. [2022-12-13 21:18:24,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4229 states, 3447 states have (on average 1.2236727589208007) internal successors, (4218), 3552 states have internal predecessors, (4218), 393 states have call successors, (393), 285 states have call predecessors, (393), 388 states have return successors, (591), 393 states have call predecessors, (591), 393 states have call successors, (591) [2022-12-13 21:18:24,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4229 states to 4229 states and 5202 transitions. [2022-12-13 21:18:24,089 INFO L78 Accepts]: Start accepts. Automaton has 4229 states and 5202 transitions. Word has length 135 [2022-12-13 21:18:24,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:18:24,089 INFO L495 AbstractCegarLoop]: Abstraction has 4229 states and 5202 transitions. [2022-12-13 21:18:24,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 6 states have internal predecessors, (86), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-12-13 21:18:24,089 INFO L276 IsEmpty]: Start isEmpty. Operand 4229 states and 5202 transitions. [2022-12-13 21:18:24,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-12-13 21:18:24,091 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:18:24,091 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:18:24,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 21:18:24,091 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:18:24,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:18:24,092 INFO L85 PathProgramCache]: Analyzing trace with hash -242597663, now seen corresponding path program 2 times [2022-12-13 21:18:24,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:18:24,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295322221] [2022-12-13 21:18:24,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:24,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:18:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:24,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:18:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:24,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 21:18:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:24,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 21:18:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:24,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:18:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:24,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 21:18:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:24,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 21:18:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:24,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 21:18:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:24,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:18:24,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:24,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 21:18:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:24,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:18:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:24,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-12-13 21:18:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:24,163 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 36 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-13 21:18:24,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:18:24,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295322221] [2022-12-13 21:18:24,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295322221] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:18:24,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772518286] [2022-12-13 21:18:24,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 21:18:24,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:18:24,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:18:24,165 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:18:24,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 21:18:24,249 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 21:18:24,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 21:18:24,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 21:18:24,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:18:24,298 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 21:18:24,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:18:24,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772518286] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:18:24,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:18:24,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-12-13 21:18:24,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396023667] [2022-12-13 21:18:24,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:18:24,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:18:24,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:18:24,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:18:24,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:18:24,300 INFO L87 Difference]: Start difference. First operand 4229 states and 5202 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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) [2022-12-13 21:18:24,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:18:24,727 INFO L93 Difference]: Finished difference Result 7017 states and 8818 transitions. [2022-12-13 21:18:24,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:18:24,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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 135 [2022-12-13 21:18:24,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:18:24,738 INFO L225 Difference]: With dead ends: 7017 [2022-12-13 21:18:24,739 INFO L226 Difference]: Without dead ends: 4105 [2022-12-13 21:18:24,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:18:24,747 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 78 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:18:24,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 360 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:18:24,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4105 states. [2022-12-13 21:18:25,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4105 to 4079. [2022-12-13 21:18:25,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4079 states, 3297 states have (on average 1.2095844707309675) internal successors, (3988), 3402 states have internal predecessors, (3988), 393 states have call successors, (393), 285 states have call predecessors, (393), 388 states have return successors, (591), 393 states have call predecessors, (591), 393 states have call successors, (591) [2022-12-13 21:18:25,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4079 states to 4079 states and 4972 transitions. [2022-12-13 21:18:25,107 INFO L78 Accepts]: Start accepts. Automaton has 4079 states and 4972 transitions. Word has length 135 [2022-12-13 21:18:25,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:18:25,107 INFO L495 AbstractCegarLoop]: Abstraction has 4079 states and 4972 transitions. [2022-12-13 21:18:25,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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) [2022-12-13 21:18:25,107 INFO L276 IsEmpty]: Start isEmpty. Operand 4079 states and 4972 transitions. [2022-12-13 21:18:25,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-12-13 21:18:25,109 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:18:25,109 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:18:25,114 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 21:18:25,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-13 21:18:25,310 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:18:25,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:18:25,310 INFO L85 PathProgramCache]: Analyzing trace with hash 652625369, now seen corresponding path program 1 times [2022-12-13 21:18:25,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:18:25,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462272795] [2022-12-13 21:18:25,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:25,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:18:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:25,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:18:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:25,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 21:18:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:25,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 21:18:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:25,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:18:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:25,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 21:18:25,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:25,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 21:18:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:25,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 21:18:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:25,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:18:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:25,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 21:18:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:25,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:18:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:25,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 21:18:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:25,402 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-12-13 21:18:25,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:18:25,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462272795] [2022-12-13 21:18:25,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462272795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:18:25,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:18:25,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:18:25,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366033830] [2022-12-13 21:18:25,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:18:25,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:18:25,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:18:25,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:18:25,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:18:25,403 INFO L87 Difference]: Start difference. First operand 4079 states and 4972 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 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) [2022-12-13 21:18:26,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:18:26,482 INFO L93 Difference]: Finished difference Result 11890 states and 14610 transitions. [2022-12-13 21:18:26,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 21:18:26,484 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 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 136 [2022-12-13 21:18:26,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:18:26,505 INFO L225 Difference]: With dead ends: 11890 [2022-12-13 21:18:26,505 INFO L226 Difference]: Without dead ends: 8818 [2022-12-13 21:18:26,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-12-13 21:18:26,513 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 578 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 21:18:26,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 454 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 21:18:26,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8818 states. [2022-12-13 21:18:27,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8818 to 7140. [2022-12-13 21:18:27,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7140 states, 5815 states have (on average 1.2257953568357696) internal successors, (7128), 5993 states have internal predecessors, (7128), 662 states have call successors, (662), 483 states have call predecessors, (662), 662 states have return successors, (1008), 665 states have call predecessors, (1008), 662 states have call successors, (1008) [2022-12-13 21:18:27,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7140 states to 7140 states and 8798 transitions. [2022-12-13 21:18:27,219 INFO L78 Accepts]: Start accepts. Automaton has 7140 states and 8798 transitions. Word has length 136 [2022-12-13 21:18:27,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:18:27,219 INFO L495 AbstractCegarLoop]: Abstraction has 7140 states and 8798 transitions. [2022-12-13 21:18:27,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 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) [2022-12-13 21:18:27,219 INFO L276 IsEmpty]: Start isEmpty. Operand 7140 states and 8798 transitions. [2022-12-13 21:18:27,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-12-13 21:18:27,222 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:18:27,223 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:18:27,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 21:18:27,223 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:18:27,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:18:27,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1255313462, now seen corresponding path program 1 times [2022-12-13 21:18:27,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:18:27,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010150664] [2022-12-13 21:18:27,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:27,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:18:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:27,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:18:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:27,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 21:18:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:27,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 21:18:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:27,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:18:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:27,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 21:18:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:27,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 21:18:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:27,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:18:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:27,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-12-13 21:18:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:27,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-12-13 21:18:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:27,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-12-13 21:18:27,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:27,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-12-13 21:18:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:27,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 21:18:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:27,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 21:18:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:27,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-12-13 21:18:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:27,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-12-13 21:18:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:27,323 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-12-13 21:18:27,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:18:27,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010150664] [2022-12-13 21:18:27,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010150664] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:18:27,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454264499] [2022-12-13 21:18:27,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:27,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:18:27,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:18:27,325 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:18:27,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 21:18:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:27,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 21:18:27,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:18:27,446 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-13 21:18:27,446 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:18:27,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454264499] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:18:27,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:18:27,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-12-13 21:18:27,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177797228] [2022-12-13 21:18:27,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:18:27,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:18:27,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:18:27,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:18:27,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 21:18:27,448 INFO L87 Difference]: Start difference. First operand 7140 states and 8798 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 21:18:27,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:18:27,806 INFO L93 Difference]: Finished difference Result 10848 states and 13407 transitions. [2022-12-13 21:18:27,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:18:27,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 159 [2022-12-13 21:18:27,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:18:27,812 INFO L225 Difference]: With dead ends: 10848 [2022-12-13 21:18:27,812 INFO L226 Difference]: Without dead ends: 3722 [2022-12-13 21:18:27,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-12-13 21:18:27,819 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 31 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:18:27,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 680 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:18:27,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2022-12-13 21:18:28,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3450. [2022-12-13 21:18:28,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3450 states, 2842 states have (on average 1.2149894440534834) internal successors, (3453), 2891 states have internal predecessors, (3453), 308 states have call successors, (308), 213 states have call predecessors, (308), 299 states have return successors, (471), 345 states have call predecessors, (471), 308 states have call successors, (471) [2022-12-13 21:18:28,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3450 states to 3450 states and 4232 transitions. [2022-12-13 21:18:28,103 INFO L78 Accepts]: Start accepts. Automaton has 3450 states and 4232 transitions. Word has length 159 [2022-12-13 21:18:28,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:18:28,104 INFO L495 AbstractCegarLoop]: Abstraction has 3450 states and 4232 transitions. [2022-12-13 21:18:28,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 21:18:28,104 INFO L276 IsEmpty]: Start isEmpty. Operand 3450 states and 4232 transitions. [2022-12-13 21:18:28,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-12-13 21:18:28,105 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:18:28,105 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:18:28,110 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 21:18:28,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 21:18:28,307 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:18:28,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:18:28,308 INFO L85 PathProgramCache]: Analyzing trace with hash -790442704, now seen corresponding path program 1 times [2022-12-13 21:18:28,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:18:28,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218723735] [2022-12-13 21:18:28,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:28,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:18:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:28,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:18:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:28,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 21:18:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:28,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 21:18:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:28,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:18:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:28,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 21:18:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:28,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 21:18:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:28,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:18:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:28,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 21:18:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:28,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-12-13 21:18:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:28,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 21:18:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:28,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-12-13 21:18:28,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:28,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-12-13 21:18:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:28,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-12-13 21:18:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:28,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-12-13 21:18:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:28,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-12-13 21:18:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:28,419 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-12-13 21:18:28,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:18:28,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218723735] [2022-12-13 21:18:28,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218723735] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:18:28,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:18:28,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 21:18:28,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763188758] [2022-12-13 21:18:28,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:18:28,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 21:18:28,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:18:28,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 21:18:28,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:18:28,420 INFO L87 Difference]: Start difference. First operand 3450 states and 4232 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 6 states have internal predecessors, (93), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2022-12-13 21:18:29,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:18:29,017 INFO L93 Difference]: Finished difference Result 6175 states and 7543 transitions. [2022-12-13 21:18:29,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 21:18:29,018 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 6 states have internal predecessors, (93), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) Word has length 163 [2022-12-13 21:18:29,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:18:29,022 INFO L225 Difference]: With dead ends: 6175 [2022-12-13 21:18:29,022 INFO L226 Difference]: Without dead ends: 2985 [2022-12-13 21:18:29,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-12-13 21:18:29,027 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 638 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:18:29,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 308 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 21:18:29,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2022-12-13 21:18:29,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 2701. [2022-12-13 21:18:29,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2701 states, 2262 states have (on average 1.1923076923076923) internal successors, (2697), 2275 states have internal predecessors, (2697), 231 states have call successors, (231), 164 states have call predecessors, (231), 207 states have return successors, (314), 261 states have call predecessors, (314), 231 states have call successors, (314) [2022-12-13 21:18:29,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 3242 transitions. [2022-12-13 21:18:29,371 INFO L78 Accepts]: Start accepts. Automaton has 2701 states and 3242 transitions. Word has length 163 [2022-12-13 21:18:29,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:18:29,371 INFO L495 AbstractCegarLoop]: Abstraction has 2701 states and 3242 transitions. [2022-12-13 21:18:29,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 6 states have internal predecessors, (93), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2022-12-13 21:18:29,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 3242 transitions. [2022-12-13 21:18:29,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-12-13 21:18:29,372 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:18:29,372 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:18:29,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 21:18:29,372 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:18:29,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:18:29,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1045972563, now seen corresponding path program 1 times [2022-12-13 21:18:29,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:18:29,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070161111] [2022-12-13 21:18:29,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:29,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:18:29,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:29,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:18:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:29,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 21:18:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:29,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 21:18:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:29,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:18:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:29,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 21:18:29,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:29,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 21:18:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:29,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:18:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:29,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 21:18:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:29,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-12-13 21:18:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:29,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 21:18:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:29,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-12-13 21:18:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:29,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-12-13 21:18:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:29,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-12-13 21:18:29,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:29,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-12-13 21:18:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:29,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-12-13 21:18:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:29,524 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 35 proven. 8 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-12-13 21:18:29,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:18:29,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070161111] [2022-12-13 21:18:29,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070161111] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:18:29,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350533782] [2022-12-13 21:18:29,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:29,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:18:29,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:18:29,525 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:18:29,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 21:18:29,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:29,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 21:18:29,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:18:29,697 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-12-13 21:18:29,697 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:18:29,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350533782] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:18:29,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:18:29,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2022-12-13 21:18:29,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247786590] [2022-12-13 21:18:29,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:18:29,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:18:29,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:18:29,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:18:29,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-12-13 21:18:29,699 INFO L87 Difference]: Start difference. First operand 2701 states and 3242 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-12-13 21:18:29,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:18:29,937 INFO L93 Difference]: Finished difference Result 4595 states and 5560 transitions. [2022-12-13 21:18:29,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:18:29,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 164 [2022-12-13 21:18:29,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:18:29,940 INFO L225 Difference]: With dead ends: 4595 [2022-12-13 21:18:29,940 INFO L226 Difference]: Without dead ends: 2020 [2022-12-13 21:18:29,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-12-13 21:18:29,943 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 107 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:18:29,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 147 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:18:29,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020 states. [2022-12-13 21:18:30,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2020 to 1549. [2022-12-13 21:18:30,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1549 states, 1294 states have (on average 1.1452859350850078) internal successors, (1482), 1308 states have internal predecessors, (1482), 124 states have call successors, (124), 104 states have call predecessors, (124), 130 states have return successors, (168), 136 states have call predecessors, (168), 124 states have call successors, (168) [2022-12-13 21:18:30,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 1774 transitions. [2022-12-13 21:18:30,100 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 1774 transitions. Word has length 164 [2022-12-13 21:18:30,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:18:30,100 INFO L495 AbstractCegarLoop]: Abstraction has 1549 states and 1774 transitions. [2022-12-13 21:18:30,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-12-13 21:18:30,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 1774 transitions. [2022-12-13 21:18:30,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-12-13 21:18:30,101 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:18:30,102 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:18:30,106 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 21:18:30,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-13 21:18:30,302 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:18:30,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:18:30,302 INFO L85 PathProgramCache]: Analyzing trace with hash 239124213, now seen corresponding path program 1 times [2022-12-13 21:18:30,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:18:30,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34379844] [2022-12-13 21:18:30,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:30,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:18:30,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:30,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:18:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:30,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 21:18:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:30,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 21:18:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:30,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:18:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:30,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 21:18:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:30,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 21:18:30,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:30,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 21:18:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:30,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:18:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:30,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 21:18:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:30,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:18:30,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:30,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 21:18:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:30,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-12-13 21:18:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:30,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:18:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:30,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-12-13 21:18:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:30,359 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 67 proven. 14 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-12-13 21:18:30,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:18:30,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34379844] [2022-12-13 21:18:30,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34379844] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:18:30,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102288821] [2022-12-13 21:18:30,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:18:30,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:18:30,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:18:30,360 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:18:30,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 21:18:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:18:30,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 21:18:30,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:18:30,447 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-12-13 21:18:30,448 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:18:30,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102288821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:18:30,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:18:30,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-12-13 21:18:30,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979472963] [2022-12-13 21:18:30,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:18:30,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:18:30,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:18:30,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:18:30,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:18:30,449 INFO L87 Difference]: Start difference. First operand 1549 states and 1774 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2022-12-13 21:18:30,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:18:30,519 INFO L93 Difference]: Finished difference Result 2085 states and 2411 transitions. [2022-12-13 21:18:30,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:18:30,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 175 [2022-12-13 21:18:30,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:18:30,520 INFO L225 Difference]: With dead ends: 2085 [2022-12-13 21:18:30,520 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 21:18:30,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:18:30,523 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 96 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:18:30,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 267 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:18:30,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 21:18:30,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 21:18:30,523 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) [2022-12-13 21:18:30,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 21:18:30,523 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 175 [2022-12-13 21:18:30,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:18:30,523 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 21:18:30,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2022-12-13 21:18:30,524 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 21:18:30,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 21:18:30,525 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-12-13 21:18:30,526 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-12-13 21:18:30,530 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 21:18:30,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:18:30,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 21:18:48,127 WARN L233 SmtUtils]: Spent 17.27s on a formula simplification. DAG size of input: 143 DAG size of output: 142 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 21:19:02,789 WARN L233 SmtUtils]: Spent 13.74s on a formula simplification. DAG size of input: 126 DAG size of output: 125 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 21:19:18,048 WARN L233 SmtUtils]: Spent 13.00s on a formula simplification. DAG size of input: 124 DAG size of output: 123 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 21:19:32,653 WARN L233 SmtUtils]: Spent 14.60s on a formula simplification. DAG size of input: 117 DAG size of output: 115 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 21:19:46,616 WARN L233 SmtUtils]: Spent 13.53s on a formula simplification. DAG size of input: 124 DAG size of output: 123 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 21:20:03,591 WARN L233 SmtUtils]: Spent 14.82s on a formula simplification. DAG size of input: 125 DAG size of output: 124 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 21:20:12,841 WARN L233 SmtUtils]: Spent 9.23s on a formula simplification. DAG size of input: 123 DAG size of output: 122 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 21:20:35,498 WARN L233 SmtUtils]: Spent 17.18s on a formula simplification. DAG size of input: 140 DAG size of output: 139 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 21:20:50,096 WARN L233 SmtUtils]: Spent 13.69s on a formula simplification. DAG size of input: 123 DAG size of output: 122 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 21:21:05,678 WARN L233 SmtUtils]: Spent 13.33s on a formula simplification. DAG size of input: 121 DAG size of output: 120 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 21:21:20,655 WARN L233 SmtUtils]: Spent 14.97s on a formula simplification. DAG size of input: 117 DAG size of output: 115 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 21:21:34,013 WARN L233 SmtUtils]: Spent 12.92s on a formula simplification. DAG size of input: 121 DAG size of output: 120 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 21:21:49,677 WARN L233 SmtUtils]: Spent 13.52s on a formula simplification. DAG size of input: 122 DAG size of output: 121 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 21:21:58,924 WARN L233 SmtUtils]: Spent 9.23s on a formula simplification. DAG size of input: 120 DAG size of output: 119 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 21:22:19,568 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 706 716) no Hoare annotation was computed. [2022-12-13 21:22:19,568 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 706 716) no Hoare annotation was computed. [2022-12-13 21:22:19,569 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 706 716) the Hoare annotation is: (let ((.cse17 (= ~E_1~0 1)) (.cse1 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse0 (not (= ~p_dw_st~0 0))) (.cse2 (not (= ~M_E~0 2))) (.cse3 (not (= ~c_dr_pc~0 0))) (.cse4 (= |old(~m_st~0)| 0)) (.cse5 (not (= ~m_i~0 1))) (.cse16 (and (= |old(~t1_st~0)| ~t1_st~0) .cse1)) (.cse18 (not (= ~t1_pc~0 1))) (.cse6 (not (= ~p_num_write~0 0))) (.cse7 (not (= ~t1_i~0 1))) (.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))) (.cse12 (not (= ~T1_E~0 ~M_E~0))) (.cse13 (not .cse17)) (.cse14 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse15 (not (= ~token~0 ~local~0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (and .cse1 (= ~t1_st~0 0)) .cse2 .cse3 .cse4 .cse5 (not (= ~E_M~0 ~M_E~0)) (not (= ~m_pc~0 0)) .cse6 .cse7 .cse8 .cse9 (not (= ~t1_pc~0 0)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse16 .cse17 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (< ~local~0 ~token~0)) .cse12 (= ~E_1~0 0) .cse14 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse0 .cse2 .cse3 .cse4 (not (<= 2 |old(~t1_st~0)|)) .cse5 .cse16 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (<= 2 ~E_M~0)) .cse12 .cse13 .cse14 .cse15)))) [2022-12-13 21:22:19,569 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 59) no Hoare annotation was computed. [2022-12-13 21:22:19,569 INFO L899 garLoopResultBuilder]: For program point L50-2(lines 50 59) no Hoare annotation was computed. [2022-12-13 21:22:19,569 INFO L899 garLoopResultBuilder]: For program point immediate_notify_threadsEXIT(lines 84 108) no Hoare annotation was computed. [2022-12-13 21:22:19,569 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 84 108) the Hoare annotation is: (let ((.cse0 (not (= ~M_E~0 2))) (.cse1 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse2 (not (= ~E_M~0 ~M_E~0))) (.cse3 (not (= ~m_pc~0 0))) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse5 (not (= ~t1_pc~0 0))) (.cse10 (not (= ~q_free~0 0))) (.cse6 (not (= ~E_1~0 ~M_E~0))) (.cse7 (not (= ~T1_E~0 ~M_E~0))) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~t1_st~0 0)))) (and (or (not (<= 2 |old(~p_dw_st~0)|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~c_num_read~0 ~p_num_write~0)) .cse6 .cse7 .cse8 .cse9 (not (= ~q_free~0 1)) (not (= ~c_last_read~0 ~p_last_write~0))) (or .cse0 (not (= 2 |old(~c_dr_st~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse7 .cse8 .cse9 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (or .cse0 (not (= ~p_num_write~0 1)) (not (= ~c_dr_pc~0 0)) .cse1 .cse2 .cse3 (not (= ~p_dw_pc~0 0)) .cse4 .cse5 (not (= ~c_num_read~0 0)) .cse10 .cse6 .cse7 .cse8 .cse9))) [2022-12-13 21:22:19,569 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 78) no Hoare annotation was computed. [2022-12-13 21:22:19,569 INFO L899 garLoopResultBuilder]: For program point L100(lines 100 104) no Hoare annotation was computed. [2022-12-13 21:22:19,569 INFO L899 garLoopResultBuilder]: For program point L69-2(lines 69 78) no Hoare annotation was computed. [2022-12-13 21:22:19,569 INFO L899 garLoopResultBuilder]: For program point L100-2(lines 84 108) no Hoare annotation was computed. [2022-12-13 21:22:19,570 INFO L895 garLoopResultBuilder]: At program point L61(lines 49 63) the Hoare annotation is: (let ((.cse12 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse14 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse10 (not (= ~p_dw_pc~0 0))) (.cse13 (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0)) (.cse15 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|)) (.cse0 (not (= ~M_E~0 2))) (.cse16 (not (= 2 |old(~c_dr_st~0)|))) (.cse1 (and .cse12 .cse14)) (.cse2 (not (= ~E_M~0 ~M_E~0))) (.cse3 (not (= ~m_pc~0 0))) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse5 (not (= ~t1_pc~0 0))) (.cse11 (not (= ~q_free~0 0))) (.cse6 (not (= ~E_1~0 ~M_E~0))) (.cse7 (not (= ~T1_E~0 ~M_E~0))) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~t1_st~0 0))) (.cse17 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)))) (and (or (not (<= 2 |old(~p_dw_st~0)|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~c_num_read~0 ~p_num_write~0)) .cse6 .cse7 .cse8 .cse9 (not (= ~q_free~0 1)) (not (= ~c_last_read~0 ~p_last_write~0))) (or .cse0 (not (= ~p_num_write~0 1)) (not (= ~c_dr_pc~0 0)) .cse2 .cse3 .cse10 .cse4 .cse5 (not (= ~c_num_read~0 0)) .cse11 (and .cse12 .cse13 .cse14 .cse15) .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse16 .cse2 .cse3 .cse10 .cse4 (and .cse13 .cse15) .cse5 .cse11 .cse6 .cse7 .cse8 .cse9 .cse17) (or .cse0 .cse16 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7 .cse8 .cse9 .cse17)))) [2022-12-13 21:22:19,570 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 96) no Hoare annotation was computed. [2022-12-13 21:22:19,570 INFO L899 garLoopResultBuilder]: For program point L92-2(lines 92 96) no Hoare annotation was computed. [2022-12-13 21:22:19,570 INFO L895 garLoopResultBuilder]: At program point is_do_write_p_triggered_returnLabel#1(lines 46 64) the Hoare annotation is: (let ((.cse18 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse19 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse15 (not (= ~p_dw_pc~0 0))) (.cse11 (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0)) (.cse12 (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0)) (.cse13 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|)) (.cse14 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|)) (.cse0 (not (= ~M_E~0 2))) (.cse10 (not (= 2 |old(~c_dr_st~0)|))) (.cse1 (and .cse18 .cse19)) (.cse2 (not (= ~E_M~0 ~M_E~0))) (.cse3 (not (= ~m_pc~0 0))) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse5 (not (= ~t1_pc~0 0))) (.cse16 (not (= ~q_free~0 0))) (.cse6 (not (= ~E_1~0 ~M_E~0))) (.cse7 (not (= ~T1_E~0 ~M_E~0))) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~t1_st~0 0))) (.cse17 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)))) (and (or (not (<= 2 |old(~p_dw_st~0)|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~c_num_read~0 ~p_num_write~0)) .cse6 .cse7 .cse8 .cse9 (not (= ~q_free~0 1)) (not (= ~c_last_read~0 ~p_last_write~0))) (or .cse0 .cse10 (and .cse11 .cse12 .cse13 .cse14) .cse2 .cse3 .cse15 .cse4 .cse5 .cse16 .cse6 .cse7 .cse8 .cse9 .cse17) (or .cse0 (not (= ~p_num_write~0 1)) (not (= ~c_dr_pc~0 0)) .cse2 .cse3 .cse15 .cse4 (and .cse18 .cse11 .cse19 .cse12 .cse13 .cse14) .cse5 (not (= ~c_num_read~0 0)) .cse16 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse8 .cse9 .cse17)))) [2022-12-13 21:22:19,570 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 56) no Hoare annotation was computed. [2022-12-13 21:22:19,570 INFO L895 garLoopResultBuilder]: At program point L80(lines 68 82) the Hoare annotation is: (let ((.cse3 (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0)) (.cse5 (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0)) (.cse6 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|)) (.cse8 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|)) (.cse11 (not (= ~p_dw_pc~0 0))) (.cse19 (not (= 2 |old(~c_dr_st~0)|))) (.cse14 (not (= ~q_free~0 0))) (.cse20 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse0 (not (= ~M_E~0 2))) (.cse9 (not (= ~E_M~0 ~M_E~0))) (.cse10 (not (= ~m_pc~0 0))) (.cse12 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse13 (not (= ~t1_pc~0 0))) (.cse15 (not (= ~E_1~0 ~M_E~0))) (.cse21 (= ~p_dw_st~0 0)) (.cse1 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse2 (<= |immediate_notify_threads_~tmp~0#1| 0)) (.cse4 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse7 (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1))) (.cse16 (not (= ~T1_E~0 ~M_E~0))) (.cse17 (not (= ~m_st~0 0))) (.cse18 (not (= ~t1_st~0 0)))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (not (= ~p_num_write~0 1)) (not (= ~c_dr_pc~0 0)) .cse9 .cse10 .cse11 .cse12 .cse13 (not (= ~c_num_read~0 0)) .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse19 (and .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20) (or .cse0 .cse19 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (and (= ~c_dr_st~0 2) (or .cse1 .cse21)) .cse18 .cse20) (or (not (<= 2 |old(~p_dw_st~0)|)) .cse0 .cse9 .cse10 .cse12 .cse13 (not (= ~c_num_read~0 ~p_num_write~0)) .cse15 .cse21 (and .cse1 .cse2 .cse4 .cse7) .cse16 .cse17 .cse18 (not (= ~q_free~0 1)) (not (= ~c_last_read~0 ~p_last_write~0))))) [2022-12-13 21:22:19,571 INFO L895 garLoopResultBuilder]: At program point is_do_read_c_triggered_returnLabel#1(lines 65 83) the Hoare annotation is: (let ((.cse3 (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0)) (.cse5 (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0)) (.cse6 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|)) (.cse8 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|)) (.cse11 (not (= ~p_dw_pc~0 0))) (.cse19 (not (= 2 |old(~c_dr_st~0)|))) (.cse14 (not (= ~q_free~0 0))) (.cse20 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse0 (not (= ~M_E~0 2))) (.cse9 (not (= ~E_M~0 ~M_E~0))) (.cse10 (not (= ~m_pc~0 0))) (.cse12 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse13 (not (= ~t1_pc~0 0))) (.cse15 (not (= ~E_1~0 ~M_E~0))) (.cse21 (= ~p_dw_st~0 0)) (.cse1 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse2 (<= |immediate_notify_threads_~tmp~0#1| 0)) (.cse4 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse7 (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1))) (.cse16 (not (= ~T1_E~0 ~M_E~0))) (.cse17 (not (= ~m_st~0 0))) (.cse18 (not (= ~t1_st~0 0)))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (not (= ~p_num_write~0 1)) (not (= ~c_dr_pc~0 0)) .cse9 .cse10 .cse11 .cse12 .cse13 (not (= ~c_num_read~0 0)) .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse19 (and .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20) (or .cse0 .cse19 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (and (= ~c_dr_st~0 2) (or .cse1 .cse21)) .cse18 .cse20) (or (not (<= 2 |old(~p_dw_st~0)|)) .cse0 .cse9 .cse10 .cse12 .cse13 (not (= ~c_num_read~0 ~p_num_write~0)) .cse15 .cse21 (and .cse1 .cse2 .cse4 .cse7) .cse16 .cse17 .cse18 (not (= ~q_free~0 1)) (not (= ~c_last_read~0 ~p_last_write~0))))) [2022-12-13 21:22:19,571 INFO L899 garLoopResultBuilder]: For program point L70(lines 70 75) no Hoare annotation was computed. [2022-12-13 21:22:19,571 INFO L899 garLoopResultBuilder]: For program point L639-1(lines 628 651) no Hoare annotation was computed. [2022-12-13 21:22:19,571 INFO L899 garLoopResultBuilder]: For program point L634-1(lines 628 651) no Hoare annotation was computed. [2022-12-13 21:22:19,571 INFO L899 garLoopResultBuilder]: For program point L629-1(lines 628 651) no Hoare annotation was computed. [2022-12-13 21:22:19,571 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 625 652) the Hoare annotation is: (let ((.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~c_dr_pc~0 0))) (.cse4 (not (= ~m_i~0 1))) (.cse11 (= ~m_st~0 0)) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (not (= ~c_num_read~0 0))) (.cse0 (= |old(~T1_E~0)| ~T1_E~0)) (.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (not (= ~q_free~0 0))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or (not (= |old(~E_1~0)| |old(~M_E~0)|)) (and .cse0 .cse1 (= ~E_M~0 ~M_E~0) (= ~M_E~0 2)) .cse2 .cse3 .cse4 (not (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) .cse5 .cse6 .cse7 .cse8 (not (= ~t1_pc~0 0)) .cse9 .cse10 (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (not .cse11) (not (= ~t1_st~0 0)) (not (= 2 |old(~M_E~0)|)) .cse12 (not (= ~token~0 ~local~0))) (or .cse2 (not (<= 2 ~t1_st~0)) .cse3 .cse4 .cse11 (not (= ~t1_pc~0 1)) .cse5 .cse6 .cse7 .cse8 .cse9 (and (= ~M_E~0 |old(~M_E~0)|) .cse0 (= ~E_M~0 |old(~E_M~0)|) .cse1) .cse10 (not (<= 2 |old(~E_M~0)|)) (= |old(~E_1~0)| 1) (= |old(~E_1~0)| 0) .cse12))) [2022-12-13 21:22:19,571 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 625 652) no Hoare annotation was computed. [2022-12-13 21:22:19,571 INFO L899 garLoopResultBuilder]: For program point L644-1(lines 625 652) no Hoare annotation was computed. [2022-12-13 21:22:19,571 INFO L899 garLoopResultBuilder]: For program point L494(lines 494 503) no Hoare annotation was computed. [2022-12-13 21:22:19,571 INFO L899 garLoopResultBuilder]: For program point L494-2(lines 494 503) no Hoare annotation was computed. [2022-12-13 21:22:19,572 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 681 705) the Hoare annotation is: (let ((.cse22 (= ~E_1~0 1)) (.cse26 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse2 (and .cse26 (= ~t1_st~0 0))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (= ~m_pc~0 0))) (.cse13 (not (= ~t1_pc~0 0))) (.cse25 (= ~E_1~0 0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~M_E~0 2))) (.cse4 (not (= ~c_dr_pc~0 0))) (.cse5 (= |old(~m_st~0)| 0)) (.cse20 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (not (= ~m_i~0 1))) (.cse21 (and (= |old(~t1_st~0)| ~t1_st~0) .cse26)) (.cse23 (not (= ~t1_pc~0 1))) (.cse9 (not (= ~p_num_write~0 0))) (.cse10 (not (= ~t1_i~0 1))) (.cse11 (not (= ~p_dw_pc~0 0))) (.cse12 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse14 (not (= ~c_num_read~0 0))) (.cse15 (not (= ~q_free~0 0))) (.cse24 (not (<= 2 ~E_M~0))) (.cse16 (not (= ~T1_E~0 ~M_E~0))) (.cse17 (not .cse22)) (.cse18 (not (= ~c_last_read~0 ~p_last_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 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= ~E_1~0 ~M_E~0)) .cse16 (not .cse5) .cse18 .cse19) (or .cse1 .cse4 .cse5 .cse20 .cse6 .cse21 .cse22 .cse23 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse24 .cse25 .cse18) (or .cse1 .cse3 .cse4 .cse5 .cse6 .cse21 .cse22 .cse23 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 (not (< ~local~0 ~token~0)) .cse16 .cse25 .cse18 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse1 .cse3 .cse4 .cse5 .cse20 .cse6 .cse21 .cse23 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse24 .cse16 .cse17 .cse18 .cse19)))) [2022-12-13 21:22:19,572 INFO L895 garLoopResultBuilder]: At program point is_transmit1_triggered_returnLabel#1(lines 509 527) the Hoare annotation is: (let ((.cse35 (= ~c_last_read~0 ~p_last_write~0)) (.cse29 (= ~q_free~0 0)) (.cse24 (= ~c_num_read~0 0)) (.cse26 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (= ~p_dw_pc~0 0)) (.cse25 (= ~t1_i~0 1)) (.cse22 (= ~p_num_write~0 0)) (.cse31 (= ~m_i~0 1)) (.cse34 (= ~c_dr_pc~0 0)) (.cse32 (= ~p_dw_st~0 0)) (.cse21 (= ~T1_E~0 ~M_E~0)) (.cse38 (= ~m_st~0 |old(~m_st~0)|)) (.cse30 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse33 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse36 (<= |activate_threads2_is_transmit1_triggered_#res#1| 0)) (.cse37 (<= 0 |activate_threads2_is_transmit1_triggered_#res#1|)) (.cse39 (= ~E_1~0 1))) (let ((.cse17 (not .cse39)) (.cse23 (<= 1 ~t1_pc~0)) (.cse28 (= ~m_st~0 0)) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse2 (not (= ~M_E~0 2))) (.cse6 (not (= ~E_M~0 ~M_E~0))) (.cse7 (not (= ~m_pc~0 0))) (.cse12 (and .cse38 .cse30 (= ~t1_st~0 0) .cse33 .cse36 .cse37)) (.cse13 (not (= ~t1_pc~0 0))) (.cse16 (not .cse21)) (.cse19 (not (= ~token~0 ~local~0))) (.cse1 (not .cse32)) (.cse3 (not .cse34)) (.cse4 (= |old(~m_st~0)| 0)) (.cse42 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not .cse31)) (.cse40 (not (= ~t1_pc~0 1))) (.cse8 (not .cse22)) (.cse9 (not .cse25)) (.cse10 (not .cse20)) (.cse11 (not .cse26)) (.cse14 (not .cse24)) (.cse15 (not .cse29)) (.cse43 (not (<= 2 ~E_M~0))) (.cse27 (= |old(~t1_st~0)| ~t1_st~0)) (.cse41 (= ~E_1~0 0)) (.cse18 (not .cse35))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or (and .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37) .cse1 .cse2 .cse3 .cse4 (and .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse38 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37) .cse5 .cse39 .cse40 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 (not (< ~local~0 ~token~0)) .cse16 .cse41 .cse18 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse1 .cse2 .cse3 .cse4 .cse42 .cse5 .cse40 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 .cse43 .cse16 .cse17 (and .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse38 .cse29 .cse31 .cse32 .cse34 .cse35) .cse18 (and .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse31 .cse32 .cse34 .cse35) .cse19) (or .cse1 .cse2 .cse3 .cse4 .cse42 .cse5 .cse40 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 .cse43 .cse16 (not .cse28) .cse41 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= ~E_1~0 ~M_E~0)) .cse16 (not .cse4) .cse18 .cse19) (or .cse1 .cse3 .cse4 .cse42 .cse5 .cse39 .cse40 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 .cse43 (and .cse27 .cse38 .cse30 .cse33 .cse36 .cse37) .cse41 .cse18)))) [2022-12-13 21:22:19,572 INFO L899 garLoopResultBuilder]: For program point L513(lines 513 522) no Hoare annotation was computed. [2022-12-13 21:22:19,572 INFO L899 garLoopResultBuilder]: For program point L513-2(lines 513 522) no Hoare annotation was computed. [2022-12-13 21:22:19,572 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 681 705) no Hoare annotation was computed. [2022-12-13 21:22:19,573 INFO L895 garLoopResultBuilder]: At program point L505(lines 493 507) the Hoare annotation is: (let ((.cse23 (= ~E_1~0 1)) (.cse27 (= |old(~t1_st~0)| ~t1_st~0)) (.cse17 (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse18 (= ~m_st~0 |old(~m_st~0)|)) (.cse19 (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))) (let ((.cse26 (= ~E_1~0 0)) (.cse22 (not (<= 2 |old(~t1_st~0)|))) (.cse24 (not (= ~t1_pc~0 1))) (.cse25 (not (<= 2 ~E_M~0))) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (not (= ~M_E~0 2))) (.cse21 (and .cse27 .cse17 .cse18 .cse19)) (.cse3 (not (= ~c_dr_pc~0 0))) (.cse15 (= |old(~m_st~0)| 0)) (.cse4 (not (= ~m_i~0 1))) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse6 (not (= ~m_pc~0 0))) (.cse7 (not (= ~p_num_write~0 0))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (= ~p_dw_pc~0 0))) (.cse10 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse11 (not (= ~t1_pc~0 0))) (.cse12 (not (= ~c_num_read~0 0))) (.cse13 (not (= ~q_free~0 0))) (.cse14 (not (= ~T1_E~0 ~M_E~0))) (.cse28 (not .cse23)) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse20 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= ~E_1~0 ~M_E~0)) .cse14 (not .cse15) .cse16 (and .cse17 .cse18 (= ~t1_st~0 0) .cse19) .cse20) (or .cse1 .cse21 .cse3 .cse15 .cse22 .cse4 .cse23 .cse24 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse25 .cse26 .cse16) (or .cse1 .cse2 .cse3 .cse15 .cse4 (and .cse27 .cse18) .cse23 .cse24 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 (not (< ~local~0 ~token~0)) .cse14 .cse26 .cse16 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse1 .cse2 .cse21 .cse3 .cse15 .cse22 .cse4 .cse24 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse25 .cse14 .cse28 .cse16 .cse20) (or .cse0 .cse1 .cse2 .cse21 .cse3 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse28 .cse16 .cse20)))) [2022-12-13 21:22:19,573 INFO L899 garLoopResultBuilder]: For program point L697(lines 697 701) no Hoare annotation was computed. [2022-12-13 21:22:19,573 INFO L899 garLoopResultBuilder]: For program point L697-2(lines 681 705) no Hoare annotation was computed. [2022-12-13 21:22:19,573 INFO L895 garLoopResultBuilder]: At program point is_master_triggered_returnLabel#1(lines 490 508) the Hoare annotation is: (let ((.cse23 (<= |activate_threads2_is_master_triggered_#res#1| 0)) (.cse28 (= |old(~t1_st~0)| ~t1_st~0)) (.cse24 (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse25 (= ~m_st~0 |old(~m_st~0)|)) (.cse26 (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0)) (.cse27 (<= 0 |activate_threads2_is_master_triggered_#res#1|)) (.cse29 (= ~E_1~0 1))) (let ((.cse16 (not .cse29)) (.cse19 (not (= |old(~t1_st~0)| 0))) (.cse20 (not (= ~E_M~0 ~M_E~0))) (.cse21 (not (= ~m_pc~0 0))) (.cse22 (not (= ~t1_pc~0 0))) (.cse18 (not (= ~token~0 ~local~0))) (.cse2 (not (= ~M_E~0 2))) (.cse15 (not (= ~T1_E~0 ~M_E~0))) (.cse0 (and .cse23 .cse28 .cse24 .cse25 .cse26 .cse27)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~c_dr_pc~0 0))) (.cse4 (= |old(~m_st~0)| 0)) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (not (= ~m_i~0 1))) (.cse7 (not (= ~t1_pc~0 1))) (.cse8 (not (= ~p_num_write~0 0))) (.cse9 (not (= ~t1_i~0 1))) (.cse10 (not (= ~p_dw_pc~0 0))) (.cse11 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse12 (not (= ~c_num_read~0 0))) (.cse13 (not (= ~q_free~0 0))) (.cse14 (not (<= 2 ~E_M~0))) (.cse30 (= ~E_1~0 0)) (.cse17 (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 .cse17 .cse18) (or .cse0 .cse19 .cse1 .cse2 .cse3 .cse4 .cse6 .cse20 .cse21 .cse8 .cse9 .cse10 .cse11 .cse22 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18) (or .cse19 .cse1 .cse2 .cse3 .cse6 .cse20 .cse21 .cse8 .cse9 .cse10 .cse11 .cse22 .cse12 .cse13 (and .cse23 .cse24 .cse25 (= ~t1_st~0 0) .cse26 .cse27) (not (= ~E_1~0 ~M_E~0)) .cse15 (not .cse4) .cse17 .cse18) (or .cse1 .cse2 .cse3 .cse4 .cse6 (and .cse28 .cse25) .cse29 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (< ~local~0 ~token~0)) .cse15 .cse30 .cse17 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse29 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse30 .cse17)))) [2022-12-13 21:22:19,573 INFO L899 garLoopResultBuilder]: For program point L689(lines 689 693) no Hoare annotation was computed. [2022-12-13 21:22:19,573 INFO L899 garLoopResultBuilder]: For program point L495(lines 495 500) no Hoare annotation was computed. [2022-12-13 21:22:19,573 INFO L899 garLoopResultBuilder]: For program point L689-2(lines 689 693) no Hoare annotation was computed. [2022-12-13 21:22:19,574 INFO L895 garLoopResultBuilder]: At program point L524(lines 512 526) the Hoare annotation is: (let ((.cse42 (= ~c_last_read~0 ~p_last_write~0)) (.cse29 (= |old(~t1_st~0)| ~t1_st~0)) (.cse38 (= ~m_st~0 |old(~m_st~0)|)) (.cse32 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse35 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse31 (= ~q_free~0 0)) (.cse26 (= ~c_num_read~0 0)) (.cse28 (= ~p_last_write~0 ~q_buf_0~0)) (.cse22 (= ~p_dw_pc~0 0)) (.cse27 (= ~t1_i~0 1)) (.cse24 (= ~p_num_write~0 0)) (.cse33 (= ~m_i~0 1)) (.cse36 (= ~c_dr_pc~0 0)) (.cse34 (= ~p_dw_st~0 0)) (.cse23 (= ~T1_E~0 ~M_E~0)) (.cse37 (= ~M_E~0 2)) (.cse20 (= ~E_1~0 1))) (let ((.cse30 (= ~m_st~0 0)) (.cse17 (not .cse20)) (.cse25 (<= 1 ~t1_pc~0)) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse2 (not .cse37)) (.cse6 (not (= ~E_M~0 ~M_E~0))) (.cse7 (not (= ~m_pc~0 0))) (.cse12 (not (= ~t1_pc~0 0))) (.cse15 (not .cse23)) (.cse19 (not (= ~token~0 ~local~0))) (.cse1 (not .cse34)) (.cse3 (not .cse36)) (.cse4 (= |old(~m_st~0)| 0)) (.cse40 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not .cse33)) (.cse21 (not (= ~t1_pc~0 1))) (.cse8 (not .cse24)) (.cse9 (not .cse27)) (.cse10 (not .cse22)) (.cse11 (not .cse28)) (.cse13 (not .cse26)) (.cse14 (not .cse31)) (.cse41 (not (<= 2 ~E_M~0))) (.cse16 (and .cse29 .cse38 .cse32 .cse35)) (.cse39 (= ~E_1~0 0)) (.cse18 (not .cse42))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse21 .cse8 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37) .cse9 .cse10 .cse11 .cse13 .cse14 (not (< ~local~0 ~token~0)) (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse38 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37) .cse15 .cse39 .cse18 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse1 .cse2 .cse3 .cse4 .cse40 .cse5 .cse21 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse41 .cse15 (not .cse30) .cse39 .cse18 .cse19) (or (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse33 .cse34 .cse36 .cse42 .cse37) .cse1 .cse2 .cse3 .cse4 .cse40 .cse5 .cse21 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse41 .cse15 .cse17 .cse18 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse38 .cse31 .cse33 .cse34 .cse36 .cse42 .cse37) .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (= ~E_1~0 ~M_E~0)) (and .cse38 .cse32 (= ~t1_st~0 0) .cse35) .cse15 (not .cse4) .cse18 .cse19) (or .cse1 .cse3 .cse4 .cse40 .cse5 .cse20 .cse21 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse41 .cse16 .cse39 .cse18)))) [2022-12-13 21:22:19,574 INFO L899 garLoopResultBuilder]: For program point L514(lines 514 519) no Hoare annotation was computed. [2022-12-13 21:22:19,574 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 528 535) no Hoare annotation was computed. [2022-12-13 21:22:19,574 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 528 535) the Hoare annotation is: true [2022-12-13 21:22:19,574 INFO L902 garLoopResultBuilder]: At program point main1_returnLabel#1(lines 367 378) the Hoare annotation is: true [2022-12-13 21:22:19,574 INFO L895 garLoopResultBuilder]: At program point transmit1_T1_WAIT#1(lines 457 488) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ~p_dw_pc~0 0) (= ~T1_E~0 ~M_E~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2022-12-13 21:22:19,574 INFO L895 garLoopResultBuilder]: At program point L812(line 812) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2022-12-13 21:22:19,574 INFO L895 garLoopResultBuilder]: At program point L779(lines 768 781) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2022-12-13 21:22:19,575 INFO L895 garLoopResultBuilder]: At program point L581(line 581) the Hoare annotation is: (let ((.cse8 (= ~m_st~0 0))) (let ((.cse5 (= ~t1_pc~0 0)) (.cse16 (= ~E_M~0 ~M_E~0)) (.cse10 (= ~t1_st~0 0)) (.cse25 (not .cse8)) (.cse22 (not (= ~E_1~0 1))) (.cse23 (not (= ~E_1~0 0))) (.cse17 (= ~token~0 ~local~0)) (.cse19 (= ~t1_pc~0 1)) (.cse20 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~T1_E~0 ~M_E~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~E_1~0 ~M_E~0)) (.cse4 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (<= 2 ~E_M~0)) (.cse9 (= ~q_free~0 0)) (.cse11 (= ~m_i~0 1)) (.cse24 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse20 .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse21 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse11 .cse12 .cse22 .cse23 .cse13 .cse15 (< ~local~0 ~token~0) .cse18) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse24 .cse12 .cse25 .cse22 .cse23 .cse13 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse20 .cse0 .cse2 .cse4 .cse6 .cse7 .cse21 .cse9 .cse11 .cse12 .cse25 .cse22 .cse23 .cse13 .cse15) (and .cse19 .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse21 .cse9 .cse10 .cse11 .cse12 .cse25 .cse22 .cse23 .cse13 .cse15 .cse17 .cse18) (and .cse19 .cse20 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse21 .cse9 .cse11 .cse24 .cse12 .cse13 .cse14 .cse15 .cse18)))) [2022-12-13 21:22:19,575 INFO L895 garLoopResultBuilder]: At program point L317(lines 306 319) the Hoare annotation is: (let ((.cse2 (= ~c_num_read~0 ~p_num_write~0)) (.cse9 (= ~p_dw_st~0 0)) (.cse3 (= ~c_dr_st~0 2)) (.cse19 (= ~q_free~0 0)) (.cse14 (= ~p_dw_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse15 (= ~p_num_write~0 0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse16 (= ~c_num_read~0 0)) (.cse4 (= ~t1_pc~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse17 (= ~c_dr_pc~0 0)) (.cse10 (= ~m_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse12 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse18 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse4 .cse5 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse10 .cse18 .cse11 .cse13 .cse12))) [2022-12-13 21:22:19,575 INFO L899 garLoopResultBuilder]: For program point L284(lines 284 291) no Hoare annotation was computed. [2022-12-13 21:22:19,575 INFO L899 garLoopResultBuilder]: For program point L730(lines 730 734) no Hoare annotation was computed. [2022-12-13 21:22:19,575 INFO L895 garLoopResultBuilder]: At program point do_write_p_returnLabel#1(lines 109 151) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse2 (= ~t1_pc~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_st~0 0)) (.cse5 (= ~q_free~0 0)) (.cse6 (= ~t1_st~0 0)) (.cse7 (= ~m_pc~0 0)) (.cse8 (= ~E_M~0 ~M_E~0)) (.cse9 (<= 2 ~p_dw_st~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 (= ~c_dr_st~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2022-12-13 21:22:19,575 INFO L899 garLoopResultBuilder]: For program point L730-2(lines 729 752) no Hoare annotation was computed. [2022-12-13 21:22:19,575 INFO L899 garLoopResultBuilder]: For program point L169(lines 168 203) no Hoare annotation was computed. [2022-12-13 21:22:19,575 INFO L899 garLoopResultBuilder]: For program point L417(lines 417 421) no Hoare annotation was computed. [2022-12-13 21:22:19,575 INFO L899 garLoopResultBuilder]: For program point L830(lines 830 834) no Hoare annotation was computed. [2022-12-13 21:22:19,575 INFO L895 garLoopResultBuilder]: At program point L219-1(lines 210 227) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~T1_E~0 ~M_E~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~E_1~0 ~M_E~0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_pc~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~m_st~0 0)) (.cse8 (= ~q_free~0 1)) (.cse9 (= ~t1_st~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~m_pc~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= ~E_M~0 ~M_E~0)) (.cse14 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~p_dw_st~0 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= 2 ~p_dw_st~0) .cse14))) [2022-12-13 21:22:19,575 INFO L899 garLoopResultBuilder]: For program point L269(lines 269 276) no Hoare annotation was computed. [2022-12-13 21:22:19,575 INFO L899 garLoopResultBuilder]: For program point L170-1(lines 170 180) no Hoare annotation was computed. [2022-12-13 21:22:19,575 INFO L899 garLoopResultBuilder]: For program point L583(line 583) no Hoare annotation was computed. [2022-12-13 21:22:19,576 INFO L895 garLoopResultBuilder]: At program point L798-1(lines 798 835) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~m_i~0 1)) (.cse8 (= ~p_dw_st~0 0)) (.cse5 (= ~m_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 (= ~T1_E~0 ~M_E~0) .cse1 (= ~E_1~0 ~M_E~0) .cse2 (= ~t1_pc~0 0) .cse3 .cse4 .cse5 .cse6 (= ~t1_st~0 0) .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10 (= ~E_M~0 ~M_E~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 ~E_M~0) .cse6 .cse7 .cse8 (not .cse5) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) .cse9 .cse10))) [2022-12-13 21:22:19,576 INFO L895 garLoopResultBuilder]: At program point L187(line 187) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (= ~E_1~0 ~M_E~0) (= ~c_num_read~0 ~p_num_write~0) (= ~t1_pc~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_st~0 0) (= ~q_free~0 1) (= ~t1_st~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 ~M_E~0) (<= 2 ~p_dw_st~0) (= ~M_E~0 2)) [2022-12-13 21:22:19,576 INFO L899 garLoopResultBuilder]: For program point L187-1(line 187) no Hoare annotation was computed. [2022-12-13 21:22:19,576 INFO L899 garLoopResultBuilder]: For program point L815(line 815) no Hoare annotation was computed. [2022-12-13 21:22:19,576 INFO L895 garLoopResultBuilder]: At program point transmit1_returnLabel#1(lines 454 489) the Hoare annotation is: (let ((.cse12 (not (= ~E_1~0 1))) (.cse13 (not (= ~E_1~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (= ~T1_E~0 ~M_E~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (<= 2 ~E_M~0)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse14 (= ~c_dr_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (< ~local~0 ~token~0) .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ~m_st~0 0)) .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~E_1~0 ~M_E~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|) .cse11 .cse14 (= ~m_pc~0 0) .cse15 .cse16))) [2022-12-13 21:22:19,576 INFO L899 garLoopResultBuilder]: For program point L799(line 799) no Hoare annotation was computed. [2022-12-13 21:22:19,576 INFO L895 garLoopResultBuilder]: At program point L469-1(lines 469 482) the Hoare annotation is: (let ((.cse18 (<= 1 ~t1_pc~0)) (.cse12 (= ~T1_E~0 ~M_E~0)) (.cse14 (= ~t1_pc~0 0)) (.cse15 (= ~m_i~0 1)) (.cse16 (= ~p_dw_st~0 0)) (.cse17 (= ~c_dr_pc~0 0)) (.cse11 (= ~M_E~0 2))) (let ((.cse7 (not (= ~E_1~0 1))) (.cse8 (not (= ~E_1~0 0))) (.cse10 (or (and .cse12 .cse18 .cse15 .cse16 .cse17 .cse11) (and .cse12 .cse14 .cse15 .cse16 .cse17 .cse11))) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_free~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse7 .cse8 .cse9 (< ~local~0 ~token~0) .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_st~0 0)) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|) (= ~m_pc~0 0) .cse9 .cse11 (let ((.cse13 (= ~E_1~0 ~M_E~0))) (or (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse12 .cse18 .cse13 .cse15 .cse16 .cse17))))))) [2022-12-13 21:22:19,576 INFO L895 garLoopResultBuilder]: At program point init_model2_returnLabel#1(lines 754 763) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~T1_E~0 ~M_E~0) (= ~p_num_write~0 0) (= ~E_1~0 ~M_E~0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 ~M_E~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2022-12-13 21:22:19,576 INFO L899 garLoopResultBuilder]: For program point L585(lines 585 589) no Hoare annotation was computed. [2022-12-13 21:22:19,576 INFO L899 garLoopResultBuilder]: For program point L585-1(lines 580 618) no Hoare annotation was computed. [2022-12-13 21:22:19,576 INFO L895 garLoopResultBuilder]: At program point do_read_c_DR_WAIT_WRITE#1(lines 156 208) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (= ~E_1~0 ~M_E~0) (= ~t1_pc~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~m_pc~0 0) (= ~E_M~0 ~M_E~0) (<= 2 ~p_dw_st~0) (= ~M_E~0 2)) [2022-12-13 21:22:19,576 INFO L899 garLoopResultBuilder]: For program point L470(line 470) no Hoare annotation was computed. [2022-12-13 21:22:19,576 INFO L899 garLoopResultBuilder]: For program point L338(lines 338 342) no Hoare annotation was computed. [2022-12-13 21:22:19,576 INFO L895 garLoopResultBuilder]: At program point start_simulation2_returnLabel#1(lines 783 841) the Hoare annotation is: (= ~p_dw_st~0 0) [2022-12-13 21:22:19,577 INFO L899 garLoopResultBuilder]: For program point L817(lines 817 826) no Hoare annotation was computed. [2022-12-13 21:22:19,577 INFO L899 garLoopResultBuilder]: For program point L817-2(lines 817 826) no Hoare annotation was computed. [2022-12-13 21:22:19,577 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 21:22:19,577 INFO L895 garLoopResultBuilder]: At program point L256(line 256) the Hoare annotation is: (let ((.cse2 (= ~c_num_read~0 ~p_num_write~0)) (.cse9 (= ~p_dw_st~0 0)) (.cse3 (= ~c_dr_st~0 2)) (.cse19 (= ~q_free~0 0)) (.cse14 (= ~p_dw_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse15 (= ~p_num_write~0 0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse16 (= ~c_num_read~0 0)) (.cse4 (= ~t1_pc~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse17 (= ~c_dr_pc~0 0)) (.cse10 (= ~m_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse12 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse18 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse4 .cse5 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse10 .cse18 .cse11 .cse13 .cse12))) [2022-12-13 21:22:19,577 INFO L899 garLoopResultBuilder]: For program point L190(lines 190 202) no Hoare annotation was computed. [2022-12-13 21:22:19,577 INFO L895 garLoopResultBuilder]: At program point master_returnLabel#1(lines 410 453) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse7 (<= 2 ~E_M~0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~q_free~0 0)) (.cse9 (= ~t1_st~0 0)) (.cse10 (= ~m_i~0 1)) (.cse11 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (not (= ~m_st~0 0))) (.cse14 (not (= ~E_1~0 1))) (.cse15 (not (= ~E_1~0 0))) (.cse16 (= ~c_dr_pc~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 (<= 2 ~t1_st~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse3 .cse4 (= ~t1_pc~0 0) .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~E_M~0 ~M_E~0) .cse18 .cse19))) [2022-12-13 21:22:19,577 INFO L899 garLoopResultBuilder]: For program point L735-1(lines 729 752) no Hoare annotation was computed. [2022-12-13 21:22:19,577 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 165) no Hoare annotation was computed. [2022-12-13 21:22:19,577 INFO L895 garLoopResultBuilder]: At program point stop_simulation2_returnLabel#1(lines 764 782) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2022-12-13 21:22:19,577 INFO L895 garLoopResultBuilder]: At program point fire_time_events2_returnLabel#1(lines 717 725) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2022-12-13 21:22:19,577 INFO L899 garLoopResultBuilder]: For program point L191(lines 191 197) no Hoare annotation was computed. [2022-12-13 21:22:19,577 INFO L895 garLoopResultBuilder]: At program point L125-1(lines 125 145) the Hoare annotation is: (let ((.cse6 (= ~q_free~0 1)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse2 (= ~c_dr_st~0 2)) (.cse3 (= ~t1_pc~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_st~0 0)) (.cse11 (= ~q_free~0 0)) (.cse7 (= ~t1_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse9 (= ~E_M~0 ~M_E~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 (= ~c_num_read~0 ~p_num_write~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse3 .cse4 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse5 .cse11 .cse7 .cse8 .cse9 .cse10) (and (= ~p_dw_pc~0 0) .cse0 (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 (= ~c_dr_pc~0 0) .cse8 (= ~c_last_read~0 ~p_last_write~0) .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse7 .cse8 .cse9 .cse10))) [2022-12-13 21:22:19,578 INFO L895 garLoopResultBuilder]: At program point L604(lines 580 618) the Hoare annotation is: (let ((.cse8 (= ~m_st~0 0))) (let ((.cse5 (= ~t1_pc~0 0)) (.cse16 (= ~E_M~0 ~M_E~0)) (.cse10 (= ~t1_st~0 0)) (.cse25 (not .cse8)) (.cse22 (not (= ~E_1~0 1))) (.cse23 (not (= ~E_1~0 0))) (.cse17 (= ~token~0 ~local~0)) (.cse19 (= ~t1_pc~0 1)) (.cse20 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~T1_E~0 ~M_E~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~E_1~0 ~M_E~0)) (.cse4 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (<= 2 ~E_M~0)) (.cse9 (= ~q_free~0 0)) (.cse11 (= ~m_i~0 1)) (.cse24 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse20 .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse21 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse11 .cse12 .cse22 .cse23 .cse13 .cse15 (< ~local~0 ~token~0) .cse18) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse24 .cse12 .cse25 .cse22 .cse23 .cse13 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse20 .cse0 .cse2 .cse4 .cse6 .cse7 .cse21 .cse9 .cse11 .cse12 .cse25 .cse22 .cse23 .cse13 .cse15) (and .cse19 .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse21 .cse9 .cse10 .cse11 .cse12 .cse25 .cse22 .cse23 .cse13 .cse15 .cse17 .cse18) (and .cse19 .cse20 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse21 .cse9 .cse11 .cse24 .cse12 .cse13 .cse14 .cse15 .cse18)))) [2022-12-13 21:22:19,578 INFO L902 garLoopResultBuilder]: At program point start_simulation1_returnLabel#1(lines 321 349) the Hoare annotation is: true [2022-12-13 21:22:19,578 INFO L895 garLoopResultBuilder]: At program point L439-1(lines 425 446) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~T1_E~0 ~M_E~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~m_i~0 1)) (.cse8 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|)) (.cse9 (= ~p_dw_st~0 0)) (.cse10 (not (= ~m_st~0 0))) (.cse11 (not (= ~E_1~0 1))) (.cse12 (not (= ~E_1~0 0))) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~t1_pc~0 0) .cse4 .cse5 .cse6 (= ~t1_st~0 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~m_pc~0 0) .cse14 (= ~E_M~0 ~M_E~0) (= ~token~0 ~local~0) .cse15) (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~E_M~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-12-13 21:22:19,578 INFO L895 garLoopResultBuilder]: At program point L142(line 142) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse2 (= ~t1_pc~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_st~0 0)) (.cse5 (= ~q_free~0 0)) (.cse6 (= ~t1_st~0 0)) (.cse7 (= ~m_pc~0 0)) (.cse8 (= ~E_M~0 ~M_E~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 .cse1 (= ~c_dr_st~0 2) .cse2 .cse3 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (= ~p_dw_pc~0 0) .cse0 .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 (= ~c_dr_pc~0 0) .cse7 (= ~p_num_write~0 1) .cse8 .cse9))) [2022-12-13 21:22:19,578 INFO L899 garLoopResultBuilder]: For program point L142-1(line 142) no Hoare annotation was computed. [2022-12-13 21:22:19,578 INFO L899 garLoopResultBuilder]: For program point L390(line 390) no Hoare annotation was computed. [2022-12-13 21:22:19,578 INFO L899 garLoopResultBuilder]: For program point L258(line 258) no Hoare annotation was computed. [2022-12-13 21:22:19,578 INFO L895 garLoopResultBuilder]: At program point L770(line 770) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2022-12-13 21:22:19,578 INFO L899 garLoopResultBuilder]: For program point L770-1(line 770) no Hoare annotation was computed. [2022-12-13 21:22:19,578 INFO L899 garLoopResultBuilder]: For program point L126(lines 125 145) no Hoare annotation was computed. [2022-12-13 21:22:19,578 INFO L895 garLoopResultBuilder]: At program point L308(line 308) the Hoare annotation is: (let ((.cse2 (= ~c_num_read~0 ~p_num_write~0)) (.cse9 (= ~p_dw_st~0 0)) (.cse3 (= ~c_dr_st~0 2)) (.cse19 (= ~q_free~0 0)) (.cse14 (= ~p_dw_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse15 (= ~p_num_write~0 0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse16 (= ~c_num_read~0 0)) (.cse4 (= ~t1_pc~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse17 (= ~c_dr_pc~0 0)) (.cse10 (= ~m_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse12 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse18 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse4 .cse5 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse10 .cse18 .cse11 .cse13 .cse12))) [2022-12-13 21:22:19,578 INFO L899 garLoopResultBuilder]: For program point L308-1(line 308) no Hoare annotation was computed. [2022-12-13 21:22:19,578 INFO L895 garLoopResultBuilder]: At program point error2_returnLabel#1(lines 386 393) the Hoare annotation is: false [2022-12-13 21:22:19,579 INFO L895 garLoopResultBuilder]: At program point eval2_returnLabel#1(lines 574 624) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2022-12-13 21:22:19,579 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 164) no Hoare annotation was computed. [2022-12-13 21:22:19,579 INFO L895 garLoopResultBuilder]: At program point L127(lines 127 135) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse2 (= ~t1_pc~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_st~0 0)) (.cse5 (= ~t1_st~0 0)) (.cse6 (= ~m_pc~0 0)) (.cse7 (= ~E_M~0 ~M_E~0)) (.cse8 (= ~M_E~0 2))) (or (and (= ~p_dw_pc~0 0) .cse0 (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 (= ~c_dr_pc~0 0) .cse6 .cse7 .cse8) (and .cse0 .cse1 (= ~c_num_read~0 ~p_num_write~0) (= ~c_dr_st~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2022-12-13 21:22:19,579 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 21:22:19,579 INFO L899 garLoopResultBuilder]: For program point L540(lines 540 544) no Hoare annotation was computed. [2022-12-13 21:22:19,579 INFO L899 garLoopResultBuilder]: For program point L540-2(lines 539 552) no Hoare annotation was computed. [2022-12-13 21:22:19,579 INFO L899 garLoopResultBuilder]: For program point L854(lines 854 860) no Hoare annotation was computed. [2022-12-13 21:22:19,579 INFO L895 garLoopResultBuilder]: At program point L821(line 821) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2022-12-13 21:22:19,579 INFO L899 garLoopResultBuilder]: For program point L821-1(line 821) no Hoare annotation was computed. [2022-12-13 21:22:19,579 INFO L899 garLoopResultBuilder]: For program point L590(lines 580 618) no Hoare annotation was computed. [2022-12-13 21:22:19,579 INFO L895 garLoopResultBuilder]: At program point init_model1_returnLabel#1(lines 350 366) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~T1_E~0 ~M_E~0) (= ~p_num_write~0 0) (= ~E_1~0 ~M_E~0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_st~0 0) (= ~q_free~0 1) (= ~t1_st~0 0) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 2)) [2022-12-13 21:22:19,579 INFO L899 garLoopResultBuilder]: For program point L458(lines 458 466) no Hoare annotation was computed. [2022-12-13 21:22:19,579 INFO L899 garLoopResultBuilder]: For program point L260(lines 260 264) no Hoare annotation was computed. [2022-12-13 21:22:19,579 INFO L899 garLoopResultBuilder]: For program point L772(lines 772 777) no Hoare annotation was computed. [2022-12-13 21:22:19,579 INFO L899 garLoopResultBuilder]: For program point L260-1(lines 255 295) no Hoare annotation was computed. [2022-12-13 21:22:19,579 INFO L899 garLoopResultBuilder]: For program point L607(lines 607 614) no Hoare annotation was computed. [2022-12-13 21:22:19,579 INFO L895 garLoopResultBuilder]: At program point do_read_c_returnLabel#1(lines 153 209) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse2 (= ~c_num_read~0 ~p_num_write~0)) (.cse3 (= ~c_dr_st~0 2)) (.cse4 (= ~t1_pc~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse9 (= ~m_pc~0 0)) (.cse10 (= ~E_M~0 ~M_E~0)) (.cse11 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~p_dw_st~0 0) .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 2 ~p_dw_st~0) .cse11))) [2022-12-13 21:22:19,579 INFO L899 garLoopResultBuilder]: For program point L310(lines 310 315) no Hoare annotation was computed. [2022-12-13 21:22:19,580 INFO L895 garLoopResultBuilder]: At program point stop_simulation1_returnLabel#1(lines 302 320) the Hoare annotation is: (let ((.cse2 (= ~c_num_read~0 ~p_num_write~0)) (.cse9 (= ~p_dw_st~0 0)) (.cse3 (= ~c_dr_st~0 2)) (.cse19 (= ~q_free~0 0)) (.cse14 (= ~p_dw_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse15 (= ~p_num_write~0 0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse16 (= ~c_num_read~0 0)) (.cse4 (= ~t1_pc~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse17 (= ~c_dr_pc~0 0)) (.cse10 (= ~m_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse12 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse18 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse4 .cse5 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse10 .cse18 .cse11 .cse13 .cse12))) [2022-12-13 21:22:19,580 INFO L899 garLoopResultBuilder]: For program point L426(line 426) no Hoare annotation was computed. [2022-12-13 21:22:19,580 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 21:22:19,580 INFO L895 garLoopResultBuilder]: At program point L806(line 806) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2022-12-13 21:22:19,580 INFO L899 garLoopResultBuilder]: For program point L806-1(line 806) no Hoare annotation was computed. [2022-12-13 21:22:19,580 INFO L895 garLoopResultBuilder]: At program point L195(line 195) the Hoare annotation is: false [2022-12-13 21:22:19,580 INFO L899 garLoopResultBuilder]: For program point L740-1(lines 729 752) no Hoare annotation was computed. [2022-12-13 21:22:19,580 INFO L899 garLoopResultBuilder]: For program point L856(lines 856 859) no Hoare annotation was computed. [2022-12-13 21:22:19,580 INFO L895 garLoopResultBuilder]: At program point eval1_returnLabel#1(lines 248 301) the Hoare annotation is: (let ((.cse2 (= ~c_num_read~0 ~p_num_write~0)) (.cse9 (= ~p_dw_st~0 0)) (.cse3 (= ~c_dr_st~0 2)) (.cse19 (= ~q_free~0 0)) (.cse14 (= ~p_dw_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse15 (= ~p_num_write~0 0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse16 (= ~c_num_read~0 0)) (.cse4 (= ~t1_pc~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse17 (= ~c_dr_pc~0 0)) (.cse10 (= ~m_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse12 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse18 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse4 .cse5 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse10 .cse18 .cse11 .cse13 .cse12))) [2022-12-13 21:22:19,580 INFO L895 garLoopResultBuilder]: At program point L791(line 791) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~T1_E~0 ~M_E~0) (= ~p_num_write~0 0) (= ~E_1~0 ~M_E~0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 ~M_E~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2022-12-13 21:22:19,580 INFO L899 garLoopResultBuilder]: For program point L791-1(line 791) no Hoare annotation was computed. [2022-12-13 21:22:19,580 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 122) no Hoare annotation was computed. [2022-12-13 21:22:19,580 INFO L899 garLoopResultBuilder]: For program point L593(lines 593 600) no Hoare annotation was computed. [2022-12-13 21:22:19,580 INFO L899 garLoopResultBuilder]: For program point L461(lines 461 465) no Hoare annotation was computed. [2022-12-13 21:22:19,580 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 21:22:19,581 INFO L895 garLoopResultBuilder]: At program point main2_returnLabel#1(lines 842 853) the Hoare annotation is: (= ~p_dw_st~0 0) [2022-12-13 21:22:19,581 INFO L895 garLoopResultBuilder]: At program point L280(lines 255 295) the Hoare annotation is: (let ((.cse2 (= ~c_num_read~0 ~p_num_write~0)) (.cse9 (= ~p_dw_st~0 0)) (.cse3 (= ~c_dr_st~0 2)) (.cse19 (= ~q_free~0 0)) (.cse14 (= ~p_dw_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse15 (= ~p_num_write~0 0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse16 (= ~c_num_read~0 0)) (.cse4 (= ~t1_pc~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse17 (= ~c_dr_pc~0 0)) (.cse10 (= ~m_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse12 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse18 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse4 .cse5 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse10 .cse18 .cse11 .cse13 .cse12))) [2022-12-13 21:22:19,581 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 390) no Hoare annotation was computed. [2022-12-13 21:22:19,581 INFO L899 garLoopResultBuilder]: For program point L214(lines 214 218) no Hoare annotation was computed. [2022-12-13 21:22:19,581 INFO L899 garLoopResultBuilder]: For program point L214-2(lines 213 226) no Hoare annotation was computed. [2022-12-13 21:22:19,581 INFO L895 garLoopResultBuilder]: At program point $Ultimate##101(lines 439 445) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~T1_E~0 ~M_E~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (<= ~token~0 (+ ~local~0 1)) (= ~q_free~0 0) (= ~m_i~0 1) (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (< ~local~0 ~token~0) (= ~M_E~0 2)) [2022-12-13 21:22:19,581 INFO L895 garLoopResultBuilder]: At program point L545-1(lines 536 553) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~T1_E~0 ~M_E~0) (= ~p_num_write~0 0) (= ~E_1~0 ~M_E~0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 ~M_E~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2022-12-13 21:22:19,581 INFO L895 garLoopResultBuilder]: At program point L479(line 479) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ~p_dw_pc~0 0) (= ~T1_E~0 ~M_E~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= ~token~0 (+ ~local~0 1)) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (< ~local~0 ~token~0) (= ~M_E~0 2)) [2022-12-13 21:22:19,581 INFO L899 garLoopResultBuilder]: For program point L479-1(line 479) no Hoare annotation was computed. [2022-12-13 21:22:19,581 INFO L895 garLoopResultBuilder]: At program point L793(line 793) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~T1_E~0 ~M_E~0) (= ~p_num_write~0 0) (= ~E_1~0 ~M_E~0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 ~M_E~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2022-12-13 21:22:19,581 INFO L895 garLoopResultBuilder]: At program point L793-1(line 793) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~T1_E~0 ~M_E~0) (= ~p_num_write~0 0) (= ~E_1~0 ~M_E~0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 ~M_E~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2022-12-13 21:22:19,582 INFO L895 garLoopResultBuilder]: At program point L810(line 810) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2022-12-13 21:22:19,582 INFO L899 garLoopResultBuilder]: For program point L265(lines 255 295) no Hoare annotation was computed. [2022-12-13 21:22:19,582 INFO L895 garLoopResultBuilder]: At program point L331-2(lines 331 343) the Hoare annotation is: (let ((.cse2 (= ~c_num_read~0 ~p_num_write~0)) (.cse9 (= ~p_dw_st~0 0)) (.cse3 (= ~c_dr_st~0 2)) (.cse19 (= ~q_free~0 0)) (.cse14 (= ~p_dw_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse15 (= ~p_num_write~0 0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse16 (= ~c_num_read~0 0)) (.cse4 (= ~t1_pc~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse17 (= ~c_dr_pc~0 0)) (.cse10 (= ~m_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse12 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse18 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse4 .cse5 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse10 .cse18 .cse11 .cse13 .cse12))) [2022-12-13 21:22:19,582 INFO L895 garLoopResultBuilder]: At program point L810-1(line 810) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2022-12-13 21:22:19,582 INFO L899 garLoopResultBuilder]: For program point L414(lines 414 422) no Hoare annotation was computed. [2022-12-13 21:22:19,582 INFO L895 garLoopResultBuilder]: At program point L794(line 794) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~T1_E~0 ~M_E~0) (= ~p_num_write~0 0) (= ~E_1~0 ~M_E~0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 ~M_E~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2022-12-13 21:22:19,582 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 121) no Hoare annotation was computed. [2022-12-13 21:22:19,582 INFO L895 garLoopResultBuilder]: At program point L431(line 431) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~T1_E~0 ~M_E~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~E_1~0 1)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~m_i~0 1)) (.cse9 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|)) (.cse10 (= ~p_dw_st~0 0)) (.cse11 (not (= ~m_st~0 0))) (.cse12 (= ~c_dr_pc~0 0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (= ~token~0 ~local~0)) (.cse15 (= ~M_E~0 2))) (or (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~E_M~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 (= ~t1_pc~0 0) .cse4 .cse5 .cse6 .cse7 (= ~t1_st~0 0) .cse8 .cse9 .cse10 .cse11 .cse12 (= ~m_pc~0 0) .cse13 (= ~E_M~0 ~M_E~0) .cse14 .cse15))) [2022-12-13 21:22:19,582 INFO L899 garLoopResultBuilder]: For program point L431-1(line 431) no Hoare annotation was computed. [2022-12-13 21:22:19,582 INFO L899 garLoopResultBuilder]: For program point L332(line 332) no Hoare annotation was computed. [2022-12-13 21:22:19,582 INFO L895 garLoopResultBuilder]: At program point L811(line 811) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2022-12-13 21:22:19,582 INFO L895 garLoopResultBuilder]: At program point L200(line 200) the Hoare annotation is: false [2022-12-13 21:22:19,583 INFO L895 garLoopResultBuilder]: At program point L745-1(lines 726 753) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2022-12-13 21:22:19,583 INFO L895 garLoopResultBuilder]: At program point L200-1(lines 168 203) the Hoare annotation is: (let ((.cse2 (= ~c_num_read~0 ~p_num_write~0)) (.cse6 (= ~q_free~0 1)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse3 (= ~t1_pc~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_st~0 0)) (.cse7 (= ~t1_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse10 (= ~E_M~0 ~M_E~0)) (.cse11 (<= 2 ~p_dw_st~0)) (.cse12 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~p_dw_st~0 0) .cse8 .cse9 .cse10 .cse12) (and .cse0 .cse1 .cse3 .cse4 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse5 (= ~q_free~0 0) .cse7 .cse8 .cse10 .cse11 .cse12))) [2022-12-13 21:22:19,583 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1FINAL(lines 228 247) no Hoare annotation was computed. [2022-12-13 21:22:19,583 INFO L902 garLoopResultBuilder]: At program point L244(lines 231 246) the Hoare annotation is: true [2022-12-13 21:22:19,583 INFO L899 garLoopResultBuilder]: For program point L236(lines 236 241) no Hoare annotation was computed. [2022-12-13 21:22:19,583 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 228 247) the Hoare annotation is: true [2022-12-13 21:22:19,583 INFO L899 garLoopResultBuilder]: For program point L232(lines 232 242) no Hoare annotation was computed. [2022-12-13 21:22:19,583 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 228 247) no Hoare annotation was computed. [2022-12-13 21:22:19,583 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 23 30) the Hoare annotation is: true [2022-12-13 21:22:19,583 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2022-12-13 21:22:19,583 INFO L899 garLoopResultBuilder]: For program point error1FINAL(lines 23 30) no Hoare annotation was computed. [2022-12-13 21:22:19,583 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2022-12-13 21:22:19,583 INFO L895 garLoopResultBuilder]: At program point L570(lines 557 572) the Hoare annotation is: (let ((.cse4 (= ~m_st~0 0))) (let ((.cse5 (= ~E_1~0 1)) (.cse17 (= ~E_1~0 0)) (.cse20 (not (<= 2 ~t1_st~0))) (.cse6 (not (= ~t1_pc~0 1))) (.cse13 (not (<= 2 ~E_M~0))) (.cse21 (not .cse4)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (not (= ~c_dr_pc~0 0))) (.cse3 (not (= ~m_i~0 1))) (.cse22 (not (= ~E_M~0 ~M_E~0))) (.cse24 (not (= ~m_pc~0 0))) (.cse7 (not (= ~p_num_write~0 0))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (= ~p_dw_pc~0 0))) (.cse10 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse23 (not (= ~t1_pc~0 0))) (.cse11 (not (= ~c_num_read~0 0))) (.cse12 (not (= ~q_free~0 0))) (.cse25 (not (= ~E_1~0 ~M_E~0))) (.cse14 (not (= ~T1_E~0 ~M_E~0))) (.cse15 (<= 1 exists_runnable_thread2_~__retres1~6)) (.cse16 (not (= ~t1_st~0 0))) (.cse18 (not (= ~c_last_read~0 ~p_last_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 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse20 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (< ~local~0 ~token~0)) .cse14 .cse21 .cse15 .cse17 .cse18 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse22 .cse7 .cse8 .cse9 .cse10 .cse23 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse20 .cse2 .cse3 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse25 .cse14 .cse21 .cse15 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse22 .cse24 .cse7 .cse8 .cse9 .cse10 .cse23 .cse11 .cse12 .cse25 .cse14 .cse15 .cse16 .cse18 .cse19)))) [2022-12-13 21:22:19,583 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2FINAL(lines 554 573) no Hoare annotation was computed. [2022-12-13 21:22:19,583 INFO L899 garLoopResultBuilder]: For program point L562(lines 562 567) no Hoare annotation was computed. [2022-12-13 21:22:19,583 INFO L899 garLoopResultBuilder]: For program point L558(lines 558 568) no Hoare annotation was computed. [2022-12-13 21:22:19,584 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 554 573) the Hoare annotation is: true [2022-12-13 21:22:19,584 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 554 573) no Hoare annotation was computed. [2022-12-13 21:22:19,584 INFO L899 garLoopResultBuilder]: For program point L672-1(lines 653 680) no Hoare annotation was computed. [2022-12-13 21:22:19,584 INFO L899 garLoopResultBuilder]: For program point L667-1(lines 656 679) no Hoare annotation was computed. [2022-12-13 21:22:19,584 INFO L899 garLoopResultBuilder]: For program point L662-1(lines 656 679) no Hoare annotation was computed. [2022-12-13 21:22:19,584 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 653 680) no Hoare annotation was computed. [2022-12-13 21:22:19,584 INFO L899 garLoopResultBuilder]: For program point L657-1(lines 656 679) no Hoare annotation was computed. [2022-12-13 21:22:19,584 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 653 680) the Hoare annotation is: (let ((.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~c_dr_pc~0 0))) (.cse4 (not (= ~m_i~0 1))) (.cse11 (= ~m_st~0 0)) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (not (= ~c_num_read~0 0))) (.cse0 (= |old(~T1_E~0)| ~T1_E~0)) (.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (not (= ~q_free~0 0))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or (not (= |old(~E_1~0)| |old(~M_E~0)|)) (and .cse0 .cse1 (= ~E_M~0 ~M_E~0) (= ~M_E~0 2)) .cse2 .cse3 .cse4 (not (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) .cse5 .cse6 .cse7 .cse8 (not (= ~t1_pc~0 0)) .cse9 .cse10 (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (not .cse11) (not (= ~t1_st~0 0)) (not (= 2 |old(~M_E~0)|)) .cse12 (not (= ~token~0 ~local~0))) (or .cse2 (not (<= 2 ~t1_st~0)) .cse3 .cse4 .cse11 (not (= ~t1_pc~0 1)) .cse5 .cse6 .cse7 .cse8 .cse9 (and (= ~M_E~0 |old(~M_E~0)|) .cse0 (= ~E_M~0 |old(~E_M~0)|) .cse1) .cse10 (not (<= 2 |old(~E_M~0)|)) (= |old(~E_1~0)| 1) (= |old(~E_1~0)| 0) .cse12))) [2022-12-13 21:22:19,586 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] [2022-12-13 21:22:19,588 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 21:22:19,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:22:19 BoogieIcfgContainer [2022-12-13 21:22:19,637 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 21:22:19,638 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 21:22:19,638 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 21:22:19,638 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 21:22:19,638 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:18:05" (3/4) ... [2022-12-13 21:22:19,640 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 21:22:19,645 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2022-12-13 21:22:19,645 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify_threads [2022-12-13 21:22:19,645 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2022-12-13 21:22:19,645 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2022-12-13 21:22:19,645 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2022-12-13 21:22:19,646 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2022-12-13 21:22:19,646 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2022-12-13 21:22:19,646 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2022-12-13 21:22:19,646 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2022-12-13 21:22:19,651 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2022-12-13 21:22:19,651 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-12-13 21:22:19,652 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-13 21:22:19,652 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 21:22:19,670 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || (((0 <= __retres1 && m_st == \old(m_st)) && t1_st == 0) && __retres1 <= 0)) || !(token == local)) && ((((((((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || E_1 == 0) || !(c_last_read == p_last_write))) && ((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(T1_E == M_E)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && ((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(T1_E == M_E)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || !(token == local)) [2022-12-13 21:22:19,670 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || !(token == local)) && ((((((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(T1_E == M_E)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || (((((\result <= 0 && 0 <= __retres1) && m_st == \old(m_st)) && t1_st == 0) && __retres1 <= 0) && 0 <= \result)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(T1_E == M_E)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && (((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || E_1 == 0) || !(c_last_read == p_last_write)) [2022-12-13 21:22:19,671 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(T1_E == M_E)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || !(token == local)) && (((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && __retres1 <= 0) && m_i == 1) && p_dw_st == 0) && 0 <= __retres1) && c_dr_pc == 0) && M_E == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && __retres1 <= 0) && m_i == 1) && p_dw_st == 0) && 0 <= __retres1) && c_dr_pc == 0) && M_E == 2)) || !(T1_E == M_E)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && (((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(m_st == 0)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && M_E == 2) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || ((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && M_E == 2)) || !(token == local))) && (((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || (((m_st == \old(m_st) && __retres1 <= 0) && t1_st == 0) && 0 <= __retres1)) || !(T1_E == M_E)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || E_1 == 0) || !(c_last_read == p_last_write)) [2022-12-13 21:22:19,671 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || (((((m_st == \old(m_st) && __retres1 <= 0) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(T1_E == M_E)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || !(token == local)) && ((((((((((((((((((((((((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && __retres1 <= 0) && m_i == 1) && p_dw_st == 0) && 0 <= __retres1) && c_dr_pc == 0) && c_last_read == p_last_write) && \result <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || (((((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && __retres1 <= 0) && m_i == 1) && p_dw_st == 0) && 0 <= __retres1) && c_dr_pc == 0) && c_last_read == p_last_write) && \result <= 0) && 0 <= \result)) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(T1_E == M_E)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && (((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(E_1 == 1)) || (((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_last_read == p_last_write)) || (((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(m_st == 0)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || (((((m_st == \old(m_st) && __retres1 <= 0) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || E_1 == 0) || !(c_last_read == p_last_write)) [2022-12-13 21:22:19,672 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(2 <= \old(p_dw_st)) || !(M_E == 2)) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == p_num_write)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(q_free == 1)) || !(c_last_read == p_last_write)) && ((((((((((((((!(M_E == 2) || !(p_num_write == 1)) || !(c_dr_pc == 0)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || (((\old(p_dw_st) == p_dw_st && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && 0 <= __retres1)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0))) && (((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write)) [2022-12-13 21:22:19,672 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(2 <= \old(p_dw_st)) || !(M_E == 2)) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == p_num_write)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(q_free == 1)) || !(c_last_read == p_last_write)) && (((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || (((__retres1 <= 0 && \result <= 0) && 0 <= \result) && 0 <= __retres1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((((((((((!(M_E == 2) || !(p_num_write == 1)) || !(c_dr_pc == 0)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || (((((\old(p_dw_st) == p_dw_st && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && \result <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0))) && ((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write)) [2022-12-13 21:22:19,672 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(M_E == 2) || (((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1)) || !(p_num_write == 1)) || !(c_dr_pc == 0)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) && (((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || ((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || (c_dr_st == 2 && (\old(p_dw_st) == p_dw_st || p_dw_st == 0))) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((((((((((!(2 <= \old(p_dw_st)) || !(M_E == 2)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == p_num_write)) || !(E_1 == M_E)) || p_dw_st == 0) || (((\old(p_dw_st) == p_dw_st && tmp <= 0) && c_dr_st == \old(c_dr_st)) && 0 < tmp + 1)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(q_free == 1)) || !(c_last_read == p_last_write)) [2022-12-13 21:22:19,672 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(M_E == 2) || (((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1)) || !(p_num_write == 1)) || !(c_dr_pc == 0)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) && (((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || ((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || (c_dr_st == 2 && (\old(p_dw_st) == p_dw_st || p_dw_st == 0))) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((((((((((!(2 <= \old(p_dw_st)) || !(M_E == 2)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == p_num_write)) || !(E_1 == M_E)) || p_dw_st == 0) || (((\old(p_dw_st) == p_dw_st && tmp <= 0) && c_dr_st == \old(c_dr_st)) && 0 < tmp + 1)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(q_free == 1)) || !(c_last_read == p_last_write)) [2022-12-13 21:22:19,695 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 21:22:19,695 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 21:22:19,695 INFO L158 Benchmark]: Toolchain (without parser) took 255072.53ms. Allocated memory was 134.2MB in the beginning and 1.1GB in the end (delta: 929.0MB). Free memory was 104.0MB in the beginning and 505.1MB in the end (delta: -401.1MB). Peak memory consumption was 530.6MB. Max. memory is 16.1GB. [2022-12-13 21:22:19,695 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 98.6MB. Free memory is still 55.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 21:22:19,696 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.78ms. Allocated memory is still 134.2MB. Free memory was 103.7MB in the beginning and 87.9MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 21:22:19,696 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.72ms. Allocated memory is still 134.2MB. Free memory was 87.9MB in the beginning and 85.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 21:22:19,696 INFO L158 Benchmark]: Boogie Preprocessor took 31.48ms. Allocated memory is still 134.2MB. Free memory was 85.2MB in the beginning and 82.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 21:22:19,696 INFO L158 Benchmark]: RCFGBuilder took 525.11ms. Allocated memory is still 134.2MB. Free memory was 82.7MB in the beginning and 58.5MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-12-13 21:22:19,696 INFO L158 Benchmark]: TraceAbstraction took 254184.26ms. Allocated memory was 134.2MB in the beginning and 1.1GB in the end (delta: 929.0MB). Free memory was 58.0MB in the beginning and 514.7MB in the end (delta: -456.7MB). Peak memory consumption was 620.8MB. Max. memory is 16.1GB. [2022-12-13 21:22:19,696 INFO L158 Benchmark]: Witness Printer took 57.44ms. Allocated memory is still 1.1GB. Free memory was 514.7MB in the beginning and 505.1MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 21:22:19,697 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 98.6MB. Free memory is still 55.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.78ms. Allocated memory is still 134.2MB. Free memory was 103.7MB in the beginning and 87.9MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.72ms. Allocated memory is still 134.2MB. Free memory was 87.9MB in the beginning and 85.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.48ms. Allocated memory is still 134.2MB. Free memory was 85.2MB in the beginning and 82.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 525.11ms. Allocated memory is still 134.2MB. Free memory was 82.7MB in the beginning and 58.5MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 254184.26ms. Allocated memory was 134.2MB in the beginning and 1.1GB in the end (delta: 929.0MB). Free memory was 58.0MB in the beginning and 514.7MB in the end (delta: -456.7MB). Peak memory consumption was 620.8MB. Max. memory is 16.1GB. * Witness Printer took 57.44ms. Allocated memory is still 1.1GB. Free memory was 514.7MB in the beginning and 505.1MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * 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: 390]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 27]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 179 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 254.1s, OverallIterations: 30, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 14.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 228.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11957 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11655 mSDsluCounter, 17765 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12095 mSDsCounter, 1904 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11025 IncrementalHoareTripleChecker+Invalid, 12929 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1904 mSolverCounterUnsat, 5670 mSDtfsCounter, 11025 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1911 GetRequests, 1582 SyntacticMatches, 0 SemanticMatches, 329 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1106 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7140occurred in iteration=26, InterpolantAutomatonStates: 313, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.0s AutomataMinimizationTime, 30 MinimizatonAttempts, 6991 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 72 LocationsWithAnnotation, 8850 PreInvPairs, 9220 NumberOfFragments, 10317 HoareAnnotationTreeSize, 8850 FomulaSimplifications, 2818 FormulaSimplificationTreeSizeReduction, 214.5s HoareSimplificationTime, 72 FomulaSimplificationsInter, 7608381 FormulaSimplificationTreeSizeReductionInter, 14.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 3523 NumberOfCodeBlocks, 3523 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3620 ConstructedInterpolants, 0 QuantifiedInterpolants, 7035 SizeOfPredicates, 5 NumberOfNonLiveVariables, 3203 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 40 InterpolantComputations, 29 PerfectInterpolantSequences, 1590/1700 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: 454]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && T1_E == M_E) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && token <= local + 1) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && local < token) && M_E == 2) || (((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && T1_E == M_E) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && M_E == 2)) || (((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && M_E == 2) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (((((((((((((((!(2 <= \old(p_dw_st)) || !(M_E == 2)) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == p_num_write)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(q_free == 1)) || !(c_last_read == p_last_write)) && (((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || (((__retres1 <= 0 && \result <= 0) && 0 <= \result) && 0 <= __retres1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((((((((((!(M_E == 2) || !(p_num_write == 1)) || !(c_dr_pc == 0)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || (((((\old(p_dw_st) == p_dw_st && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && \result <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0))) && ((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write)) - InvariantResult [Line: 306]: Loop Invariant Derived loop invariant: ((((((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && E_M == M_E) && M_E == 2) || ((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2)) || (((((((((((T1_E == M_E && E_1 == M_E) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((T1_E == M_E && E_1 == M_E) && t1_pc == 0) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2) - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 717]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write - InvariantResult [Line: 768]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || (((((m_st == \old(m_st) && __retres1 <= 0) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(T1_E == M_E)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || !(token == local)) && ((((((((((((((((((((((((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && __retres1 <= 0) && m_i == 1) && p_dw_st == 0) && 0 <= __retres1) && c_dr_pc == 0) && c_last_read == p_last_write) && \result <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || (((((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && __retres1 <= 0) && m_i == 1) && p_dw_st == 0) && 0 <= __retres1) && c_dr_pc == 0) && c_last_read == p_last_write) && \result <= 0) && 0 <= \result)) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(T1_E == M_E)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && (((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(E_1 == 1)) || (((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_last_read == p_last_write)) || (((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(m_st == 0)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || (((((m_st == \old(m_st) && __retres1 <= 0) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || E_1 == 0) || !(c_last_read == p_last_write)) - InvariantResult [Line: 783]: Loop Invariant Derived loop invariant: p_dw_st == 0 - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || (((0 <= __retres1 && m_st == \old(m_st)) && t1_st == 0) && __retres1 <= 0)) || !(token == local)) && ((((((((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || E_1 == 0) || !(c_last_read == p_last_write))) && ((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(T1_E == M_E)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && ((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(T1_E == M_E)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || !(token == local)) - InvariantResult [Line: 425]: Loop Invariant Derived loop invariant: ((((((((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && t1_st == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) || ((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && T1_E == M_E) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && M_E == 2) - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: ((((((((((((((((!(M_E == 2) || (((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1)) || !(p_num_write == 1)) || !(c_dr_pc == 0)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) && (((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || ((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || (c_dr_st == 2 && (\old(p_dw_st) == p_dw_st || p_dw_st == 0))) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((((((((((!(2 <= \old(p_dw_st)) || !(M_E == 2)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == p_num_write)) || !(E_1 == M_E)) || p_dw_st == 0) || (((\old(p_dw_st) == p_dw_st && tmp <= 0) && c_dr_st == \old(c_dr_st)) && 0 < tmp + 1)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(q_free == 1)) || !(c_last_read == p_last_write)) - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: ((((((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && E_M == M_E) && M_E == 2) || ((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2)) || (((((((((((T1_E == M_E && E_1 == M_E) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((T1_E == M_E && E_1 == M_E) && t1_pc == 0) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: ((((((((((T1_E == M_E && E_1 == M_E) && t1_pc == 0) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2 - InvariantResult [Line: 439]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && T1_E == M_E) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && token <= local + 1) && q_free == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && local < token) && M_E == 2 - InvariantResult [Line: 469]: Loop Invariant Derived loop invariant: (((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && token <= local + 1) && q_free == 0) && !(E_1 == 1)) && !(E_1 == 0)) && c_last_read == p_last_write) && local < token) && ((((((T1_E == M_E && 1 <= t1_pc) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && M_E == 2) || (((((T1_E == M_E && t1_pc == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && M_E == 2))) || (((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_last_read == p_last_write) && ((((((T1_E == M_E && 1 <= t1_pc) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && M_E == 2) || (((((T1_E == M_E && t1_pc == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && M_E == 2)))) || (((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && 1 <= tmp) && m_pc == 0) && c_last_read == p_last_write) && M_E == 2) && ((((((T1_E == M_E && E_1 == M_E) && t1_pc == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) || (((((T1_E == M_E && 1 <= t1_pc) && E_1 == M_E) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0))) - InvariantResult [Line: 580]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) || ((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && T1_E == M_E) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && token <= local + 1) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && local < token) && M_E == 2)) || (((((((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && t1_st == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2)) || (((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write)) || ((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && T1_E == M_E) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && M_E == 2)) || (((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && M_E == 2) - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 842]: Loop Invariant Derived loop invariant: p_dw_st == 0 - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: (((((((((((((((!(2 <= \old(p_dw_st)) || !(M_E == 2)) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == p_num_write)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(q_free == 1)) || !(c_last_read == p_last_write)) && ((((((((((((((!(M_E == 2) || !(p_num_write == 1)) || !(c_dr_pc == 0)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || (((\old(p_dw_st) == p_dw_st && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && 0 <= __retres1)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0))) && (((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write)) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2) - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && T1_E == M_E) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && t1_st == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && M_E == 2) || (((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && T1_E == M_E) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && M_E == 2)) || (((((((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && t1_st == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || !(token == local)) && ((((((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(T1_E == M_E)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || (((((\result <= 0 && 0 <= __retres1) && m_st == \old(m_st)) && t1_st == 0) && __retres1 <= 0) && 0 <= \result)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(T1_E == M_E)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && (((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || E_1 == 0) || !(c_last_read == p_last_write)) - InvariantResult [Line: 764]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: ((((((((((((((((!(M_E == 2) || (((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1)) || !(p_num_write == 1)) || !(c_dr_pc == 0)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) && (((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || ((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || (c_dr_st == 2 && (\old(p_dw_st) == p_dw_st || p_dw_st == 0))) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((((((((((!(2 <= \old(p_dw_st)) || !(M_E == 2)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == p_num_write)) || !(E_1 == M_E)) || p_dw_st == 0) || (((\old(p_dw_st) == p_dw_st && tmp <= 0) && c_dr_st == \old(c_dr_st)) && 0 < tmp + 1)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(q_free == 1)) || !(c_last_read == p_last_write)) - InvariantResult [Line: 512]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(T1_E == M_E)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || !(token == local)) && (((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && __retres1 <= 0) && m_i == 1) && p_dw_st == 0) && 0 <= __retres1) && c_dr_pc == 0) && M_E == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && __retres1 <= 0) && m_i == 1) && p_dw_st == 0) && 0 <= __retres1) && c_dr_pc == 0) && M_E == 2)) || !(T1_E == M_E)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && (((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(m_st == 0)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && M_E == 2) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || ((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && M_E == 2)) || !(token == local))) && (((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || (((m_st == \old(m_st) && __retres1 <= 0) && t1_st == 0) && 0 <= __retres1)) || !(T1_E == M_E)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || E_1 == 0) || !(c_last_read == p_last_write)) - InvariantResult [Line: 726]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && E_M == M_E) && M_E == 2) || ((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2) - InvariantResult [Line: 557]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || !(m_i == 1)) || m_st == 0) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || 1 <= __retres1) || !(t1_st == 0)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token == local)) && ((((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(2 <= t1_st)) || !(c_dr_pc == 0)) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(T1_E == M_E)) || !(m_st == 0)) || 1 <= __retres1) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && (((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || !(m_i == 1)) || m_st == 0) || E_1 == 1) || !(E_M == M_E)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(T1_E == M_E)) || 1 <= __retres1) || !(t1_st == 0)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(2 <= t1_st)) || !(c_dr_pc == 0)) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || 1 <= __retres1) || !(c_last_read == p_last_write))) && ((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || 1 <= __retres1) || !(t1_st == 0)) || !(c_last_read == p_last_write)) || !(token == local)) - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && T1_E == M_E) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && M_E == 2 - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2) || ((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2)) || (((((((((((T1_E == M_E && E_1 == M_E) && t1_pc == 0) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && t1_st == 0) && c_dr_pc == 0) && m_pc == 0) && E_M == M_E) && M_E == 2) || ((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && M_E == 2) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: ((((((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && E_M == M_E) && M_E == 2) || ((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2)) || (((((((((((T1_E == M_E && E_1 == M_E) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((T1_E == M_E && E_1 == M_E) && t1_pc == 0) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: (((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && m_pc == 0) && E_M == M_E) && M_E == 2) || ((((((((((T1_E == M_E && E_1 == M_E) && t1_pc == 0) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && M_E == 2)) || ((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2)) || ((((((((((T1_E == M_E && E_1 == M_E) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && M_E == 2) - InvariantResult [Line: 754]: Loop Invariant Derived loop invariant: (((((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2 - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: ((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2 - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 574]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write - InvariantResult [Line: 255]: Loop Invariant Derived loop invariant: ((((((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && E_M == M_E) && M_E == 2) || ((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2)) || (((((((((((T1_E == M_E && E_1 == M_E) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((T1_E == M_E && E_1 == M_E) && t1_pc == 0) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2) - InvariantResult [Line: 231]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 536]: Loop Invariant Derived loop invariant: (((((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2 - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (((((((((((T1_E == M_E && E_1 == M_E) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2) || (((((((((((T1_E == M_E && E_1 == M_E) && t1_pc == 0) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2) - InvariantResult [Line: 302]: Loop Invariant Derived loop invariant: ((((((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && E_M == M_E) && M_E == 2) || ((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2)) || (((((((((((T1_E == M_E && E_1 == M_E) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((T1_E == M_E && E_1 == M_E) && t1_pc == 0) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2) - InvariantResult [Line: 798]: Loop Invariant Derived loop invariant: ((((((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) || (((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) RESULT: Ultimate proved your program to be correct! [2022-12-13 21:22:19,730 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48cd7b1-9592-4e67-8569-5fdb8afa0b6d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE