./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9659cf30-d81b-4332-9231-a3f9d8f917d4/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9659cf30-d81b-4332-9231-a3f9d8f917d4/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_9659cf30-d81b-4332-9231-a3f9d8f917d4/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9659cf30-d81b-4332-9231-a3f9d8f917d4/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9659cf30-d81b-4332-9231-a3f9d8f917d4/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_9659cf30-d81b-4332-9231-a3f9d8f917d4/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 677126e8d6773c92cc337bfe0a3ec155f49f784424155f33a8c9c24ee0a42113 --- 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 13:40:03,635 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:40:03,636 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:40:03,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:40:03,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:40:03,651 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:40:03,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:40:03,652 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:40:03,654 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:40:03,654 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:40:03,655 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:40:03,656 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:40:03,656 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:40:03,657 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:40:03,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:40:03,658 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:40:03,659 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:40:03,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:40:03,661 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:40:03,662 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:40:03,663 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:40:03,664 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:40:03,665 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:40:03,665 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:40:03,668 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:40:03,668 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:40:03,668 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:40:03,669 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:40:03,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:40:03,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:40:03,670 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:40:03,671 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:40:03,671 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:40:03,672 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:40:03,672 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:40:03,672 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:40:03,673 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:40:03,673 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:40:03,673 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:40:03,674 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:40:03,674 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:40:03,675 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9659cf30-d81b-4332-9231-a3f9d8f917d4/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 13:40:03,690 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:40:03,690 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:40:03,691 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 13:40:03,691 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 13:40:03,691 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 13:40:03,691 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 13:40:03,692 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:40:03,692 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:40:03,692 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:40:03,692 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:40:03,693 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:40:03,693 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:40:03,693 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:40:03,693 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:40:03,693 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 13:40:03,693 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:40:03,694 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 13:40:03,694 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:40:03,694 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:40:03,694 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:40:03,694 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 13:40:03,694 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:40:03,695 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:40:03,695 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:40:03,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:40:03,695 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:40:03,695 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:40:03,695 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 13:40:03,695 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:40:03,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:40:03,696 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 13:40:03,696 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 13:40:03,696 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 13:40:03,696 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 13:40:03,696 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 13:40:03,696 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_9659cf30-d81b-4332-9231-a3f9d8f917d4/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_9659cf30-d81b-4332-9231-a3f9d8f917d4/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 -> 677126e8d6773c92cc337bfe0a3ec155f49f784424155f33a8c9c24ee0a42113 [2022-12-13 13:40:03,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:40:03,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:40:03,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:40:03,878 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:40:03,879 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:40:03,880 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9659cf30-d81b-4332-9231-a3f9d8f917d4/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2022-12-13 13:40:06,438 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:40:06,564 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:40:06,564 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9659cf30-d81b-4332-9231-a3f9d8f917d4/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2022-12-13 13:40:06,570 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9659cf30-d81b-4332-9231-a3f9d8f917d4/bin/uautomizer-uyxdKDjOR8/data/95dbb8d42/52c9ac6d3a27447e84cfc0d17424a39d/FLAG645a20551 [2022-12-13 13:40:06,580 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9659cf30-d81b-4332-9231-a3f9d8f917d4/bin/uautomizer-uyxdKDjOR8/data/95dbb8d42/52c9ac6d3a27447e84cfc0d17424a39d [2022-12-13 13:40:06,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:40:06,583 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 13:40:06,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:40:06,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:40:06,587 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:40:06,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:40:06" (1/1) ... [2022-12-13 13:40:06,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cf8d0e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:06, skipping insertion in model container [2022-12-13 13:40:06,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:40:06" (1/1) ... [2022-12-13 13:40:06,594 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:40:06,615 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:40:06,713 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_9659cf30-d81b-4332-9231-a3f9d8f917d4/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c[640,653] [2022-12-13 13:40:06,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:40:06,762 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:40:06,770 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_9659cf30-d81b-4332-9231-a3f9d8f917d4/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c[640,653] [2022-12-13 13:40:06,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:40:06,799 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:40:06,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:06 WrapperNode [2022-12-13 13:40:06,799 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:40:06,800 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:40:06,800 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:40:06,800 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:40:06,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:06" (1/1) ... [2022-12-13 13:40:06,812 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:06" (1/1) ... [2022-12-13 13:40:06,832 INFO L138 Inliner]: procedures = 31, calls = 35, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 225 [2022-12-13 13:40:06,832 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:40:06,833 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:40:06,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:40:06,834 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:40:06,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:06" (1/1) ... [2022-12-13 13:40:06,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:06" (1/1) ... [2022-12-13 13:40:06,846 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:06" (1/1) ... [2022-12-13 13:40:06,846 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:06" (1/1) ... [2022-12-13 13:40:06,852 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:06" (1/1) ... [2022-12-13 13:40:06,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:06" (1/1) ... [2022-12-13 13:40:06,861 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:06" (1/1) ... [2022-12-13 13:40:06,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:06" (1/1) ... [2022-12-13 13:40:06,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:40:06,867 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:40:06,867 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:40:06,867 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:40:06,868 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:06" (1/1) ... [2022-12-13 13:40:06,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:40:06,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9659cf30-d81b-4332-9231-a3f9d8f917d4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:40:06,894 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9659cf30-d81b-4332-9231-a3f9d8f917d4/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 13:40:06,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9659cf30-d81b-4332-9231-a3f9d8f917d4/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 13:40:06,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:40:06,936 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-12-13 13:40:06,936 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-12-13 13:40:06,936 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-12-13 13:40:06,936 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-12-13 13:40:06,936 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-12-13 13:40:06,936 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-12-13 13:40:06,936 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-12-13 13:40:06,936 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-12-13 13:40:06,937 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-12-13 13:40:06,937 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-12-13 13:40:06,937 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-12-13 13:40:06,937 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-12-13 13:40:06,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:40:06,937 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-12-13 13:40:06,937 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-12-13 13:40:06,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:40:06,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:40:06,937 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-12-13 13:40:06,938 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-12-13 13:40:07,005 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 13:40:07,007 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:40:07,290 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##54: assume !(1 == ~q_free~0); [2022-12-13 13:40:07,290 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##53: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2022-12-13 13:40:07,305 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 13:40:07,313 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:40:07,313 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 13:40:07,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:40:07 BoogieIcfgContainer [2022-12-13 13:40:07,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:40:07,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:40:07,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:40:07,321 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:40:07,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:40:06" (1/3) ... [2022-12-13 13:40:07,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1832b4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:40:07, skipping insertion in model container [2022-12-13 13:40:07,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:06" (2/3) ... [2022-12-13 13:40:07,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1832b4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:40:07, skipping insertion in model container [2022-12-13 13:40:07,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:40:07" (3/3) ... [2022-12-13 13:40:07,324 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil.c [2022-12-13 13:40:07,343 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:40:07,343 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 13:40:07,392 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:40:07,399 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;@1c0c7c44, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 13:40:07,399 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 13:40:07,403 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 93 states have (on average 1.5268817204301075) internal successors, (142), 97 states have internal predecessors, (142), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 13:40:07,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-12-13 13:40:07,413 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:40:07,413 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:40:07,414 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:40:07,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:07,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1330697302, now seen corresponding path program 1 times [2022-12-13 13:40:07,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:07,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637791174] [2022-12-13 13:40:07,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:07,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:07,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 13:40:07,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:07,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 13:40:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:07,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 13:40:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:07,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:40:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:07,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 13:40:07,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:07,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 13:40:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:07,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-12-13 13:40:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:07,855 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 13:40:07,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:07,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637791174] [2022-12-13 13:40:07,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637791174] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:40:07,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:40:07,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 13:40:07,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971161293] [2022-12-13 13:40:07,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:40:07,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:40:07,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:07,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:40:07,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:40:07,890 INFO L87 Difference]: Start difference. First operand has 119 states, 93 states have (on average 1.5268817204301075) internal successors, (142), 97 states have internal predecessors, (142), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 13:40:08,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:40:08,553 INFO L93 Difference]: Finished difference Result 382 states and 574 transitions. [2022-12-13 13:40:08,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 13:40:08,555 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2022-12-13 13:40:08,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:40:08,564 INFO L225 Difference]: With dead ends: 382 [2022-12-13 13:40:08,564 INFO L226 Difference]: Without dead ends: 264 [2022-12-13 13:40:08,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-12-13 13:40:08,569 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 379 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 13:40:08,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 544 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 13:40:08,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-12-13 13:40:08,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 225. [2022-12-13 13:40:08,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 179 states have (on average 1.4245810055865922) internal successors, (255), 183 states have internal predecessors, (255), 29 states have call successors, (29), 15 states have call predecessors, (29), 16 states have return successors, (32), 28 states have call predecessors, (32), 27 states have call successors, (32) [2022-12-13 13:40:08,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 316 transitions. [2022-12-13 13:40:08,635 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 316 transitions. Word has length 64 [2022-12-13 13:40:08,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:40:08,635 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 316 transitions. [2022-12-13 13:40:08,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 13:40:08,636 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 316 transitions. [2022-12-13 13:40:08,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-12-13 13:40:08,639 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:40:08,639 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:40:08,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:40:08,639 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:40:08,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:08,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1285381354, now seen corresponding path program 1 times [2022-12-13 13:40:08,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:08,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262785065] [2022-12-13 13:40:08,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:08,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:08,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 13:40:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:08,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 13:40:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:08,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 13:40:08,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:08,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:40:08,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:08,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 13:40:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:08,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 13:40:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:08,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-12-13 13:40:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:08,787 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 13:40:08,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:08,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262785065] [2022-12-13 13:40:08,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262785065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:40:08,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:40:08,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 13:40:08,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037408181] [2022-12-13 13:40:08,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:40:08,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:40:08,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:08,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:40:08,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:40:08,791 INFO L87 Difference]: Start difference. First operand 225 states and 316 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 13:40:09,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:40:09,405 INFO L93 Difference]: Finished difference Result 622 states and 882 transitions. [2022-12-13 13:40:09,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 13:40:09,406 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2022-12-13 13:40:09,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:40:09,410 INFO L225 Difference]: With dead ends: 622 [2022-12-13 13:40:09,410 INFO L226 Difference]: Without dead ends: 413 [2022-12-13 13:40:09,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-12-13 13:40:09,412 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 457 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 13:40:09,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 750 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 13:40:09,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-12-13 13:40:09,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 337. [2022-12-13 13:40:09,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 269 states have (on average 1.41635687732342) internal successors, (381), 275 states have internal predecessors, (381), 42 states have call successors, (42), 22 states have call predecessors, (42), 25 states have return successors, (53), 42 states have call predecessors, (53), 40 states have call successors, (53) [2022-12-13 13:40:09,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 476 transitions. [2022-12-13 13:40:09,460 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 476 transitions. Word has length 64 [2022-12-13 13:40:09,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:40:09,460 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 476 transitions. [2022-12-13 13:40:09,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 13:40:09,461 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 476 transitions. [2022-12-13 13:40:09,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-12-13 13:40:09,462 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:40:09,463 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:40:09,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:40:09,463 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:40:09,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:09,463 INFO L85 PathProgramCache]: Analyzing trace with hash 980999832, now seen corresponding path program 1 times [2022-12-13 13:40:09,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:09,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181200410] [2022-12-13 13:40:09,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:09,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:09,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 13:40:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:09,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 13:40:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:09,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 13:40:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:09,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:40:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:09,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 13:40:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:09,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 13:40:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:09,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-12-13 13:40:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:09,594 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 13:40:09,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:09,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181200410] [2022-12-13 13:40:09,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181200410] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:40:09,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:40:09,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 13:40:09,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517581687] [2022-12-13 13:40:09,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:40:09,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:40:09,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:09,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:40:09,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:40:09,597 INFO L87 Difference]: Start difference. First operand 337 states and 476 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-12-13 13:40:10,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:40:10,897 INFO L93 Difference]: Finished difference Result 1883 states and 2674 transitions. [2022-12-13 13:40:10,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 13:40:10,898 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 64 [2022-12-13 13:40:10,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:40:10,904 INFO L225 Difference]: With dead ends: 1883 [2022-12-13 13:40:10,904 INFO L226 Difference]: Without dead ends: 1550 [2022-12-13 13:40:10,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-12-13 13:40:10,907 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 1663 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1681 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 1907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 13:40:10,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1681 Valid, 1049 Invalid, 1907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 1463 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 13:40:10,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2022-12-13 13:40:10,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1390. [2022-12-13 13:40:10,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1117 states have (on average 1.3652641002685766) internal successors, (1525), 1138 states have internal predecessors, (1525), 152 states have call successors, (152), 105 states have call predecessors, (152), 120 states have return successors, (186), 148 states have call predecessors, (186), 150 states have call successors, (186) [2022-12-13 13:40:11,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1863 transitions. [2022-12-13 13:40:11,003 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1863 transitions. Word has length 64 [2022-12-13 13:40:11,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:40:11,003 INFO L495 AbstractCegarLoop]: Abstraction has 1390 states and 1863 transitions. [2022-12-13 13:40:11,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-12-13 13:40:11,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1863 transitions. [2022-12-13 13:40:11,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 13:40:11,005 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:40:11,006 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:40:11,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 13:40:11,006 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:40:11,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:11,006 INFO L85 PathProgramCache]: Analyzing trace with hash 779831852, now seen corresponding path program 1 times [2022-12-13 13:40:11,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:11,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733991081] [2022-12-13 13:40:11,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:11,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:11,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 13:40:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:11,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 13:40:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:11,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 13:40:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:11,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:40:11,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:11,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 13:40:11,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:11,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 13:40:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:11,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 13:40:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:11,144 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 13:40:11,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:11,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733991081] [2022-12-13 13:40:11,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733991081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:40:11,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:40:11,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 13:40:11,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955162039] [2022-12-13 13:40:11,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:40:11,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:40:11,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:11,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:40:11,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:40:11,146 INFO L87 Difference]: Start difference. First operand 1390 states and 1863 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 13:40:11,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:40:11,551 INFO L93 Difference]: Finished difference Result 2918 states and 3942 transitions. [2022-12-13 13:40:11,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:40:11,552 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-12-13 13:40:11,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:40:11,557 INFO L225 Difference]: With dead ends: 2918 [2022-12-13 13:40:11,557 INFO L226 Difference]: Without dead ends: 1538 [2022-12-13 13:40:11,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-12-13 13:40:11,561 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 137 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 13:40:11,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 620 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 13:40:11,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2022-12-13 13:40:11,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1430. [2022-12-13 13:40:11,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1430 states, 1149 states have (on average 1.349869451697128) internal successors, (1551), 1170 states have internal predecessors, (1551), 152 states have call successors, (152), 105 states have call predecessors, (152), 128 states have return successors, (194), 156 states have call predecessors, (194), 150 states have call successors, (194) [2022-12-13 13:40:11,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 1897 transitions. [2022-12-13 13:40:11,639 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 1897 transitions. Word has length 65 [2022-12-13 13:40:11,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:40:11,640 INFO L495 AbstractCegarLoop]: Abstraction has 1430 states and 1897 transitions. [2022-12-13 13:40:11,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 13:40:11,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 1897 transitions. [2022-12-13 13:40:11,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 13:40:11,641 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:40:11,641 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:40:11,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 13:40:11,642 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:40:11,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:11,642 INFO L85 PathProgramCache]: Analyzing trace with hash -249527446, now seen corresponding path program 1 times [2022-12-13 13:40:11,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:11,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346319190] [2022-12-13 13:40:11,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:11,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:11,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 13:40:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:11,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 13:40:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:11,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 13:40:11,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:11,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:40:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:11,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 13:40:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:11,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 13:40:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:11,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 13:40:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:11,753 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 13:40:11,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:11,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346319190] [2022-12-13 13:40:11,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346319190] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:40:11,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:40:11,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 13:40:11,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727205504] [2022-12-13 13:40:11,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:40:11,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:40:11,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:11,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:40:11,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:40:11,756 INFO L87 Difference]: Start difference. First operand 1430 states and 1897 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-13 13:40:13,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:40:13,122 INFO L93 Difference]: Finished difference Result 5002 states and 6771 transitions. [2022-12-13 13:40:13,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 13:40:13,122 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2022-12-13 13:40:13,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:40:13,130 INFO L225 Difference]: With dead ends: 5002 [2022-12-13 13:40:13,130 INFO L226 Difference]: Without dead ends: 1821 [2022-12-13 13:40:13,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-12-13 13:40:13,138 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 1565 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1490 mSolverCounterSat, 397 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1583 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 1887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 397 IncrementalHoareTripleChecker+Valid, 1490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 13:40:13,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1583 Valid, 1231 Invalid, 1887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [397 Valid, 1490 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 13:40:13,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2022-12-13 13:40:13,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1641. [2022-12-13 13:40:13,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1641 states, 1288 states have (on average 1.3020186335403727) internal successors, (1677), 1311 states have internal predecessors, (1677), 192 states have call successors, (192), 133 states have call predecessors, (192), 160 states have return successors, (240), 198 states have call predecessors, (240), 190 states have call successors, (240) [2022-12-13 13:40:13,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2109 transitions. [2022-12-13 13:40:13,255 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2109 transitions. Word has length 65 [2022-12-13 13:40:13,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:40:13,255 INFO L495 AbstractCegarLoop]: Abstraction has 1641 states and 2109 transitions. [2022-12-13 13:40:13,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-13 13:40:13,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2109 transitions. [2022-12-13 13:40:13,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-12-13 13:40:13,257 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:40:13,257 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 13:40:13,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 13:40:13,257 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:40:13,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:13,257 INFO L85 PathProgramCache]: Analyzing trace with hash -31264562, now seen corresponding path program 1 times [2022-12-13 13:40:13,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:13,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244406356] [2022-12-13 13:40:13,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:13,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:13,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 13:40:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:13,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 13:40:13,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:13,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 13:40:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:13,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:40:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:13,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 13:40:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:13,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 13:40:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:13,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 13:40:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:13,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 13:40:13,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:13,372 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 13:40:13,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:13,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244406356] [2022-12-13 13:40:13,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244406356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:40:13,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:40:13,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 13:40:13,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576054717] [2022-12-13 13:40:13,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:40:13,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:40:13,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:13,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:40:13,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:40:13,374 INFO L87 Difference]: Start difference. First operand 1641 states and 2109 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 13:40:13,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:40:13,792 INFO L93 Difference]: Finished difference Result 3466 states and 4511 transitions. [2022-12-13 13:40:13,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 13:40:13,792 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 90 [2022-12-13 13:40:13,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:40:13,797 INFO L225 Difference]: With dead ends: 3466 [2022-12-13 13:40:13,798 INFO L226 Difference]: Without dead ends: 1835 [2022-12-13 13:40:13,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-12-13 13:40:13,801 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 192 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 13:40:13,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 512 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 13:40:13,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2022-12-13 13:40:13,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1701. [2022-12-13 13:40:13,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1336 states have (on average 1.2866766467065869) internal successors, (1719), 1359 states have internal predecessors, (1719), 192 states have call successors, (192), 133 states have call predecessors, (192), 172 states have return successors, (252), 210 states have call predecessors, (252), 190 states have call successors, (252) [2022-12-13 13:40:13,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2163 transitions. [2022-12-13 13:40:13,879 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 2163 transitions. Word has length 90 [2022-12-13 13:40:13,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:40:13,880 INFO L495 AbstractCegarLoop]: Abstraction has 1701 states and 2163 transitions. [2022-12-13 13:40:13,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 13:40:13,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2163 transitions. [2022-12-13 13:40:13,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-12-13 13:40:13,881 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:40:13,881 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 13:40:13,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 13:40:13,881 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:40:13,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:13,881 INFO L85 PathProgramCache]: Analyzing trace with hash 412636112, now seen corresponding path program 1 times [2022-12-13 13:40:13,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:13,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162937405] [2022-12-13 13:40:13,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:13,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:13,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 13:40:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:13,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 13:40:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:13,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 13:40:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:13,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:40:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:13,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 13:40:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:13,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 13:40:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:13,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 13:40:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:13,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 13:40:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:14,001 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 13:40:14,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:14,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162937405] [2022-12-13 13:40:14,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162937405] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:40:14,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:40:14,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 13:40:14,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777124949] [2022-12-13 13:40:14,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:40:14,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:40:14,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:14,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:40:14,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:40:14,004 INFO L87 Difference]: Start difference. First operand 1701 states and 2163 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 13:40:14,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:40:14,612 INFO L93 Difference]: Finished difference Result 3228 states and 4127 transitions. [2022-12-13 13:40:14,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 13:40:14,613 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 90 [2022-12-13 13:40:14,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:40:14,618 INFO L225 Difference]: With dead ends: 3228 [2022-12-13 13:40:14,618 INFO L226 Difference]: Without dead ends: 1775 [2022-12-13 13:40:14,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-12-13 13:40:14,620 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 370 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 13:40:14,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 571 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 13:40:14,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2022-12-13 13:40:14,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1480. [2022-12-13 13:40:14,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1168 states have (on average 1.2851027397260273) internal successors, (1501), 1186 states have internal predecessors, (1501), 164 states have call successors, (164), 114 states have call predecessors, (164), 147 states have return successors, (212), 180 states have call predecessors, (212), 162 states have call successors, (212) [2022-12-13 13:40:14,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 1877 transitions. [2022-12-13 13:40:14,682 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 1877 transitions. Word has length 90 [2022-12-13 13:40:14,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:40:14,682 INFO L495 AbstractCegarLoop]: Abstraction has 1480 states and 1877 transitions. [2022-12-13 13:40:14,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 13:40:14,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1877 transitions. [2022-12-13 13:40:14,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-12-13 13:40:14,683 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:40:14,683 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 13:40:14,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 13:40:14,683 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:40:14,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:14,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1943169138, now seen corresponding path program 1 times [2022-12-13 13:40:14,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:14,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214271730] [2022-12-13 13:40:14,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:14,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:14,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 13:40:14,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:14,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 13:40:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:14,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 13:40:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:14,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:40:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:14,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 13:40:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:14,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 13:40:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:14,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 13:40:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:14,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 13:40:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:14,764 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 13:40:14,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:14,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214271730] [2022-12-13 13:40:14,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214271730] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:40:14,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:40:14,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 13:40:14,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630205731] [2022-12-13 13:40:14,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:40:14,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:40:14,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:14,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:40:14,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:40:14,766 INFO L87 Difference]: Start difference. First operand 1480 states and 1877 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-13 13:40:15,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:40:15,219 INFO L93 Difference]: Finished difference Result 4632 states and 5989 transitions. [2022-12-13 13:40:15,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 13:40:15,220 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 90 [2022-12-13 13:40:15,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:40:15,233 INFO L225 Difference]: With dead ends: 4632 [2022-12-13 13:40:15,233 INFO L226 Difference]: Without dead ends: 3163 [2022-12-13 13:40:15,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-12-13 13:40:15,237 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 371 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 13:40:15,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 425 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 13:40:15,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3163 states. [2022-12-13 13:40:15,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3163 to 2949. [2022-12-13 13:40:15,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2949 states, 2317 states have (on average 1.2641346568839016) internal successors, (2929), 2364 states have internal predecessors, (2929), 325 states have call successors, (325), 227 states have call predecessors, (325), 306 states have return successors, (495), 359 states have call predecessors, (495), 323 states have call successors, (495) [2022-12-13 13:40:15,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 3749 transitions. [2022-12-13 13:40:15,410 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 3749 transitions. Word has length 90 [2022-12-13 13:40:15,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:40:15,411 INFO L495 AbstractCegarLoop]: Abstraction has 2949 states and 3749 transitions. [2022-12-13 13:40:15,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-13 13:40:15,411 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 3749 transitions. [2022-12-13 13:40:15,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-12-13 13:40:15,412 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:40:15,412 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 13:40:15,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 13:40:15,412 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:40:15,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:15,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1293960080, now seen corresponding path program 1 times [2022-12-13 13:40:15,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:15,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077073433] [2022-12-13 13:40:15,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:15,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:15,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 13:40:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:15,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 13:40:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:15,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 13:40:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:15,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:40:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:15,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 13:40:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:15,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 13:40:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:15,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 13:40:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:15,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 13:40:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:15,460 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 13:40:15,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:15,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077073433] [2022-12-13 13:40:15,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077073433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:40:15,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:40:15,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:40:15,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849465078] [2022-12-13 13:40:15,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:40:15,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:40:15,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:15,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:40:15,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:40:15,462 INFO L87 Difference]: Start difference. First operand 2949 states and 3749 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 13:40:15,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:40:15,699 INFO L93 Difference]: Finished difference Result 4533 states and 5733 transitions. [2022-12-13 13:40:15,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:40:15,700 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 90 [2022-12-13 13:40:15,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:40:15,707 INFO L225 Difference]: With dead ends: 4533 [2022-12-13 13:40:15,707 INFO L226 Difference]: Without dead ends: 1595 [2022-12-13 13:40:15,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:40:15,713 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 294 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:40:15,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 194 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:40:15,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2022-12-13 13:40:15,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1480. [2022-12-13 13:40:15,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1168 states have (on average 1.2534246575342465) internal successors, (1464), 1186 states have internal predecessors, (1464), 164 states have call successors, (164), 114 states have call predecessors, (164), 147 states have return successors, (212), 180 states have call predecessors, (212), 162 states have call successors, (212) [2022-12-13 13:40:15,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 1840 transitions. [2022-12-13 13:40:15,789 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 1840 transitions. Word has length 90 [2022-12-13 13:40:15,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:40:15,789 INFO L495 AbstractCegarLoop]: Abstraction has 1480 states and 1840 transitions. [2022-12-13 13:40:15,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 13:40:15,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1840 transitions. [2022-12-13 13:40:15,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-13 13:40:15,790 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:40:15,790 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 13:40:15,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 13:40:15,790 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:40:15,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:15,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1668589887, now seen corresponding path program 1 times [2022-12-13 13:40:15,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:15,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948535165] [2022-12-13 13:40:15,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:15,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:15,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 13:40:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:15,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 13:40:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:15,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 13:40:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:15,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:40:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:15,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 13:40:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:15,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 13:40:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:15,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 13:40:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:15,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 13:40:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:15,879 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 13:40:15,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:15,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948535165] [2022-12-13 13:40:15,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948535165] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:40:15,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:40:15,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 13:40:15,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136381694] [2022-12-13 13:40:15,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:40:15,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:40:15,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:15,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:40:15,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:40:15,881 INFO L87 Difference]: Start difference. First operand 1480 states and 1840 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 13:40:16,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:40:16,651 INFO L93 Difference]: Finished difference Result 3898 states and 4923 transitions. [2022-12-13 13:40:16,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 13:40:16,651 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 91 [2022-12-13 13:40:16,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:40:16,657 INFO L225 Difference]: With dead ends: 3898 [2022-12-13 13:40:16,657 INFO L226 Difference]: Without dead ends: 2278 [2022-12-13 13:40:16,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2022-12-13 13:40:16,660 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 1335 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1353 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 13:40:16,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1353 Valid, 509 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [436 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 13:40:16,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2022-12-13 13:40:16,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 2101. [2022-12-13 13:40:16,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2101 states, 1635 states have (on average 1.2269113149847095) internal successors, (2006), 1661 states have internal predecessors, (2006), 241 states have call successors, (241), 162 states have call predecessors, (241), 224 states have return successors, (343), 278 states have call predecessors, (343), 239 states have call successors, (343) [2022-12-13 13:40:16,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2590 transitions. [2022-12-13 13:40:16,761 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2590 transitions. Word has length 91 [2022-12-13 13:40:16,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:40:16,762 INFO L495 AbstractCegarLoop]: Abstraction has 2101 states and 2590 transitions. [2022-12-13 13:40:16,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 13:40:16,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2590 transitions. [2022-12-13 13:40:16,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-12-13 13:40:16,763 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:40:16,763 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 13:40:16,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 13:40:16,763 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:40:16,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:16,764 INFO L85 PathProgramCache]: Analyzing trace with hash -633049043, now seen corresponding path program 1 times [2022-12-13 13:40:16,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:16,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104575601] [2022-12-13 13:40:16,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:16,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:16,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 13:40:16,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:16,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 13:40:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:16,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 13:40:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:16,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:40:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:16,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 13:40:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:16,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 13:40:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:16,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 13:40:16,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:16,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 13:40:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:16,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 13:40:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:16,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-12-13 13:40:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:16,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 13:40:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:16,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:40:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:16,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 13:40:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:16,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-12-13 13:40:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:16,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-12-13 13:40:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:16,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 13:40:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:16,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-12-13 13:40:16,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:16,885 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-12-13 13:40:16,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:16,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104575601] [2022-12-13 13:40:16,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104575601] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:40:16,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696939441] [2022-12-13 13:40:16,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:16,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:40:16,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9659cf30-d81b-4332-9231-a3f9d8f917d4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:40:16,886 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9659cf30-d81b-4332-9231-a3f9d8f917d4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:40:16,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9659cf30-d81b-4332-9231-a3f9d8f917d4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 13:40:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:16,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 13:40:16,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:40:17,082 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-12-13 13:40:17,082 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:40:17,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696939441] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:40:17,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:40:17,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-12-13 13:40:17,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966116143] [2022-12-13 13:40:17,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:40:17,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:40:17,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:17,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:40:17,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 13:40:17,084 INFO L87 Difference]: Start difference. First operand 2101 states and 2590 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-12-13 13:40:17,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:40:17,308 INFO L93 Difference]: Finished difference Result 6027 states and 7419 transitions. [2022-12-13 13:40:17,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:40:17,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 162 [2022-12-13 13:40:17,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:40:17,323 INFO L225 Difference]: With dead ends: 6027 [2022-12-13 13:40:17,323 INFO L226 Difference]: Without dead ends: 4013 [2022-12-13 13:40:17,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 13:40:17,328 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 61 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:40:17,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 281 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:40:17,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4013 states. [2022-12-13 13:40:17,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4013 to 3971. [2022-12-13 13:40:17,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3971 states, 3092 states have (on average 1.2160413971539457) internal successors, (3760), 3141 states have internal predecessors, (3760), 448 states have call successors, (448), 323 states have call predecessors, (448), 430 states have return successors, (611), 507 states have call predecessors, (611), 446 states have call successors, (611) [2022-12-13 13:40:17,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 4819 transitions. [2022-12-13 13:40:17,686 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 4819 transitions. Word has length 162 [2022-12-13 13:40:17,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:40:17,686 INFO L495 AbstractCegarLoop]: Abstraction has 3971 states and 4819 transitions. [2022-12-13 13:40:17,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-12-13 13:40:17,687 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 4819 transitions. [2022-12-13 13:40:17,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-12-13 13:40:17,689 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:40:17,690 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:40:17,695 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9659cf30-d81b-4332-9231-a3f9d8f917d4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 13:40:17,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9659cf30-d81b-4332-9231-a3f9d8f917d4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:40:17,890 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:40:17,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:17,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1912569076, now seen corresponding path program 1 times [2022-12-13 13:40:17,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:17,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496736101] [2022-12-13 13:40:17,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:17,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:17,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 13:40:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:18,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 13:40:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:18,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 13:40:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:18,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:40:18,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:18,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 13:40:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:18,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 13:40:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:18,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 13:40:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:18,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 13:40:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:18,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 13:40:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:18,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-12-13 13:40:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:18,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 13:40:18,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:18,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:40:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:18,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:40:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:18,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-12-13 13:40:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:18,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 13:40:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:18,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-12-13 13:40:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:18,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:40:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:18,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 13:40:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:18,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-12-13 13:40:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:18,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-12-13 13:40:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:18,069 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-12-13 13:40:18,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:18,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496736101] [2022-12-13 13:40:18,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496736101] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:40:18,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75354883] [2022-12-13 13:40:18,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:18,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:40:18,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9659cf30-d81b-4332-9231-a3f9d8f917d4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:40:18,070 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9659cf30-d81b-4332-9231-a3f9d8f917d4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:40:18,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9659cf30-d81b-4332-9231-a3f9d8f917d4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 13:40:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:18,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 13:40:18,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:40:18,319 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-12-13 13:40:18,319 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:40:18,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75354883] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:40:18,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:40:18,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-12-13 13:40:18,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112956839] [2022-12-13 13:40:18,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:40:18,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:40:18,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:18,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:40:18,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 13:40:18,321 INFO L87 Difference]: Start difference. First operand 3971 states and 4819 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 13:40:18,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:40:18,806 INFO L93 Difference]: Finished difference Result 11891 states and 14427 transitions. [2022-12-13 13:40:18,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:40:18,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 194 [2022-12-13 13:40:18,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:40:18,825 INFO L225 Difference]: With dead ends: 11891 [2022-12-13 13:40:18,825 INFO L226 Difference]: Without dead ends: 7931 [2022-12-13 13:40:18,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 13:40:18,835 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 52 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:40:18,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 281 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:40:18,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7931 states. [2022-12-13 13:40:19,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7931 to 7921. [2022-12-13 13:40:19,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7921 states, 6170 states have (on average 1.2092382495948135) internal successors, (7461), 6266 states have internal predecessors, (7461), 890 states have call successors, (890), 645 states have call predecessors, (890), 860 states have return successors, (1218), 1010 states have call predecessors, (1218), 888 states have call successors, (1218) [2022-12-13 13:40:19,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7921 states to 7921 states and 9569 transitions. [2022-12-13 13:40:19,322 INFO L78 Accepts]: Start accepts. Automaton has 7921 states and 9569 transitions. Word has length 194 [2022-12-13 13:40:19,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:40:19,322 INFO L495 AbstractCegarLoop]: Abstraction has 7921 states and 9569 transitions. [2022-12-13 13:40:19,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 13:40:19,322 INFO L276 IsEmpty]: Start isEmpty. Operand 7921 states and 9569 transitions. [2022-12-13 13:40:19,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-12-13 13:40:19,325 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:40:19,325 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:40:19,329 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9659cf30-d81b-4332-9231-a3f9d8f917d4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 13:40:19,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9659cf30-d81b-4332-9231-a3f9d8f917d4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:40:19,526 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:40:19,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:19,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1015175798, now seen corresponding path program 1 times [2022-12-13 13:40:19,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:19,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510116253] [2022-12-13 13:40:19,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:19,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:19,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 13:40:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:19,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 13:40:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:19,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 13:40:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:19,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:40:19,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:19,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 13:40:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:19,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 13:40:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:19,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 13:40:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:19,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 13:40:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:19,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 13:40:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:19,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-12-13 13:40:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:19,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 13:40:19,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:19,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:40:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:19,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:40:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:19,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-12-13 13:40:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:19,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 13:40:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:19,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-12-13 13:40:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:19,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:40:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:19,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 13:40:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:19,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-12-13 13:40:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:19,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-12-13 13:40:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:19,649 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-12-13 13:40:19,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:19,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510116253] [2022-12-13 13:40:19,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510116253] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:40:19,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067497609] [2022-12-13 13:40:19,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:19,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:40:19,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9659cf30-d81b-4332-9231-a3f9d8f917d4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:40:19,651 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9659cf30-d81b-4332-9231-a3f9d8f917d4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:40:19,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9659cf30-d81b-4332-9231-a3f9d8f917d4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 13:40:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:19,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 13:40:19,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:40:19,907 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-12-13 13:40:19,907 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:40:19,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067497609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:40:19,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:40:19,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-12-13 13:40:19,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904709687] [2022-12-13 13:40:19,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:40:19,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:40:19,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:19,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:40:19,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 13:40:19,909 INFO L87 Difference]: Start difference. First operand 7921 states and 9569 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-12-13 13:40:20,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:40:20,335 INFO L93 Difference]: Finished difference Result 14427 states and 17761 transitions. [2022-12-13 13:40:20,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:40:20,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 194 [2022-12-13 13:40:20,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:40:20,339 INFO L225 Difference]: With dead ends: 14427 [2022-12-13 13:40:20,339 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 13:40:20,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 13:40:20,356 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:40:20,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 129 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:40:20,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 13:40:20,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 13:40:20,357 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 13:40:20,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 13:40:20,358 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 194 [2022-12-13 13:40:20,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:40:20,358 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 13:40:20,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-12-13 13:40:20,358 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 13:40:20,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 13:40:20,360 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 13:40:20,365 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9659cf30-d81b-4332-9231-a3f9d8f917d4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 13:40:20,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9659cf30-d81b-4332-9231-a3f9d8f917d4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:40:20,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 13:40:56,146 INFO L895 garLoopResultBuilder]: At program point L385(line 385) the Hoare annotation is: (let ((.cse0 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|)))) (and (or (not (<= ~c_dr_pc~0 0)) (not (= |old(~c_dr_st~0)| 0)) .cse0 (not (= 1 ~c_dr_i~0))) (or .cse0 (not (= ~c_dr_pc~0 1))))) [2022-12-13 13:40:56,146 INFO L895 garLoopResultBuilder]: At program point L387-2(lines 387 391) the Hoare annotation is: (let ((.cse2 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse9 (= ~p_dw_st~0 0)) (.cse6 (not (<= ~c_dr_pc~0 0))) (.cse7 (not (= |old(~c_dr_st~0)| 0))) (.cse0 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse1 (< 0 (+ activate_threads_~tmp~1 1))) (.cse3 (<= activate_threads_~tmp~1 0)) (.cse4 (= ~p_dw_pc~0 1)) (.cse5 (not (= ~q_read_ev~0 2))) (.cse10 (not (= 1 ~c_dr_i~0)))) (and (or (and .cse0 .cse1 .cse2 .cse3) .cse4 (not (= ~c_dr_pc~0 1)) .cse5) (let ((.cse8 (= ~c_dr_st~0 0))) (or .cse6 .cse7 (and .cse0 .cse8 .cse2) (and .cse8 .cse2 .cse9) .cse10)) (or .cse6 (not .cse9) .cse7 (= |old(~p_dw_st~0)| 0) (not (<= 2 ~fast_clk_edge~0)) (not .cse4) .cse10) (or .cse6 .cse7 (and .cse0 .cse1 .cse3) .cse4 .cse5 .cse10))) [2022-12-13 13:40:56,147 INFO L899 garLoopResultBuilder]: For program point L385-1(line 385) no Hoare annotation was computed. [2022-12-13 13:40:56,147 INFO L899 garLoopResultBuilder]: For program point L395(lines 395 399) no Hoare annotation was computed. [2022-12-13 13:40:56,147 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 379 403) no Hoare annotation was computed. [2022-12-13 13:40:56,147 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 379 403) the Hoare annotation is: (let ((.cse0 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|)))) (and (or (not (<= ~c_dr_pc~0 0)) (not (= |old(~c_dr_st~0)| 0)) .cse0 (not (= 1 ~c_dr_i~0))) (or .cse0 (not (= ~c_dr_pc~0 1))))) [2022-12-13 13:40:56,147 INFO L899 garLoopResultBuilder]: For program point L393(line 393) no Hoare annotation was computed. [2022-12-13 13:40:56,147 INFO L899 garLoopResultBuilder]: For program point L395-2(lines 379 403) no Hoare annotation was computed. [2022-12-13 13:40:56,147 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 391) no Hoare annotation was computed. [2022-12-13 13:40:56,147 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 287 306) no Hoare annotation was computed. [2022-12-13 13:40:56,147 INFO L902 garLoopResultBuilder]: At program point L303(lines 290 305) the Hoare annotation is: true [2022-12-13 13:40:56,147 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 287 306) the Hoare annotation is: true [2022-12-13 13:40:56,148 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 300) no Hoare annotation was computed. [2022-12-13 13:40:56,148 INFO L899 garLoopResultBuilder]: For program point L291(lines 291 301) no Hoare annotation was computed. [2022-12-13 13:40:56,148 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 287 306) no Hoare annotation was computed. [2022-12-13 13:40:56,148 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 101) no Hoare annotation was computed. [2022-12-13 13:40:56,148 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 104) no Hoare annotation was computed. [2022-12-13 13:40:56,148 INFO L899 garLoopResultBuilder]: For program point L95-2(lines 94 118) no Hoare annotation was computed. [2022-12-13 13:40:56,148 INFO L895 garLoopResultBuilder]: At program point L116(lines 94 118) the Hoare annotation is: (or (not (<= ~c_dr_pc~0 0)) (not (= ~c_dr_st~0 0)) (and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1)) (not (= 1 ~c_dr_i~0))) [2022-12-13 13:40:56,148 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredFINAL(lines 91 119) no Hoare annotation was computed. [2022-12-13 13:40:56,148 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 111) no Hoare annotation was computed. [2022-12-13 13:40:56,148 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 91 119) the Hoare annotation is: true [2022-12-13 13:40:56,148 INFO L899 garLoopResultBuilder]: For program point L105-1(lines 105 114) no Hoare annotation was computed. [2022-12-13 13:40:56,149 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 91 119) no Hoare annotation was computed. [2022-12-13 13:40:56,149 INFO L899 garLoopResultBuilder]: For program point L316-1(lines 307 324) no Hoare annotation was computed. [2022-12-13 13:40:56,149 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 307 324) the Hoare annotation is: (let ((.cse0 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0)))) (and (or .cse0 (not (= ~c_dr_pc~0 1))) (or (not (<= ~c_dr_pc~0 0)) (not (= ~c_dr_st~0 0)) .cse0 (not (= 1 ~c_dr_i~0))))) [2022-12-13 13:40:56,149 INFO L899 garLoopResultBuilder]: For program point L311-1(lines 310 323) no Hoare annotation was computed. [2022-12-13 13:40:56,149 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 307 324) no Hoare annotation was computed. [2022-12-13 13:40:56,149 INFO L899 garLoopResultBuilder]: For program point L258-1(lines 254 268) no Hoare annotation was computed. [2022-12-13 13:40:56,149 INFO L895 garLoopResultBuilder]: At program point update_fifo_q_returnLabel#1(lines 32 51) the Hoare annotation is: (let ((.cse1 (not (= ~c_dr_pc~0 1))) (.cse0 (= ~q_req_up~0 0)) (.cse3 (not (<= ~c_dr_pc~0 0))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse2 (not (= |old(~q_req_up~0)| 0))) (.cse5 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1) (or .cse1 .cse2) (or .cse3 .cse4 .cse0 .cse5) (or .cse3 .cse4 .cse2 .cse5))) [2022-12-13 13:40:56,149 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 254 268) no Hoare annotation was computed. [2022-12-13 13:40:56,150 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 254 268) the Hoare annotation is: (let ((.cse0 (and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|)))) (and (or .cse0 (not (= ~c_dr_pc~0 1))) (or (not (<= ~c_dr_pc~0 0)) .cse0 (not (= ~c_dr_st~0 0)) (not (= 1 ~c_dr_i~0))))) [2022-12-13 13:40:56,150 INFO L899 garLoopResultBuilder]: For program point L41-1(lines 41 45) no Hoare annotation was computed. [2022-12-13 13:40:56,150 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 40) no Hoare annotation was computed. [2022-12-13 13:40:56,150 INFO L899 garLoopResultBuilder]: For program point L36-2(lines 35 50) no Hoare annotation was computed. [2022-12-13 13:40:56,150 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 325 342) no Hoare annotation was computed. [2022-12-13 13:40:56,150 INFO L899 garLoopResultBuilder]: For program point L334-1(lines 325 342) no Hoare annotation was computed. [2022-12-13 13:40:56,150 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 325 342) the Hoare annotation is: (let ((.cse0 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0)))) (and (or .cse0 (not (= ~c_dr_pc~0 1))) (or (not (<= ~c_dr_pc~0 0)) (not (= ~c_dr_st~0 0)) .cse0 (not (= 1 ~c_dr_i~0))))) [2022-12-13 13:40:56,150 INFO L899 garLoopResultBuilder]: For program point L329-1(lines 328 341) no Hoare annotation was computed. [2022-12-13 13:40:56,151 INFO L899 garLoopResultBuilder]: For program point L514-1(line 514) no Hoare annotation was computed. [2022-12-13 13:40:56,151 INFO L899 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2022-12-13 13:40:56,151 INFO L899 garLoopResultBuilder]: For program point L415-1(lines 410 450) no Hoare annotation was computed. [2022-12-13 13:40:56,151 INFO L899 garLoopResultBuilder]: For program point L349(lines 349 356) no Hoare annotation was computed. [2022-12-13 13:40:56,151 INFO L895 garLoopResultBuilder]: At program point L349-2(lines 345 360) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-12-13 13:40:56,151 INFO L899 garLoopResultBuilder]: For program point L465(lines 465 470) no Hoare annotation was computed. [2022-12-13 13:40:56,151 INFO L899 garLoopResultBuilder]: For program point L234(lines 234 246) no Hoare annotation was computed. [2022-12-13 13:40:56,151 INFO L899 garLoopResultBuilder]: For program point L218-1(lines 218 228) no Hoare annotation was computed. [2022-12-13 13:40:56,151 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 160) no Hoare annotation was computed. [2022-12-13 13:40:56,151 INFO L895 garLoopResultBuilder]: At program point do_write_p_returnLabel#1(lines 145 193) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (not (= ~p_dw_st~0 0)) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-12-13 13:40:56,151 INFO L902 garLoopResultBuilder]: At program point start_simulation_returnLabel#1(lines 476 534) the Hoare annotation is: true [2022-12-13 13:40:56,152 INFO L895 garLoopResultBuilder]: At program point L499(line 499) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-12-13 13:40:56,152 INFO L899 garLoopResultBuilder]: For program point L499-1(line 499) no Hoare annotation was computed. [2022-12-13 13:40:56,152 INFO L899 garLoopResultBuilder]: For program point L235(lines 235 241) no Hoare annotation was computed. [2022-12-13 13:40:56,152 INFO L899 garLoopResultBuilder]: For program point L202(lines 202 206) no Hoare annotation was computed. [2022-12-13 13:40:56,152 INFO L895 garLoopResultBuilder]: At program point L484(line 484) the Hoare annotation is: (and (= ~c_dr_st~0 0) (= ~q_write_ev~0 ~q_read_ev~0) (= 1 ~c_dr_i~0) (= ~q_req_up~0 0) (= ~p_dw_st~0 0) (<= 2 ~slow_clk_edge~0) (= ~q_read_ev~0 2) (<= 2 ~fast_clk_edge~0) (= ~q_req_up~0 ~p_dw_pc~0) (= ~c_dr_pc~0 ~q_req_up~0)) [2022-12-13 13:40:56,152 INFO L899 garLoopResultBuilder]: For program point L484-1(line 484) no Hoare annotation was computed. [2022-12-13 13:40:56,152 INFO L895 garLoopResultBuilder]: At program point L435(lines 410 450) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-12-13 13:40:56,152 INFO L895 garLoopResultBuilder]: At program point L171(lines 171 179) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (not (= ~p_dw_st~0 0)) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-12-13 13:40:56,152 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 159) no Hoare annotation was computed. [2022-12-13 13:40:56,152 INFO L895 garLoopResultBuilder]: At program point L370-1(lines 361 378) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-12-13 13:40:56,153 INFO L895 garLoopResultBuilder]: At program point L486(line 486) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse3 (= ~q_req_up~0 0)) (.cse4 (= ~q_read_ev~0 2)) (.cse5 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse6 (= ~c_dr_pc~0 ~q_req_up~0))) (or (and .cse0 (not (= ~p_dw_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~slow_clk_edge~0) .cse4 (<= 2 ~fast_clk_edge~0) .cse5 .cse6))) [2022-12-13 13:40:56,153 INFO L895 garLoopResultBuilder]: At program point L486-1(line 486) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse3 (= ~q_req_up~0 0)) (.cse4 (= ~q_read_ev~0 2)) (.cse5 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse6 (= ~c_dr_pc~0 ~q_req_up~0))) (or (and .cse0 (not (= ~p_dw_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~slow_clk_edge~0) .cse4 (<= 2 ~fast_clk_edge~0) .cse5 .cse6))) [2022-12-13 13:40:56,153 INFO L899 garLoopResultBuilder]: For program point L420(lines 410 450) no Hoare annotation was computed. [2022-12-13 13:40:56,153 INFO L895 garLoopResultBuilder]: At program point do_read_c_DR_WAIT_WRITE#1(lines 198 252) the Hoare annotation is: false [2022-12-13 13:40:56,153 INFO L895 garLoopResultBuilder]: At program point L503(line 503) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-12-13 13:40:56,153 INFO L895 garLoopResultBuilder]: At program point L503-1(line 503) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-12-13 13:40:56,153 INFO L895 garLoopResultBuilder]: At program point L239(line 239) the Hoare annotation is: false [2022-12-13 13:40:56,153 INFO L895 garLoopResultBuilder]: At program point L487(line 487) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse3 (= ~q_req_up~0 0)) (.cse4 (= ~q_read_ev~0 2)) (.cse5 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse6 (= ~c_dr_pc~0 ~q_req_up~0))) (or (and .cse0 (not (= ~p_dw_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~slow_clk_edge~0) .cse4 (<= 2 ~fast_clk_edge~0) .cse5 .cse6))) [2022-12-13 13:40:56,153 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 13:40:56,153 INFO L895 garLoopResultBuilder]: At program point L504(line 504) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-12-13 13:40:56,153 INFO L899 garLoopResultBuilder]: For program point L273(lines 273 277) no Hoare annotation was computed. [2022-12-13 13:40:56,153 INFO L899 garLoopResultBuilder]: For program point L273-2(lines 272 285) no Hoare annotation was computed. [2022-12-13 13:40:56,153 INFO L895 garLoopResultBuilder]: At program point init_model_returnLabel#1(lines 535 553) the Hoare annotation is: (and (= ~c_dr_st~0 0) (= ~q_write_ev~0 ~q_read_ev~0) (= 1 ~c_dr_i~0) (= ~q_req_up~0 0) (= ~p_dw_st~0 0) (<= 2 ~slow_clk_edge~0) (= ~q_read_ev~0 2) (<= 2 ~fast_clk_edge~0) (= ~q_req_up~0 ~p_dw_pc~0) (= ~c_dr_pc~0 ~q_req_up~0)) [2022-12-13 13:40:56,154 INFO L895 garLoopResultBuilder]: At program point L505(line 505) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-12-13 13:40:56,154 INFO L895 garLoopResultBuilder]: At program point L472(lines 461 474) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-12-13 13:40:56,154 INFO L899 garLoopResultBuilder]: For program point L439(lines 439 446) no Hoare annotation was computed. [2022-12-13 13:40:56,154 INFO L899 garLoopResultBuilder]: For program point L523(lines 523 527) no Hoare annotation was computed. [2022-12-13 13:40:56,154 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 554 565) the Hoare annotation is: true [2022-12-13 13:40:56,154 INFO L899 garLoopResultBuilder]: For program point L424(lines 424 431) no Hoare annotation was computed. [2022-12-13 13:40:56,154 INFO L895 garLoopResultBuilder]: At program point $Ultimate##36(lines 171 179) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 1))) (or (and (= ~c_dr_st~0 0) (not (= ~p_dw_st~0 0)) (= 1 ~c_dr_i~0) .cse0 (<= ~c_dr_pc~0 0)) (and (= ~c_dr_pc~0 1) .cse0))) [2022-12-13 13:40:56,154 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 13:40:56,154 INFO L895 garLoopResultBuilder]: At program point L491-1(lines 491 528) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-12-13 13:40:56,154 INFO L895 garLoopResultBuilder]: At program point do_read_c_returnLabel#1(lines 195 253) the Hoare annotation is: (= ~c_dr_pc~0 1) [2022-12-13 13:40:56,154 INFO L899 garLoopResultBuilder]: For program point L508(line 508) no Hoare annotation was computed. [2022-12-13 13:40:56,154 INFO L895 garLoopResultBuilder]: At program point L244(line 244) the Hoare annotation is: false [2022-12-13 13:40:56,154 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-12-13 13:40:56,154 INFO L902 garLoopResultBuilder]: At program point L244-1(lines 210 247) the Hoare annotation is: true [2022-12-13 13:40:56,154 INFO L899 garLoopResultBuilder]: For program point L492(line 492) no Hoare annotation was computed. [2022-12-13 13:40:56,154 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 13:40:56,154 INFO L895 garLoopResultBuilder]: At program point L278-1(lines 269 286) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse3 (= ~q_req_up~0 0)) (.cse4 (= ~q_read_ev~0 2)) (.cse5 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse6 (= ~c_dr_pc~0 ~q_req_up~0))) (or (and .cse0 (not (= ~p_dw_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~slow_clk_edge~0) .cse4 (<= 2 ~fast_clk_edge~0) .cse5 .cse6))) [2022-12-13 13:40:56,155 INFO L895 garLoopResultBuilder]: At program point eval_returnLabel#1(lines 404 456) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-12-13 13:40:56,155 INFO L899 garLoopResultBuilder]: For program point L510(lines 510 519) no Hoare annotation was computed. [2022-12-13 13:40:56,155 INFO L899 garLoopResultBuilder]: For program point L510-2(lines 510 519) no Hoare annotation was computed. [2022-12-13 13:40:56,155 INFO L895 garLoopResultBuilder]: At program point L411(line 411) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-12-13 13:40:56,155 INFO L895 garLoopResultBuilder]: At program point L164-1(lines 164 187) the Hoare annotation is: (let ((.cse6 (= ~p_dw_pc~0 1))) (let ((.cse1 (= ~c_dr_st~0 0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (= 1 ~c_dr_i~0)) (.cse0 (not .cse6)) (.cse4 (<= ~c_dr_pc~0 0)) (.cse5 (= ~q_req_up~0 ~p_dw_pc~0))) (or (and (= ~c_dr_pc~0 1) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse3 .cse0 .cse4) (and .cse6 .cse5 (= ~c_dr_pc~0 ~q_req_up~0))))) [2022-12-13 13:40:56,155 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 13:40:56,155 INFO L899 garLoopResultBuilder]: For program point L165(line 165) no Hoare annotation was computed. [2022-12-13 13:40:56,155 INFO L899 garLoopResultBuilder]: For program point L413(line 413) no Hoare annotation was computed. [2022-12-13 13:40:56,155 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 161) no Hoare annotation was computed. [2022-12-13 13:40:56,155 INFO L895 garLoopResultBuilder]: At program point L463(line 463) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-12-13 13:40:56,155 INFO L899 garLoopResultBuilder]: For program point L463-1(line 463) no Hoare annotation was computed. [2022-12-13 13:40:56,155 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 207) no Hoare annotation was computed. [2022-12-13 13:40:56,155 INFO L895 garLoopResultBuilder]: At program point stop_simulation_returnLabel#1(lines 457 475) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-12-13 13:40:56,155 INFO L899 garLoopResultBuilder]: For program point L365(lines 365 369) no Hoare annotation was computed. [2022-12-13 13:40:56,155 INFO L899 garLoopResultBuilder]: For program point L365-2(lines 364 377) no Hoare annotation was computed. [2022-12-13 13:40:56,155 INFO L895 garLoopResultBuilder]: At program point L514(line 514) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-12-13 13:40:56,155 INFO L899 garLoopResultBuilder]: For program point L66-2(lines 65 89) no Hoare annotation was computed. [2022-12-13 13:40:56,156 INFO L895 garLoopResultBuilder]: At program point L87(lines 65 89) the Hoare annotation is: (let ((.cse2 (not (= ~q_read_ev~0 2))) (.cse3 (not (<= ~c_dr_pc~0 0))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse0 (and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))) (.cse1 (= ~p_dw_pc~0 1)) (.cse5 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 (not (= ~c_dr_pc~0 1)) .cse2) (or .cse3 .cse4 .cse0 .cse1 .cse2 .cse5) (or .cse3 (not (<= 2 ~fast_clk_edge~0)) .cse4 .cse0 (not .cse1) .cse5))) [2022-12-13 13:40:56,156 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredFINAL(lines 62 90) no Hoare annotation was computed. [2022-12-13 13:40:56,156 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 62 90) no Hoare annotation was computed. [2022-12-13 13:40:56,156 INFO L899 garLoopResultBuilder]: For program point L77(lines 77 82) no Hoare annotation was computed. [2022-12-13 13:40:56,156 INFO L899 garLoopResultBuilder]: For program point L76-1(lines 76 85) no Hoare annotation was computed. [2022-12-13 13:40:56,156 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 62 90) the Hoare annotation is: true [2022-12-13 13:40:56,156 INFO L899 garLoopResultBuilder]: For program point L67(lines 67 72) no Hoare annotation was computed. [2022-12-13 13:40:56,156 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 75) no Hoare annotation was computed. [2022-12-13 13:40:56,156 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 15 22) no Hoare annotation was computed. [2022-12-13 13:40:56,156 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 15 22) the Hoare annotation is: true [2022-12-13 13:40:56,156 INFO L899 garLoopResultBuilder]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-12-13 13:40:56,156 INFO L899 garLoopResultBuilder]: For program point errorFINAL(lines 15 22) no Hoare annotation was computed. [2022-12-13 13:40:56,158 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:40:56,160 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 13:40:56,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:40:56 BoogieIcfgContainer [2022-12-13 13:40:56,173 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 13:40:56,173 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 13:40:56,173 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 13:40:56,174 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 13:40:56,174 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:40:07" (3/4) ... [2022-12-13 13:40:56,176 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 13:40:56,180 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2022-12-13 13:40:56,180 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2022-12-13 13:40:56,180 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2022-12-13 13:40:56,180 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2022-12-13 13:40:56,181 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2022-12-13 13:40:56,181 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2022-12-13 13:40:56,181 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2022-12-13 13:40:56,181 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2022-12-13 13:40:56,185 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-12-13 13:40:56,186 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-12-13 13:40:56,186 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-13 13:40:56,186 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 13:40:56,203 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((q_req_up == 0 || !(c_dr_pc == 1)) && (!(c_dr_pc == 1) || !(\old(q_req_up) == 0))) && (((!(c_dr_pc <= 0) || !(c_dr_st == 0)) || q_req_up == 0) || !(1 == c_dr_i))) && (((!(c_dr_pc <= 0) || !(c_dr_st == 0)) || !(\old(q_req_up) == 0)) || !(1 == c_dr_i)) [2022-12-13 13:40:56,220 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9659cf30-d81b-4332-9231-a3f9d8f917d4/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 13:40:56,220 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 13:40:56,221 INFO L158 Benchmark]: Toolchain (without parser) took 49637.21ms. Allocated memory was 144.7MB in the beginning and 906.0MB in the end (delta: 761.3MB). Free memory was 104.0MB in the beginning and 741.5MB in the end (delta: -637.4MB). Peak memory consumption was 127.0MB. Max. memory is 16.1GB. [2022-12-13 13:40:56,221 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 100.7MB. Free memory is still 53.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 13:40:56,221 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.42ms. Allocated memory is still 144.7MB. Free memory was 103.6MB in the beginning and 90.1MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-13 13:40:56,221 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.44ms. Allocated memory is still 144.7MB. Free memory was 90.1MB in the beginning and 88.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 13:40:56,221 INFO L158 Benchmark]: Boogie Preprocessor took 33.00ms. Allocated memory is still 144.7MB. Free memory was 88.1MB in the beginning and 86.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 13:40:56,221 INFO L158 Benchmark]: RCFGBuilder took 448.54ms. Allocated memory is still 144.7MB. Free memory was 86.4MB in the beginning and 107.5MB in the end (delta: -21.1MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2022-12-13 13:40:56,222 INFO L158 Benchmark]: TraceAbstraction took 48855.35ms. Allocated memory was 144.7MB in the beginning and 906.0MB in the end (delta: 761.3MB). Free memory was 106.9MB in the beginning and 746.7MB in the end (delta: -639.8MB). Peak memory consumption was 582.9MB. Max. memory is 16.1GB. [2022-12-13 13:40:56,222 INFO L158 Benchmark]: Witness Printer took 46.75ms. Allocated memory is still 906.0MB. Free memory was 746.7MB in the beginning and 741.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-13 13:40:56,223 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.15ms. Allocated memory is still 100.7MB. Free memory is still 53.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.42ms. Allocated memory is still 144.7MB. Free memory was 103.6MB in the beginning and 90.1MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.44ms. Allocated memory is still 144.7MB. Free memory was 90.1MB in the beginning and 88.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.00ms. Allocated memory is still 144.7MB. Free memory was 88.1MB in the beginning and 86.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 448.54ms. Allocated memory is still 144.7MB. Free memory was 86.4MB in the beginning and 107.5MB in the end (delta: -21.1MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * TraceAbstraction took 48855.35ms. Allocated memory was 144.7MB in the beginning and 906.0MB in the end (delta: 761.3MB). Free memory was 106.9MB in the beginning and 746.7MB in the end (delta: -639.8MB). Peak memory consumption was 582.9MB. Max. memory is 16.1GB. * Witness Printer took 46.75ms. Allocated memory is still 906.0MB. Free memory was 746.7MB in the beginning and 741.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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: 19]: 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 9 procedures, 119 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.8s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 35.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7006 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6901 mSDsluCounter, 7096 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5281 mSDsCounter, 1817 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7363 IncrementalHoareTripleChecker+Invalid, 9180 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1817 mSolverCounterUnsat, 1815 mSDtfsCounter, 7363 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1096 GetRequests, 870 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7921occurred in iteration=12, InterpolantAutomatonStates: 186, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 1550 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 46 LocationsWithAnnotation, 7671 PreInvPairs, 10405 NumberOfFragments, 1065 HoareAnnotationTreeSize, 7671 FomulaSimplifications, 10320 FormulaSimplificationTreeSizeReduction, 24.4s HoareSimplificationTime, 46 FomulaSimplificationsInter, 785301 FormulaSimplificationTreeSizeReductionInter, 10.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1873 NumberOfCodeBlocks, 1873 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1857 ConstructedInterpolants, 0 QuantifiedInterpolants, 3640 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1629 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 862/889 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 461]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: c_dr_pc == 1 - InvariantResult [Line: 476]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((((c_dr_st == 0 && !(p_dw_st == 0)) && 1 == c_dr_i) && p_dw_pc == 1) && c_dr_pc <= 0) || (c_dr_pc == 1 && p_dw_pc == 1) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: (((((__retres1 <= 0 && 0 <= __retres1) || p_dw_pc == 1) || !(c_dr_pc == 1)) || !(q_read_ev == 2)) && (((((!(c_dr_pc <= 0) || !(c_dr_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || p_dw_pc == 1) || !(q_read_ev == 2)) || !(1 == c_dr_i))) && (((((!(c_dr_pc <= 0) || !(2 <= fast_clk_edge)) || !(c_dr_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_pc == 1)) || !(1 == c_dr_i)) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: (((c_dr_st == 0 && !(p_dw_st == 0)) && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 491]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: ((!(c_dr_pc <= 0) || !(c_dr_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(1 == c_dr_i) - InvariantResult [Line: 535]: Loop Invariant Derived loop invariant: ((((((((c_dr_st == 0 && q_write_ev == q_read_ev) && 1 == c_dr_i) && q_req_up == 0) && p_dw_st == 0) && 2 <= slow_clk_edge) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up - InvariantResult [Line: 554]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (((c_dr_pc == 1 && !(p_dw_pc == 1)) || ((((c_dr_st == 0 && !(p_dw_st == 0)) && 1 == c_dr_i) && c_dr_pc <= 0) && q_req_up == p_dw_pc)) || ((((c_dr_st == 0 && !(p_dw_st == 0)) && 1 == c_dr_i) && !(p_dw_pc == 1)) && c_dr_pc <= 0)) || ((p_dw_pc == 1 && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) - InvariantResult [Line: 269]: Loop Invariant Derived loop invariant: (((((((c_dr_st == 0 && !(p_dw_st == 0)) && q_write_ev == q_read_ev) && 1 == c_dr_i) && q_req_up == 0) && q_read_ev == 2) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) || ((((((((c_dr_st == 0 && q_write_ev == q_read_ev) && 1 == c_dr_i) && q_req_up == 0) && 2 <= slow_clk_edge) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: (((c_dr_st == 0 && !(p_dw_st == 0)) && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((q_req_up == 0 || !(c_dr_pc == 1)) && (!(c_dr_pc == 1) || !(\old(q_req_up) == 0))) && (((!(c_dr_pc <= 0) || !(c_dr_st == 0)) || q_req_up == 0) || !(1 == c_dr_i))) && (((!(c_dr_pc <= 0) || !(c_dr_st == 0)) || !(\old(q_req_up) == 0)) || !(1 == c_dr_i)) - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 RESULT: Ultimate proved your program to be correct! [2022-12-13 13:40:56,244 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9659cf30-d81b-4332-9231-a3f9d8f917d4/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE