./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/Problem05_label45+token_ring.02.cil-2.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_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/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_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/Problem05_label45+token_ring.02.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/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_bc25c60a-6a00-4a01-88d2-7c6bc525818b/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 5d56dff15b0de2a89db18b71695d59ff3710bc2ebb344dc571e9d71343d9d530 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 21:37:20,561 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 21:37:20,563 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 21:37:20,582 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 21:37:20,583 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 21:37:20,584 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 21:37:20,585 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 21:37:20,586 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 21:37:20,588 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 21:37:20,589 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 21:37:20,590 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 21:37:20,591 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 21:37:20,591 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 21:37:20,592 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 21:37:20,593 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 21:37:20,594 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 21:37:20,595 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 21:37:20,596 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 21:37:20,597 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 21:37:20,599 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 21:37:20,601 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 21:37:20,602 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 21:37:20,603 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 21:37:20,604 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 21:37:20,607 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 21:37:20,608 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 21:37:20,608 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 21:37:20,609 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 21:37:20,609 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 21:37:20,610 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 21:37:20,611 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 21:37:20,611 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 21:37:20,612 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 21:37:20,613 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 21:37:20,614 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 21:37:20,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 21:37:20,615 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 21:37:20,615 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 21:37:20,615 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 21:37:20,616 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 21:37:20,617 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 21:37:20,618 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 21:37:20,639 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 21:37:20,640 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 21:37:20,640 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 21:37:20,640 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 21:37:20,641 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 21:37:20,641 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 21:37:20,642 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 21:37:20,642 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 21:37:20,642 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 21:37:20,642 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 21:37:20,642 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 21:37:20,643 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 21:37:20,643 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 21:37:20,643 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 21:37:20,643 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 21:37:20,643 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 21:37:20,644 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 21:37:20,644 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 21:37:20,644 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 21:37:20,644 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 21:37:20,644 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 21:37:20,645 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 21:37:20,645 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 21:37:20,645 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 21:37:20,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:37:20,645 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 21:37:20,646 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 21:37:20,646 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 21:37:20,646 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 21:37:20,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 21:37:20,646 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 21:37:20,647 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 21:37:20,647 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 21:37:20,647 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 21:37:20,647 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 21:37:20,647 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_bc25c60a-6a00-4a01-88d2-7c6bc525818b/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_bc25c60a-6a00-4a01-88d2-7c6bc525818b/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 -> 5d56dff15b0de2a89db18b71695d59ff3710bc2ebb344dc571e9d71343d9d530 [2022-12-13 21:37:20,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 21:37:20,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 21:37:20,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 21:37:20,851 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 21:37:20,851 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 21:37:20,852 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/combinations/Problem05_label45+token_ring.02.cil-2.c [2022-12-13 21:37:23,432 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 21:37:23,879 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 21:37:23,879 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/sv-benchmarks/c/combinations/Problem05_label45+token_ring.02.cil-2.c [2022-12-13 21:37:23,914 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/data/445ea36f9/e6eca76726c6459e8b84595fc605b704/FLAGb1491b3ca [2022-12-13 21:37:23,928 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/data/445ea36f9/e6eca76726c6459e8b84595fc605b704 [2022-12-13 21:37:23,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 21:37:23,932 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 21:37:23,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 21:37:23,933 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 21:37:23,937 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 21:37:23,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:37:23" (1/1) ... [2022-12-13 21:37:23,938 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63abf4fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:23, skipping insertion in model container [2022-12-13 21:37:23,939 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:37:23" (1/1) ... [2022-12-13 21:37:23,944 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 21:37:24,093 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 21:37:25,370 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_bc25c60a-6a00-4a01-88d2-7c6bc525818b/sv-benchmarks/c/combinations/Problem05_label45+token_ring.02.cil-2.c[380323,380336] [2022-12-13 21:37:25,390 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_bc25c60a-6a00-4a01-88d2-7c6bc525818b/sv-benchmarks/c/combinations/Problem05_label45+token_ring.02.cil-2.c[383339,383352] [2022-12-13 21:37:25,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:37:25,527 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 21:37:26,280 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_bc25c60a-6a00-4a01-88d2-7c6bc525818b/sv-benchmarks/c/combinations/Problem05_label45+token_ring.02.cil-2.c[380323,380336] [2022-12-13 21:37:26,284 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_bc25c60a-6a00-4a01-88d2-7c6bc525818b/sv-benchmarks/c/combinations/Problem05_label45+token_ring.02.cil-2.c[383339,383352] [2022-12-13 21:37:26,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:37:26,344 INFO L208 MainTranslator]: Completed translation [2022-12-13 21:37:26,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:26 WrapperNode [2022-12-13 21:37:26,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 21:37:26,345 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 21:37:26,345 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 21:37:26,345 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 21:37:26,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:26" (1/1) ... [2022-12-13 21:37:26,404 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:26" (1/1) ... [2022-12-13 21:37:26,653 INFO L138 Inliner]: procedures = 48, calls = 48, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 12624 [2022-12-13 21:37:26,653 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 21:37:26,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 21:37:26,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 21:37:26,654 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 21:37:26,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:26" (1/1) ... [2022-12-13 21:37:26,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:26" (1/1) ... [2022-12-13 21:37:26,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:26" (1/1) ... [2022-12-13 21:37:26,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:26" (1/1) ... [2022-12-13 21:37:26,848 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:26" (1/1) ... [2022-12-13 21:37:26,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:26" (1/1) ... [2022-12-13 21:37:26,907 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:26" (1/1) ... [2022-12-13 21:37:26,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:26" (1/1) ... [2022-12-13 21:37:26,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 21:37:26,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 21:37:26,957 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 21:37:26,957 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 21:37:26,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:26" (1/1) ... [2022-12-13 21:37:26,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:37:26,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:37:26,985 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 21:37:26,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 21:37:27,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 21:37:27,019 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-12-13 21:37:27,019 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-12-13 21:37:27,019 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-12-13 21:37:27,019 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-12-13 21:37:27,019 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-12-13 21:37:27,019 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-12-13 21:37:27,019 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-12-13 21:37:27,019 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-12-13 21:37:27,019 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-12-13 21:37:27,019 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-12-13 21:37:27,019 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-12-13 21:37:27,020 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-12-13 21:37:27,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 21:37:27,020 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-12-13 21:37:27,020 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-12-13 21:37:27,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 21:37:27,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 21:37:27,096 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 21:37:27,098 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 21:37:32,230 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 21:37:32,254 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 21:37:32,254 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-13 21:37:32,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:37:32 BoogieIcfgContainer [2022-12-13 21:37:32,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 21:37:32,262 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 21:37:32,262 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 21:37:32,265 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 21:37:32,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:37:23" (1/3) ... [2022-12-13 21:37:32,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@794191d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:37:32, skipping insertion in model container [2022-12-13 21:37:32,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:26" (2/3) ... [2022-12-13 21:37:32,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@794191d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:37:32, skipping insertion in model container [2022-12-13 21:37:32,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:37:32" (3/3) ... [2022-12-13 21:37:32,268 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.02.cil-2.c [2022-12-13 21:37:32,287 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 21:37:32,287 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 21:37:32,359 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 21:37:32,364 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;@3b7fbb7f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 21:37:32,364 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-13 21:37:32,372 INFO L276 IsEmpty]: Start isEmpty. Operand has 2323 states, 2295 states have (on average 1.857516339869281) internal successors, (4263), 2300 states have internal predecessors, (4263), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-12-13 21:37:32,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 21:37:32,380 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:37:32,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:37:32,381 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:37:32,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:37:32,385 INFO L85 PathProgramCache]: Analyzing trace with hash -2062992276, now seen corresponding path program 1 times [2022-12-13 21:37:32,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:37:32,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047680330] [2022-12-13 21:37:32,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:37:32,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:37:32,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:32,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:37:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:32,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:37:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:32,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:37:32,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:32,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:37:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:32,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:37:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:32,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:37:32,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:37:32,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047680330] [2022-12-13 21:37:32,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047680330] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:37:32,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:37:32,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:37:32,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255358575] [2022-12-13 21:37:32,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:37:32,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:37:32,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:37:32,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:37:32,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:37:32,729 INFO L87 Difference]: Start difference. First operand has 2323 states, 2295 states have (on average 1.857516339869281) internal successors, (4263), 2300 states have internal predecessors, (4263), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:37:33,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:37:33,590 INFO L93 Difference]: Finished difference Result 4824 states and 8887 transitions. [2022-12-13 21:37:33,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 21:37:33,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-12-13 21:37:33,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:37:33,615 INFO L225 Difference]: With dead ends: 4824 [2022-12-13 21:37:33,615 INFO L226 Difference]: Without dead ends: 2441 [2022-12-13 21:37:33,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-13 21:37:33,627 INFO L413 NwaCegarLoop]: 4168 mSDtfsCounter, 4452 mSDsluCounter, 12443 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4461 SdHoareTripleChecker+Valid, 16611 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 21:37:33,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4461 Valid, 16611 Invalid, 717 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [76 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 21:37:33,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2441 states. [2022-12-13 21:37:33,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2441 to 2376. [2022-12-13 21:37:33,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2376 states, 2332 states have (on average 1.8340480274442539) internal successors, (4277), 2336 states have internal predecessors, (4277), 29 states have call successors, (29), 13 states have call predecessors, (29), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2022-12-13 21:37:33,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 2376 states and 4336 transitions. [2022-12-13 21:37:33,768 INFO L78 Accepts]: Start accepts. Automaton has 2376 states and 4336 transitions. Word has length 69 [2022-12-13 21:37:33,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:37:33,769 INFO L495 AbstractCegarLoop]: Abstraction has 2376 states and 4336 transitions. [2022-12-13 21:37:33,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:37:33,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 4336 transitions. [2022-12-13 21:37:33,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 21:37:33,772 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:37:33,772 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:37:33,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 21:37:33,773 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:37:33,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:37:33,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1960277912, now seen corresponding path program 1 times [2022-12-13 21:37:33,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:37:33,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201041937] [2022-12-13 21:37:33,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:37:33,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:37:33,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:33,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:37:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:33,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:37:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:33,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:37:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:33,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:37:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:33,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:37:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:33,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:37:33,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:37:33,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201041937] [2022-12-13 21:37:33,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201041937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:37:33,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:37:33,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:37:33,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275884650] [2022-12-13 21:37:33,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:37:33,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:37:33,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:37:33,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:37:33,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:37:33,934 INFO L87 Difference]: Start difference. First operand 2376 states and 4336 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:37:34,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:37:34,730 INFO L93 Difference]: Finished difference Result 2838 states and 5030 transitions. [2022-12-13 21:37:34,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 21:37:34,731 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-12-13 21:37:34,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:37:34,742 INFO L225 Difference]: With dead ends: 2838 [2022-12-13 21:37:34,742 INFO L226 Difference]: Without dead ends: 2593 [2022-12-13 21:37:34,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-12-13 21:37:34,746 INFO L413 NwaCegarLoop]: 4172 mSDtfsCounter, 4378 mSDsluCounter, 16510 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4387 SdHoareTripleChecker+Valid, 20682 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 21:37:34,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4387 Valid, 20682 Invalid, 1016 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [47 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 21:37:34,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2593 states. [2022-12-13 21:37:34,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2593 to 2490. [2022-12-13 21:37:34,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2490 states, 2428 states have (on average 1.82001647446458) internal successors, (4419), 2433 states have internal predecessors, (4419), 40 states have call successors, (40), 19 states have call predecessors, (40), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2022-12-13 21:37:34,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2490 states and 4502 transitions. [2022-12-13 21:37:34,820 INFO L78 Accepts]: Start accepts. Automaton has 2490 states and 4502 transitions. Word has length 69 [2022-12-13 21:37:34,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:37:34,821 INFO L495 AbstractCegarLoop]: Abstraction has 2490 states and 4502 transitions. [2022-12-13 21:37:34,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:37:34,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 4502 transitions. [2022-12-13 21:37:34,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 21:37:34,823 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:37:34,823 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:37:34,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 21:37:34,824 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:37:34,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:37:34,824 INFO L85 PathProgramCache]: Analyzing trace with hash -573492502, now seen corresponding path program 1 times [2022-12-13 21:37:34,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:37:34,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071529158] [2022-12-13 21:37:34,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:37:34,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:37:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:34,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:37:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:34,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:37:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:34,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:37:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:34,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:37:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:34,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:37:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:34,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:37:34,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:37:34,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071529158] [2022-12-13 21:37:34,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071529158] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:37:34,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:37:34,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:37:34,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623887460] [2022-12-13 21:37:34,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:37:34,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:37:34,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:37:34,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:37:34,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:37:34,966 INFO L87 Difference]: Start difference. First operand 2490 states and 4502 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:37:35,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:37:35,648 INFO L93 Difference]: Finished difference Result 3239 states and 5624 transitions. [2022-12-13 21:37:35,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 21:37:35,649 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-12-13 21:37:35,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:37:35,661 INFO L225 Difference]: With dead ends: 3239 [2022-12-13 21:37:35,661 INFO L226 Difference]: Without dead ends: 2880 [2022-12-13 21:37:35,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-12-13 21:37:35,664 INFO L413 NwaCegarLoop]: 4103 mSDtfsCounter, 4418 mSDsluCounter, 16296 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4427 SdHoareTripleChecker+Valid, 20399 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 21:37:35,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4427 Valid, 20399 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 21:37:35,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2022-12-13 21:37:35,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 2719. [2022-12-13 21:37:35,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2719 states, 2621 states have (on average 1.794734834032812) internal successors, (4704), 2628 states have internal predecessors, (4704), 62 states have call successors, (62), 31 states have call predecessors, (62), 34 states have return successors, (73), 63 states have call predecessors, (73), 60 states have call successors, (73) [2022-12-13 21:37:35,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2719 states to 2719 states and 4839 transitions. [2022-12-13 21:37:35,758 INFO L78 Accepts]: Start accepts. Automaton has 2719 states and 4839 transitions. Word has length 69 [2022-12-13 21:37:35,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:37:35,759 INFO L495 AbstractCegarLoop]: Abstraction has 2719 states and 4839 transitions. [2022-12-13 21:37:35,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:37:35,759 INFO L276 IsEmpty]: Start isEmpty. Operand 2719 states and 4839 transitions. [2022-12-13 21:37:35,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 21:37:35,761 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:37:35,761 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:37:35,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 21:37:35,762 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:37:35,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:37:35,762 INFO L85 PathProgramCache]: Analyzing trace with hash 302526504, now seen corresponding path program 1 times [2022-12-13 21:37:35,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:37:35,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189490783] [2022-12-13 21:37:35,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:37:35,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:37:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:35,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:37:35,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:35,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:37:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:35,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:37:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:35,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:37:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:35,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:37:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:35,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:37:35,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:37:35,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189490783] [2022-12-13 21:37:35,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189490783] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:37:35,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:37:35,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:37:35,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637465769] [2022-12-13 21:37:35,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:37:35,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:37:35,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:37:35,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:37:35,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:37:35,886 INFO L87 Difference]: Start difference. First operand 2719 states and 4839 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:37:36,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:37:36,774 INFO L93 Difference]: Finished difference Result 4113 states and 6915 transitions. [2022-12-13 21:37:36,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 21:37:36,775 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-12-13 21:37:36,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:37:36,787 INFO L225 Difference]: With dead ends: 4113 [2022-12-13 21:37:36,787 INFO L226 Difference]: Without dead ends: 3525 [2022-12-13 21:37:36,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-12-13 21:37:36,791 INFO L413 NwaCegarLoop]: 4167 mSDtfsCounter, 4388 mSDsluCounter, 16499 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4396 SdHoareTripleChecker+Valid, 20666 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 21:37:36,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4396 Valid, 20666 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 21:37:36,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3525 states. [2022-12-13 21:37:36,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3525 to 3131. [2022-12-13 21:37:36,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3131 states, 2965 states have (on average 1.7551433389544688) internal successors, (5204), 2976 states have internal predecessors, (5204), 102 states have call successors, (102), 55 states have call predecessors, (102), 62 states have return successors, (135), 107 states have call predecessors, (135), 100 states have call successors, (135) [2022-12-13 21:37:36,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 5441 transitions. [2022-12-13 21:37:36,910 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 5441 transitions. Word has length 69 [2022-12-13 21:37:36,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:37:36,910 INFO L495 AbstractCegarLoop]: Abstraction has 3131 states and 5441 transitions. [2022-12-13 21:37:36,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:37:36,910 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 5441 transitions. [2022-12-13 21:37:36,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 21:37:36,911 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:37:36,911 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:37:36,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 21:37:36,912 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:37:36,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:37:36,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1840866534, now seen corresponding path program 1 times [2022-12-13 21:37:36,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:37:36,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803122399] [2022-12-13 21:37:36,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:37:36,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:37:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:36,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:37:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:36,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:37:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:36,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:37:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:36,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:37:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:36,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:37:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:36,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:37:36,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:37:36,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803122399] [2022-12-13 21:37:36,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803122399] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:37:36,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:37:36,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:37:36,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826038152] [2022-12-13 21:37:36,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:37:36,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:37:36,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:37:36,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:37:36,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:37:36,995 INFO L87 Difference]: Start difference. First operand 3131 states and 5441 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:37:37,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:37:37,757 INFO L93 Difference]: Finished difference Result 5511 states and 8955 transitions. [2022-12-13 21:37:37,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 21:37:37,757 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-12-13 21:37:37,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:37:37,770 INFO L225 Difference]: With dead ends: 5511 [2022-12-13 21:37:37,771 INFO L226 Difference]: Without dead ends: 4511 [2022-12-13 21:37:37,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-12-13 21:37:37,775 INFO L413 NwaCegarLoop]: 4168 mSDtfsCounter, 4390 mSDsluCounter, 16502 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4402 SdHoareTripleChecker+Valid, 20670 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 21:37:37,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4402 Valid, 20670 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 21:37:37,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4511 states. [2022-12-13 21:37:37,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4511 to 3988. [2022-12-13 21:37:37,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3988 states, 3690 states have (on average 1.7002710027100272) internal successors, (6274), 3709 states have internal predecessors, (6274), 178 states have call successors, (178), 103 states have call predecessors, (178), 118 states have return successors, (273), 191 states have call predecessors, (273), 176 states have call successors, (273) [2022-12-13 21:37:37,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3988 states to 3988 states and 6725 transitions. [2022-12-13 21:37:37,890 INFO L78 Accepts]: Start accepts. Automaton has 3988 states and 6725 transitions. Word has length 69 [2022-12-13 21:37:37,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:37:37,891 INFO L495 AbstractCegarLoop]: Abstraction has 3988 states and 6725 transitions. [2022-12-13 21:37:37,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:37:37,891 INFO L276 IsEmpty]: Start isEmpty. Operand 3988 states and 6725 transitions. [2022-12-13 21:37:37,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 21:37:37,893 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:37:37,893 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:37:37,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 21:37:37,893 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:37:37,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:37:37,894 INFO L85 PathProgramCache]: Analyzing trace with hash -187719576, now seen corresponding path program 1 times [2022-12-13 21:37:37,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:37:37,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025274024] [2022-12-13 21:37:37,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:37:37,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:37:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:37,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:37:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:37,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:37:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:37,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:37:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:37,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:37:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:37,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:37:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:37,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:37:37,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:37:37,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025274024] [2022-12-13 21:37:37,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025274024] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:37:37,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:37:37,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:37:37,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886095443] [2022-12-13 21:37:37,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:37:37,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:37:37,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:37:37,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:37:37,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:37:37,958 INFO L87 Difference]: Start difference. First operand 3988 states and 6725 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:37:38,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:37:38,586 INFO L93 Difference]: Finished difference Result 7372 states and 11760 transitions. [2022-12-13 21:37:38,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 21:37:38,586 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-12-13 21:37:38,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:37:38,600 INFO L225 Difference]: With dead ends: 7372 [2022-12-13 21:37:38,600 INFO L226 Difference]: Without dead ends: 5516 [2022-12-13 21:37:38,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-12-13 21:37:38,605 INFO L413 NwaCegarLoop]: 4183 mSDtfsCounter, 4517 mSDsluCounter, 12269 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4542 SdHoareTripleChecker+Valid, 16452 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 21:37:38,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4542 Valid, 16452 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 21:37:38,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5516 states. [2022-12-13 21:37:38,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5516 to 4929. [2022-12-13 21:37:38,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4929 states, 4473 states have (on average 1.6492287055667338) internal successors, (7377), 4509 states have internal predecessors, (7377), 274 states have call successors, (274), 157 states have call predecessors, (274), 180 states have return successors, (397), 278 states have call predecessors, (397), 272 states have call successors, (397) [2022-12-13 21:37:38,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4929 states to 4929 states and 8048 transitions. [2022-12-13 21:37:38,748 INFO L78 Accepts]: Start accepts. Automaton has 4929 states and 8048 transitions. Word has length 69 [2022-12-13 21:37:38,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:37:38,749 INFO L495 AbstractCegarLoop]: Abstraction has 4929 states and 8048 transitions. [2022-12-13 21:37:38,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:37:38,749 INFO L276 IsEmpty]: Start isEmpty. Operand 4929 states and 8048 transitions. [2022-12-13 21:37:38,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-12-13 21:37:38,753 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:37:38,753 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:37:38,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 21:37:38,754 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:37:38,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:37:38,754 INFO L85 PathProgramCache]: Analyzing trace with hash 770021099, now seen corresponding path program 1 times [2022-12-13 21:37:38,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:37:38,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883675308] [2022-12-13 21:37:38,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:37:38,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:37:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:38,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:37:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:38,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:37:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:38,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:37:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:38,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:37:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:38,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:37:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:38,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 21:37:38,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:38,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:37:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:38,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 21:37:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:38,869 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 21:37:38,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:37:38,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883675308] [2022-12-13 21:37:38,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883675308] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:37:38,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360089117] [2022-12-13 21:37:38,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:37:38,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:37:38,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:37:38,871 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:37:38,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 21:37:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:38,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 21:37:38,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:37:39,015 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-13 21:37:39,015 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:37:39,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360089117] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:37:39,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:37:39,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-12-13 21:37:39,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635564861] [2022-12-13 21:37:39,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:37:39,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:37:39,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:37:39,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:37:39,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:37:39,017 INFO L87 Difference]: Start difference. First operand 4929 states and 8048 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 21:37:39,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:37:39,330 INFO L93 Difference]: Finished difference Result 10380 states and 16066 transitions. [2022-12-13 21:37:39,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:37:39,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 111 [2022-12-13 21:37:39,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:37:39,360 INFO L225 Difference]: With dead ends: 10380 [2022-12-13 21:37:39,360 INFO L226 Difference]: Without dead ends: 7583 [2022-12-13 21:37:39,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:37:39,369 INFO L413 NwaCegarLoop]: 4162 mSDtfsCounter, 4110 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4110 SdHoareTripleChecker+Valid, 4333 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:37:39,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4110 Valid, 4333 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:37:39,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7583 states. [2022-12-13 21:37:39,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7583 to 7527. [2022-12-13 21:37:39,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7527 states, 6657 states have (on average 1.5841970857743728) internal successors, (10546), 6726 states have internal predecessors, (10546), 512 states have call successors, (512), 309 states have call predecessors, (512), 356 states have return successors, (745), 507 states have call predecessors, (745), 510 states have call successors, (745) [2022-12-13 21:37:39,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7527 states to 7527 states and 11803 transitions. [2022-12-13 21:37:39,616 INFO L78 Accepts]: Start accepts. Automaton has 7527 states and 11803 transitions. Word has length 111 [2022-12-13 21:37:39,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:37:39,617 INFO L495 AbstractCegarLoop]: Abstraction has 7527 states and 11803 transitions. [2022-12-13 21:37:39,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 21:37:39,617 INFO L276 IsEmpty]: Start isEmpty. Operand 7527 states and 11803 transitions. [2022-12-13 21:37:39,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-12-13 21:37:39,625 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:37:39,625 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:37:39,632 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 21:37:39,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:37:39,826 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:37:39,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:37:39,826 INFO L85 PathProgramCache]: Analyzing trace with hash -122535733, now seen corresponding path program 1 times [2022-12-13 21:37:39,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:37:39,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807240404] [2022-12-13 21:37:39,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:37:39,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:37:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:39,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:37:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:39,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:37:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:39,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:37:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:39,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:37:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:39,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:37:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:39,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 21:37:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:39,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:37:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:39,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 21:37:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:39,933 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 21:37:39,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:37:39,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807240404] [2022-12-13 21:37:39,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807240404] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:37:39,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768803841] [2022-12-13 21:37:39,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:37:39,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:37:39,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:37:39,935 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:37:39,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 21:37:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:40,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 21:37:40,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:37:40,038 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 21:37:40,038 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:37:40,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768803841] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:37:40,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:37:40,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 21:37:40,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846485147] [2022-12-13 21:37:40,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:37:40,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:37:40,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:37:40,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:37:40,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:37:40,040 INFO L87 Difference]: Start difference. First operand 7527 states and 11803 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 21:37:40,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:37:40,427 INFO L93 Difference]: Finished difference Result 17935 states and 27159 transitions. [2022-12-13 21:37:40,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:37:40,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 111 [2022-12-13 21:37:40,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:37:40,461 INFO L225 Difference]: With dead ends: 17935 [2022-12-13 21:37:40,461 INFO L226 Difference]: Without dead ends: 12541 [2022-12-13 21:37:40,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:37:40,474 INFO L413 NwaCegarLoop]: 4311 mSDtfsCounter, 154 mSDsluCounter, 4150 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 8461 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:37:40,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 8461 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:37:40,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12541 states. [2022-12-13 21:37:40,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12541 to 12541. [2022-12-13 21:37:40,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12541 states, 10858 states have (on average 1.5209983422361393) internal successors, (16515), 10976 states have internal predecessors, (16515), 977 states have call successors, (977), 609 states have call predecessors, (977), 704 states have return successors, (1596), 987 states have call predecessors, (1596), 975 states have call successors, (1596) [2022-12-13 21:37:40,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12541 states to 12541 states and 19088 transitions. [2022-12-13 21:37:40,953 INFO L78 Accepts]: Start accepts. Automaton has 12541 states and 19088 transitions. Word has length 111 [2022-12-13 21:37:40,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:37:40,954 INFO L495 AbstractCegarLoop]: Abstraction has 12541 states and 19088 transitions. [2022-12-13 21:37:40,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 21:37:40,954 INFO L276 IsEmpty]: Start isEmpty. Operand 12541 states and 19088 transitions. [2022-12-13 21:37:40,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-12-13 21:37:40,971 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:37:40,971 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 21:37:40,977 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 21:37:41,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:37:41,172 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:37:41,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:37:41,172 INFO L85 PathProgramCache]: Analyzing trace with hash 327119452, now seen corresponding path program 1 times [2022-12-13 21:37:41,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:37:41,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796546300] [2022-12-13 21:37:41,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:37:41,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:37:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:41,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:37:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:41,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:37:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:41,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:37:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:41,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:37:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:41,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:37:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:41,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 21:37:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:41,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:37:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:41,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 21:37:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:41,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:37:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:41,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-12-13 21:37:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:41,287 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-12-13 21:37:41,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:37:41,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796546300] [2022-12-13 21:37:41,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796546300] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:37:41,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441267654] [2022-12-13 21:37:41,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:37:41,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:37:41,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:37:41,288 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:37:41,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 21:37:41,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:41,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 21:37:41,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:37:41,453 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 21:37:41,454 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:37:41,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441267654] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:37:41,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:37:41,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-12-13 21:37:41,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262805914] [2022-12-13 21:37:41,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:37:41,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:37:41,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:37:41,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:37:41,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:37:41,456 INFO L87 Difference]: Start difference. First operand 12541 states and 19088 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 21:37:42,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:37:42,362 INFO L93 Difference]: Finished difference Result 32917 states and 49009 transitions. [2022-12-13 21:37:42,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:37:42,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 143 [2022-12-13 21:37:42,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:37:42,413 INFO L225 Difference]: With dead ends: 32917 [2022-12-13 21:37:42,414 INFO L226 Difference]: Without dead ends: 22513 [2022-12-13 21:37:42,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:37:42,436 INFO L413 NwaCegarLoop]: 4183 mSDtfsCounter, 4068 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4068 SdHoareTripleChecker+Valid, 4354 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:37:42,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4068 Valid, 4354 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:37:42,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22513 states. [2022-12-13 21:37:43,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22513 to 22301. [2022-12-13 21:37:43,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22301 states, 19038 states have (on average 1.4810904506775922) internal successors, (28197), 19270 states have internal predecessors, (28197), 1871 states have call successors, (1871), 1199 states have call predecessors, (1871), 1390 states have return successors, (3038), 1863 states have call predecessors, (3038), 1869 states have call successors, (3038) [2022-12-13 21:37:43,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22301 states to 22301 states and 33106 transitions. [2022-12-13 21:37:43,330 INFO L78 Accepts]: Start accepts. Automaton has 22301 states and 33106 transitions. Word has length 143 [2022-12-13 21:37:43,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:37:43,331 INFO L495 AbstractCegarLoop]: Abstraction has 22301 states and 33106 transitions. [2022-12-13 21:37:43,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 21:37:43,331 INFO L276 IsEmpty]: Start isEmpty. Operand 22301 states and 33106 transitions. [2022-12-13 21:37:43,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-12-13 21:37:43,363 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:37:43,363 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:37:43,369 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 21:37:43,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:37:43,564 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:37:43,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:37:43,564 INFO L85 PathProgramCache]: Analyzing trace with hash 382011958, now seen corresponding path program 1 times [2022-12-13 21:37:43,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:37:43,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341029382] [2022-12-13 21:37:43,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:37:43,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:37:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:43,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:37:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:43,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:37:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:43,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:37:43,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:43,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:37:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:43,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:37:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:43,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-12-13 21:37:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:43,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 21:37:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:43,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:37:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:43,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 21:37:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:43,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:37:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:43,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-12-13 21:37:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:43,679 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-12-13 21:37:43,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:37:43,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341029382] [2022-12-13 21:37:43,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341029382] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:37:43,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804770025] [2022-12-13 21:37:43,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:37:43,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:37:43,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:37:43,680 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:37:43,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 21:37:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:43,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 21:37:43,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:37:43,842 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 21:37:43,842 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:37:43,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804770025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:37:43,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:37:43,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 21:37:43,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294350329] [2022-12-13 21:37:43,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:37:43,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:37:43,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:37:43,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:37:43,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:37:43,844 INFO L87 Difference]: Start difference. First operand 22301 states and 33106 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 21:37:44,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:37:44,803 INFO L93 Difference]: Finished difference Result 44821 states and 66508 transitions. [2022-12-13 21:37:44,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:37:44,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 160 [2022-12-13 21:37:44,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:37:44,872 INFO L225 Difference]: With dead ends: 44821 [2022-12-13 21:37:44,872 INFO L226 Difference]: Without dead ends: 24655 [2022-12-13 21:37:44,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:37:44,911 INFO L413 NwaCegarLoop]: 4149 mSDtfsCounter, 4087 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4087 SdHoareTripleChecker+Valid, 4183 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:37:44,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4087 Valid, 4183 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:37:44,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24655 states. [2022-12-13 21:37:45,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24655 to 24655. [2022-12-13 21:37:46,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24655 states, 21180 states have (on average 1.4241265344664777) internal successors, (30163), 21412 states have internal predecessors, (30163), 1925 states have call successors, (1925), 1357 states have call predecessors, (1925), 1548 states have return successors, (3106), 1917 states have call predecessors, (3106), 1923 states have call successors, (3106) [2022-12-13 21:37:46,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24655 states to 24655 states and 35194 transitions. [2022-12-13 21:37:46,050 INFO L78 Accepts]: Start accepts. Automaton has 24655 states and 35194 transitions. Word has length 160 [2022-12-13 21:37:46,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:37:46,050 INFO L495 AbstractCegarLoop]: Abstraction has 24655 states and 35194 transitions. [2022-12-13 21:37:46,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 21:37:46,051 INFO L276 IsEmpty]: Start isEmpty. Operand 24655 states and 35194 transitions. [2022-12-13 21:37:46,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-12-13 21:37:46,082 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:37:46,082 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:37:46,087 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 21:37:46,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:37:46,284 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:37:46,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:37:46,285 INFO L85 PathProgramCache]: Analyzing trace with hash 228383827, now seen corresponding path program 1 times [2022-12-13 21:37:46,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:37:46,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842890728] [2022-12-13 21:37:46,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:37:46,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:37:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:46,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:37:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:46,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:37:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:46,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:37:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:46,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:37:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:46,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:37:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:46,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-12-13 21:37:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:46,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 21:37:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:46,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:37:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:46,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 21:37:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:46,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:37:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:46,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-12-13 21:37:46,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:46,435 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-13 21:37:46,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:37:46,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842890728] [2022-12-13 21:37:46,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842890728] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:37:46,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405640333] [2022-12-13 21:37:46,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:37:46,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:37:46,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:37:46,436 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:37:46,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 21:37:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:46,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 21:37:46,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:37:46,567 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-12-13 21:37:46,568 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:37:46,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405640333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:37:46,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:37:46,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 21:37:46,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018677634] [2022-12-13 21:37:46,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:37:46,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:37:46,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:37:46,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:37:46,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:37:46,569 INFO L87 Difference]: Start difference. First operand 24655 states and 35194 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-13 21:37:47,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:37:47,600 INFO L93 Difference]: Finished difference Result 41688 states and 58732 transitions. [2022-12-13 21:37:47,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:37:47,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 160 [2022-12-13 21:37:47,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:37:47,666 INFO L225 Difference]: With dead ends: 41688 [2022-12-13 21:37:47,667 INFO L226 Difference]: Without dead ends: 26195 [2022-12-13 21:37:47,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:37:47,696 INFO L413 NwaCegarLoop]: 4171 mSDtfsCounter, 4088 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4088 SdHoareTripleChecker+Valid, 4349 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:37:47,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4088 Valid, 4349 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:37:47,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26195 states. [2022-12-13 21:37:49,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26195 to 26055. [2022-12-13 21:37:49,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26055 states, 22468 states have (on average 1.3989229125867901) internal successors, (31431), 22700 states have internal predecessors, (31431), 1945 states have call successors, (1945), 1449 states have call predecessors, (1945), 1640 states have return successors, (3218), 1937 states have call predecessors, (3218), 1943 states have call successors, (3218) [2022-12-13 21:37:49,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26055 states to 26055 states and 36594 transitions. [2022-12-13 21:37:49,169 INFO L78 Accepts]: Start accepts. Automaton has 26055 states and 36594 transitions. Word has length 160 [2022-12-13 21:37:49,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:37:49,169 INFO L495 AbstractCegarLoop]: Abstraction has 26055 states and 36594 transitions. [2022-12-13 21:37:49,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-13 21:37:49,169 INFO L276 IsEmpty]: Start isEmpty. Operand 26055 states and 36594 transitions. [2022-12-13 21:37:49,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-13 21:37:49,212 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:37:49,212 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:37:49,218 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 21:37:49,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:37:49,413 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:37:49,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:37:49,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1570525413, now seen corresponding path program 1 times [2022-12-13 21:37:49,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:37:49,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581212728] [2022-12-13 21:37:49,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:37:49,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:37:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:49,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:37:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:49,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:37:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:49,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:37:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:49,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:37:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:49,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:37:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:49,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 21:37:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:49,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:37:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:49,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-12-13 21:37:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:49,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-12-13 21:37:49,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:49,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:37:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:49,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 21:37:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:49,544 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-13 21:37:49,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:37:49,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581212728] [2022-12-13 21:37:49,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581212728] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:37:49,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695078926] [2022-12-13 21:37:49,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:37:49,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:37:49,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:37:49,545 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:37:49,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 21:37:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:49,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 21:37:49,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:37:49,656 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-13 21:37:49,656 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:37:49,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695078926] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:37:49,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:37:49,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 21:37:49,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966376434] [2022-12-13 21:37:49,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:37:49,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:37:49,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:37:49,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:37:49,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:37:49,658 INFO L87 Difference]: Start difference. First operand 26055 states and 36594 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 21:37:51,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:37:51,620 INFO L93 Difference]: Finished difference Result 72665 states and 101108 transitions. [2022-12-13 21:37:51,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:37:51,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 161 [2022-12-13 21:37:51,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:37:51,724 INFO L225 Difference]: With dead ends: 72665 [2022-12-13 21:37:51,724 INFO L226 Difference]: Without dead ends: 48749 [2022-12-13 21:37:51,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:37:51,760 INFO L413 NwaCegarLoop]: 4320 mSDtfsCounter, 163 mSDsluCounter, 4147 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 8467 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:37:51,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 8467 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:37:51,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48749 states. [2022-12-13 21:37:54,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48749 to 48705. [2022-12-13 21:37:54,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48705 states, 41704 states have (on average 1.3657442931133703) internal successors, (56957), 42166 states have internal predecessors, (56957), 3775 states have call successors, (3775), 2841 states have call predecessors, (3775), 3224 states have return successors, (7134), 3761 states have call predecessors, (7134), 3773 states have call successors, (7134) [2022-12-13 21:37:54,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48705 states to 48705 states and 67866 transitions. [2022-12-13 21:37:54,450 INFO L78 Accepts]: Start accepts. Automaton has 48705 states and 67866 transitions. Word has length 161 [2022-12-13 21:37:54,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:37:54,450 INFO L495 AbstractCegarLoop]: Abstraction has 48705 states and 67866 transitions. [2022-12-13 21:37:54,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 21:37:54,450 INFO L276 IsEmpty]: Start isEmpty. Operand 48705 states and 67866 transitions. [2022-12-13 21:37:54,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-13 21:37:54,511 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:37:54,512 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:37:54,516 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 21:37:54,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 21:37:54,713 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:37:54,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:37:54,715 INFO L85 PathProgramCache]: Analyzing trace with hash -948353227, now seen corresponding path program 1 times [2022-12-13 21:37:54,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:37:54,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217927373] [2022-12-13 21:37:54,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:37:54,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:37:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:54,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:37:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:54,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:37:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:54,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:37:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:54,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:37:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:54,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:37:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:54,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 21:37:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:54,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:37:54,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:54,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-12-13 21:37:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:54,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 21:37:54,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:54,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:37:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:54,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 21:37:54,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:54,848 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-12-13 21:37:54,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:37:54,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217927373] [2022-12-13 21:37:54,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217927373] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:37:54,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033876658] [2022-12-13 21:37:54,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:37:54,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:37:54,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:37:54,850 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:37:54,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 21:37:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:54,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 21:37:54,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:37:55,020 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-13 21:37:55,020 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:37:55,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033876658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:37:55,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:37:55,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 21:37:55,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943217748] [2022-12-13 21:37:55,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:37:55,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:37:55,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:37:55,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:37:55,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:37:55,022 INFO L87 Difference]: Start difference. First operand 48705 states and 67866 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 21:37:56,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:37:56,937 INFO L93 Difference]: Finished difference Result 79069 states and 111521 transitions. [2022-12-13 21:37:56,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:37:56,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 161 [2022-12-13 21:37:56,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:37:57,031 INFO L225 Difference]: With dead ends: 79069 [2022-12-13 21:37:57,031 INFO L226 Difference]: Without dead ends: 41521 [2022-12-13 21:37:57,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:37:57,077 INFO L413 NwaCegarLoop]: 4148 mSDtfsCounter, 4082 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4082 SdHoareTripleChecker+Valid, 4181 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:37:57,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4082 Valid, 4181 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:37:57,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41521 states. [2022-12-13 21:37:59,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41521 to 30305. [2022-12-13 21:37:59,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30305 states, 26128 states have (on average 1.3429654011022658) internal successors, (35089), 26370 states have internal predecessors, (35089), 2255 states have call successors, (2255), 1729 states have call predecessors, (2255), 1920 states have return successors, (3778), 2237 states have call predecessors, (3778), 2253 states have call successors, (3778) [2022-12-13 21:37:59,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30305 states to 30305 states and 41122 transitions. [2022-12-13 21:37:59,242 INFO L78 Accepts]: Start accepts. Automaton has 30305 states and 41122 transitions. Word has length 161 [2022-12-13 21:37:59,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:37:59,243 INFO L495 AbstractCegarLoop]: Abstraction has 30305 states and 41122 transitions. [2022-12-13 21:37:59,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 21:37:59,243 INFO L276 IsEmpty]: Start isEmpty. Operand 30305 states and 41122 transitions. [2022-12-13 21:37:59,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-13 21:37:59,281 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:37:59,281 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:37:59,286 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 21:37:59,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:37:59,483 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:37:59,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:37:59,485 INFO L85 PathProgramCache]: Analyzing trace with hash -192882952, now seen corresponding path program 1 times [2022-12-13 21:37:59,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:37:59,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217137242] [2022-12-13 21:37:59,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:37:59,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:37:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:59,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:37:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:59,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:37:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:59,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:37:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:59,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:37:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:59,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:37:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:59,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 21:37:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:59,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:37:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:59,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-12-13 21:37:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:59,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 21:37:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:59,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:37:59,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:59,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 21:37:59,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:59,630 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-12-13 21:37:59,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:37:59,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217137242] [2022-12-13 21:37:59,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217137242] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:37:59,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797147038] [2022-12-13 21:37:59,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:37:59,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:37:59,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:37:59,631 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:37:59,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 21:37:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:37:59,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 21:37:59,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:37:59,750 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 21:37:59,750 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:37:59,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797147038] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:37:59,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:37:59,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 21:37:59,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695832021] [2022-12-13 21:37:59,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:37:59,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:37:59,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:37:59,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:37:59,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:37:59,753 INFO L87 Difference]: Start difference. First operand 30305 states and 41122 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 21:38:02,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:38:02,401 INFO L93 Difference]: Finished difference Result 82213 states and 110894 transitions. [2022-12-13 21:38:02,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:38:02,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 161 [2022-12-13 21:38:02,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:38:02,536 INFO L225 Difference]: With dead ends: 82213 [2022-12-13 21:38:02,536 INFO L226 Difference]: Without dead ends: 54057 [2022-12-13 21:38:02,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:38:02,585 INFO L413 NwaCegarLoop]: 4314 mSDtfsCounter, 150 mSDsluCounter, 4144 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 8458 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:38:02,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 8458 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:38:02,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54057 states. [2022-12-13 21:38:05,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54057 to 54053. [2022-12-13 21:38:05,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54053 states, 46184 states have (on average 1.3125974363415902) internal successors, (60621), 46666 states have internal predecessors, (60621), 4267 states have call successors, (4267), 3217 states have call predecessors, (4267), 3600 states have return successors, (8200), 4233 states have call predecessors, (8200), 4265 states have call successors, (8200) [2022-12-13 21:38:05,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54053 states to 54053 states and 73088 transitions. [2022-12-13 21:38:05,526 INFO L78 Accepts]: Start accepts. Automaton has 54053 states and 73088 transitions. Word has length 161 [2022-12-13 21:38:05,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:38:05,527 INFO L495 AbstractCegarLoop]: Abstraction has 54053 states and 73088 transitions. [2022-12-13 21:38:05,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 21:38:05,527 INFO L276 IsEmpty]: Start isEmpty. Operand 54053 states and 73088 transitions. [2022-12-13 21:38:05,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-13 21:38:05,573 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:38:05,573 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:38:05,578 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 21:38:05,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 21:38:05,776 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:38:05,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:38:05,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1491732838, now seen corresponding path program 1 times [2022-12-13 21:38:05,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:38:05,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592496174] [2022-12-13 21:38:05,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:38:05,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:38:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:05,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:38:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:05,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:38:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:05,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:38:05,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:05,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:38:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:05,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:38:05,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:05,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 21:38:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:05,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 21:38:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:05,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:38:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:05,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-12-13 21:38:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:05,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:38:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:05,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 21:38:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:05,889 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-12-13 21:38:05,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:38:05,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592496174] [2022-12-13 21:38:05,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592496174] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:38:05,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514655506] [2022-12-13 21:38:05,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:38:05,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:38:05,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:38:05,891 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:38:05,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 21:38:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:05,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 21:38:05,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:38:06,013 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 21:38:06,013 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:38:06,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514655506] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:38:06,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:38:06,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 21:38:06,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055669004] [2022-12-13 21:38:06,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:38:06,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:38:06,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:38:06,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:38:06,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:38:06,015 INFO L87 Difference]: Start difference. First operand 54053 states and 73088 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-13 21:38:08,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:38:08,975 INFO L93 Difference]: Finished difference Result 95015 states and 127828 transitions. [2022-12-13 21:38:08,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:38:08,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 161 [2022-12-13 21:38:08,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:38:09,109 INFO L225 Difference]: With dead ends: 95015 [2022-12-13 21:38:09,109 INFO L226 Difference]: Without dead ends: 54897 [2022-12-13 21:38:09,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:38:09,176 INFO L413 NwaCegarLoop]: 4186 mSDtfsCounter, 4108 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4108 SdHoareTripleChecker+Valid, 4357 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:38:09,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4108 Valid, 4357 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:38:09,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54897 states. [2022-12-13 21:38:12,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54897 to 54053. [2022-12-13 21:38:12,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54053 states, 46184 states have (on average 1.3048025290143772) internal successors, (60261), 46666 states have internal predecessors, (60261), 4267 states have call successors, (4267), 3217 states have call predecessors, (4267), 3600 states have return successors, (8200), 4233 states have call predecessors, (8200), 4265 states have call successors, (8200) [2022-12-13 21:38:12,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54053 states to 54053 states and 72728 transitions. [2022-12-13 21:38:12,336 INFO L78 Accepts]: Start accepts. Automaton has 54053 states and 72728 transitions. Word has length 161 [2022-12-13 21:38:12,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:38:12,337 INFO L495 AbstractCegarLoop]: Abstraction has 54053 states and 72728 transitions. [2022-12-13 21:38:12,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-13 21:38:12,337 INFO L276 IsEmpty]: Start isEmpty. Operand 54053 states and 72728 transitions. [2022-12-13 21:38:12,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-13 21:38:12,382 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:38:12,382 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:38:12,387 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 21:38:12,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 21:38:12,583 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:38:12,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:38:12,584 INFO L85 PathProgramCache]: Analyzing trace with hash -251057197, now seen corresponding path program 1 times [2022-12-13 21:38:12,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:38:12,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863542672] [2022-12-13 21:38:12,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:38:12,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:38:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:12,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:38:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:12,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:38:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:12,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:38:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:12,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:38:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:12,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:38:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:12,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 21:38:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:12,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 21:38:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:12,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:38:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:12,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 21:38:12,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:12,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:38:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:12,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 21:38:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:12,695 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-13 21:38:12,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:38:12,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863542672] [2022-12-13 21:38:12,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863542672] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:38:12,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569051808] [2022-12-13 21:38:12,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:38:12,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:38:12,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:38:12,697 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:38:12,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 21:38:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:12,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 21:38:12,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:38:12,811 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-13 21:38:12,811 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:38:12,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569051808] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:38:12,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:38:12,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 21:38:12,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982893060] [2022-12-13 21:38:12,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:38:12,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:38:12,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:38:12,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:38:12,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:38:12,812 INFO L87 Difference]: Start difference. First operand 54053 states and 72728 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-13 21:38:15,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:38:15,525 INFO L93 Difference]: Finished difference Result 94725 states and 126938 transitions. [2022-12-13 21:38:15,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:38:15,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 161 [2022-12-13 21:38:15,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:38:15,649 INFO L225 Difference]: With dead ends: 94725 [2022-12-13 21:38:15,649 INFO L226 Difference]: Without dead ends: 55449 [2022-12-13 21:38:15,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:38:15,704 INFO L413 NwaCegarLoop]: 4200 mSDtfsCounter, 4107 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4107 SdHoareTripleChecker+Valid, 4373 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:38:15,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4107 Valid, 4373 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:38:15,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55449 states. [2022-12-13 21:38:18,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55449 to 53933. [2022-12-13 21:38:18,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53933 states, 46064 states have (on average 1.2977813476901703) internal successors, (59781), 46546 states have internal predecessors, (59781), 4267 states have call successors, (4267), 3217 states have call predecessors, (4267), 3600 states have return successors, (8200), 4233 states have call predecessors, (8200), 4265 states have call successors, (8200) [2022-12-13 21:38:18,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53933 states to 53933 states and 72248 transitions. [2022-12-13 21:38:18,842 INFO L78 Accepts]: Start accepts. Automaton has 53933 states and 72248 transitions. Word has length 161 [2022-12-13 21:38:18,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:38:18,842 INFO L495 AbstractCegarLoop]: Abstraction has 53933 states and 72248 transitions. [2022-12-13 21:38:18,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-13 21:38:18,843 INFO L276 IsEmpty]: Start isEmpty. Operand 53933 states and 72248 transitions. [2022-12-13 21:38:18,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-13 21:38:18,884 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:38:18,884 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:38:18,889 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 21:38:19,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 21:38:19,085 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:38:19,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:38:19,087 INFO L85 PathProgramCache]: Analyzing trace with hash -2084105626, now seen corresponding path program 1 times [2022-12-13 21:38:19,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:38:19,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180596759] [2022-12-13 21:38:19,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:38:19,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:38:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:19,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:38:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:19,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:38:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:19,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:38:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:19,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:38:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:19,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:38:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:19,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 21:38:19,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:19,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 21:38:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:19,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:38:19,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:19,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-12-13 21:38:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:19,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:38:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:19,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 21:38:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:19,182 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-12-13 21:38:19,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:38:19,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180596759] [2022-12-13 21:38:19,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180596759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:38:19,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:38:19,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:38:19,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091685301] [2022-12-13 21:38:19,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:38:19,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:38:19,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:38:19,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:38:19,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:38:19,184 INFO L87 Difference]: Start difference. First operand 53933 states and 72248 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 21:38:22,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:38:22,586 INFO L93 Difference]: Finished difference Result 103313 states and 136251 transitions. [2022-12-13 21:38:22,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:38:22,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 161 [2022-12-13 21:38:22,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:38:22,708 INFO L225 Difference]: With dead ends: 103313 [2022-12-13 21:38:22,708 INFO L226 Difference]: Without dead ends: 51525 [2022-12-13 21:38:22,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:38:22,772 INFO L413 NwaCegarLoop]: 4087 mSDtfsCounter, 304 mSDsluCounter, 12019 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 16106 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:38:22,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 16106 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 21:38:22,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51525 states. [2022-12-13 21:38:25,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51525 to 48807. [2022-12-13 21:38:25,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48807 states, 42022 states have (on average 1.3009138070534483) internal successors, (54667), 42916 states have internal predecessors, (54667), 3255 states have call successors, (3255), 2473 states have call predecessors, (3255), 3528 states have return successors, (6773), 3449 states have call predecessors, (6773), 3253 states have call successors, (6773) [2022-12-13 21:38:25,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48807 states to 48807 states and 64695 transitions. [2022-12-13 21:38:25,866 INFO L78 Accepts]: Start accepts. Automaton has 48807 states and 64695 transitions. Word has length 161 [2022-12-13 21:38:25,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:38:25,866 INFO L495 AbstractCegarLoop]: Abstraction has 48807 states and 64695 transitions. [2022-12-13 21:38:25,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 21:38:25,866 INFO L276 IsEmpty]: Start isEmpty. Operand 48807 states and 64695 transitions. [2022-12-13 21:38:25,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-13 21:38:25,898 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:38:25,898 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:38:25,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 21:38:25,899 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:38:25,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:38:25,899 INFO L85 PathProgramCache]: Analyzing trace with hash 641108433, now seen corresponding path program 1 times [2022-12-13 21:38:25,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:38:25,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306333459] [2022-12-13 21:38:25,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:38:25,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:38:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:25,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:38:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:25,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:38:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:25,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:38:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:25,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:38:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:25,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:38:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:25,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 21:38:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:25,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 21:38:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:25,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:38:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:25,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 21:38:25,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:25,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:38:25,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:25,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 21:38:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:25,961 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-12-13 21:38:25,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:38:25,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306333459] [2022-12-13 21:38:25,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306333459] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:38:25,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:38:25,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:38:25,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512286687] [2022-12-13 21:38:25,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:38:25,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:38:25,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:38:25,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:38:25,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:38:25,963 INFO L87 Difference]: Start difference. First operand 48807 states and 64695 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 21:38:28,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:38:28,717 INFO L93 Difference]: Finished difference Result 86589 states and 113654 transitions. [2022-12-13 21:38:28,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:38:28,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 161 [2022-12-13 21:38:28,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:38:28,802 INFO L225 Difference]: With dead ends: 86589 [2022-12-13 21:38:28,803 INFO L226 Difference]: Without dead ends: 39919 [2022-12-13 21:38:28,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:38:28,864 INFO L413 NwaCegarLoop]: 4086 mSDtfsCounter, 304 mSDsluCounter, 12018 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 16104 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:38:28,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 16104 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 21:38:28,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39919 states. [2022-12-13 21:38:31,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39919 to 37269. [2022-12-13 21:38:31,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37269 states, 32230 states have (on average 1.3190505739993794) internal successors, (42513), 32868 states have internal predecessors, (42513), 2429 states have call successors, (2429), 1857 states have call predecessors, (2429), 2608 states have return successors, (4799), 2559 states have call predecessors, (4799), 2427 states have call successors, (4799) [2022-12-13 21:38:31,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37269 states to 37269 states and 49741 transitions. [2022-12-13 21:38:31,406 INFO L78 Accepts]: Start accepts. Automaton has 37269 states and 49741 transitions. Word has length 161 [2022-12-13 21:38:31,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:38:31,406 INFO L495 AbstractCegarLoop]: Abstraction has 37269 states and 49741 transitions. [2022-12-13 21:38:31,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 21:38:31,407 INFO L276 IsEmpty]: Start isEmpty. Operand 37269 states and 49741 transitions. [2022-12-13 21:38:31,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-12-13 21:38:31,430 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:38:31,430 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:38:31,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 21:38:31,430 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:38:31,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:38:31,430 INFO L85 PathProgramCache]: Analyzing trace with hash -22034244, now seen corresponding path program 1 times [2022-12-13 21:38:31,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:38:31,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472888953] [2022-12-13 21:38:31,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:38:31,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:38:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:31,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:38:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:31,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:38:31,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:31,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:38:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:31,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:38:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:31,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:38:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:31,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 21:38:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:31,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 21:38:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:31,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:38:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:31,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 21:38:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:31,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:38:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:31,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-12-13 21:38:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:31,529 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-12-13 21:38:31,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:38:31,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472888953] [2022-12-13 21:38:31,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472888953] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:38:31,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033234692] [2022-12-13 21:38:31,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:38:31,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:38:31,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:38:31,531 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:38:31,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 21:38:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:31,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 21:38:31,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:38:31,641 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 21:38:31,641 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:38:31,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033234692] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:38:31,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:38:31,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 21:38:31,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729337263] [2022-12-13 21:38:31,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:38:31,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:38:31,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:38:31,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:38:31,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:38:31,642 INFO L87 Difference]: Start difference. First operand 37269 states and 49741 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 21:38:33,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:38:33,902 INFO L93 Difference]: Finished difference Result 61331 states and 83325 transitions. [2022-12-13 21:38:33,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:38:33,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 163 [2022-12-13 21:38:33,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:38:33,971 INFO L225 Difference]: With dead ends: 61331 [2022-12-13 21:38:33,971 INFO L226 Difference]: Without dead ends: 37441 [2022-12-13 21:38:34,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:38:34,005 INFO L413 NwaCegarLoop]: 4252 mSDtfsCounter, 142 mSDsluCounter, 4127 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 8379 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:38:34,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 8379 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:38:34,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37441 states. [2022-12-13 21:38:36,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37441 to 37269. [2022-12-13 21:38:36,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37269 states, 32230 states have (on average 1.2976419484951909) internal successors, (41823), 32868 states have internal predecessors, (41823), 2429 states have call successors, (2429), 1857 states have call predecessors, (2429), 2608 states have return successors, (4799), 2559 states have call predecessors, (4799), 2427 states have call successors, (4799) [2022-12-13 21:38:36,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37269 states to 37269 states and 49051 transitions. [2022-12-13 21:38:36,434 INFO L78 Accepts]: Start accepts. Automaton has 37269 states and 49051 transitions. Word has length 163 [2022-12-13 21:38:36,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:38:36,435 INFO L495 AbstractCegarLoop]: Abstraction has 37269 states and 49051 transitions. [2022-12-13 21:38:36,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 21:38:36,435 INFO L276 IsEmpty]: Start isEmpty. Operand 37269 states and 49051 transitions. [2022-12-13 21:38:36,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-12-13 21:38:36,459 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:38:36,459 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:38:36,463 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-13 21:38:36,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:38:36,660 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:38:36,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:38:36,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1309860060, now seen corresponding path program 1 times [2022-12-13 21:38:36,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:38:36,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035809154] [2022-12-13 21:38:36,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:38:36,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:38:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:36,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:38:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:36,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:38:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:36,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:38:36,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:36,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:38:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:36,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:38:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:36,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 21:38:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:36,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 21:38:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:36,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:38:36,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:36,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 21:38:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:36,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:38:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:36,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-12-13 21:38:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:36,768 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-12-13 21:38:36,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:38:36,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035809154] [2022-12-13 21:38:36,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035809154] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:38:36,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751384672] [2022-12-13 21:38:36,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:38:36,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:38:36,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:38:36,769 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:38:36,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 21:38:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:36,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 21:38:36,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:38:36,875 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-13 21:38:36,875 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:38:36,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751384672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:38:36,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:38:36,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 21:38:36,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327839233] [2022-12-13 21:38:36,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:38:36,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:38:36,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:38:36,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:38:36,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:38:36,877 INFO L87 Difference]: Start difference. First operand 37269 states and 49051 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 21:38:38,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:38:38,904 INFO L93 Difference]: Finished difference Result 64497 states and 85583 transitions. [2022-12-13 21:38:38,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:38:38,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 163 [2022-12-13 21:38:38,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:38:38,962 INFO L225 Difference]: With dead ends: 64497 [2022-12-13 21:38:38,962 INFO L226 Difference]: Without dead ends: 31829 [2022-12-13 21:38:39,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:38:39,005 INFO L413 NwaCegarLoop]: 4147 mSDtfsCounter, 4122 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4122 SdHoareTripleChecker+Valid, 4179 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:38:39,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4122 Valid, 4179 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:38:39,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31829 states. [2022-12-13 21:38:41,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31829 to 30585. [2022-12-13 21:38:41,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30585 states, 26586 states have (on average 1.274467764989092) internal successors, (33883), 27081 states have internal predecessors, (33883), 1933 states have call successors, (1933), 1481 states have call predecessors, (1933), 2064 states have return successors, (3537), 2030 states have call predecessors, (3537), 1931 states have call successors, (3537) [2022-12-13 21:38:41,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30585 states to 30585 states and 39353 transitions. [2022-12-13 21:38:41,077 INFO L78 Accepts]: Start accepts. Automaton has 30585 states and 39353 transitions. Word has length 163 [2022-12-13 21:38:41,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:38:41,077 INFO L495 AbstractCegarLoop]: Abstraction has 30585 states and 39353 transitions. [2022-12-13 21:38:41,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 21:38:41,077 INFO L276 IsEmpty]: Start isEmpty. Operand 30585 states and 39353 transitions. [2022-12-13 21:38:41,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-12-13 21:38:41,092 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:38:41,092 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:38:41,097 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 21:38:41,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:38:41,294 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:38:41,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:38:41,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1003109181, now seen corresponding path program 1 times [2022-12-13 21:38:41,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:38:41,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745284947] [2022-12-13 21:38:41,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:38:41,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:38:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:41,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:38:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:41,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:38:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:41,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:38:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:41,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:38:41,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:41,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:38:41,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:41,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 21:38:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:41,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 21:38:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:41,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:38:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:41,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-12-13 21:38:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:41,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:38:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:41,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-12-13 21:38:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:41,430 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-13 21:38:41,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:38:41,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745284947] [2022-12-13 21:38:41,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745284947] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:38:41,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576166309] [2022-12-13 21:38:41,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:38:41,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:38:41,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:38:41,431 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:38:41,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 21:38:41,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:41,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 21:38:41,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:38:41,546 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 21:38:41,546 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:38:41,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576166309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:38:41,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:38:41,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 21:38:41,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675551846] [2022-12-13 21:38:41,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:38:41,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:38:41,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:38:41,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:38:41,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:38:41,548 INFO L87 Difference]: Start difference. First operand 30585 states and 39353 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 21:38:43,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:38:43,536 INFO L93 Difference]: Finished difference Result 50905 states and 66323 transitions. [2022-12-13 21:38:43,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:38:43,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 163 [2022-12-13 21:38:43,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:38:43,590 INFO L225 Difference]: With dead ends: 50905 [2022-12-13 21:38:43,590 INFO L226 Difference]: Without dead ends: 30725 [2022-12-13 21:38:43,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:38:43,617 INFO L413 NwaCegarLoop]: 4295 mSDtfsCounter, 135 mSDsluCounter, 4126 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 8421 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:38:43,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 8421 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:38:43,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30725 states. [2022-12-13 21:38:45,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30725 to 30585. [2022-12-13 21:38:45,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30585 states, 26586 states have (on average 1.2492665312570526) internal successors, (33213), 27081 states have internal predecessors, (33213), 1933 states have call successors, (1933), 1481 states have call predecessors, (1933), 2064 states have return successors, (3537), 2030 states have call predecessors, (3537), 1931 states have call successors, (3537) [2022-12-13 21:38:45,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30585 states to 30585 states and 38683 transitions. [2022-12-13 21:38:45,722 INFO L78 Accepts]: Start accepts. Automaton has 30585 states and 38683 transitions. Word has length 163 [2022-12-13 21:38:45,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:38:45,723 INFO L495 AbstractCegarLoop]: Abstraction has 30585 states and 38683 transitions. [2022-12-13 21:38:45,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 21:38:45,723 INFO L276 IsEmpty]: Start isEmpty. Operand 30585 states and 38683 transitions. [2022-12-13 21:38:45,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-12-13 21:38:45,738 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:38:45,738 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:38:45,743 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-13 21:38:45,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:38:45,939 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:38:45,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:38:45,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1504083699, now seen corresponding path program 1 times [2022-12-13 21:38:45,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:38:45,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225761089] [2022-12-13 21:38:45,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:38:45,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:38:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:45,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:38:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:46,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:38:46,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:46,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:38:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:46,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:38:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:46,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:38:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:46,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 21:38:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:46,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 21:38:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:46,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:38:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:46,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 21:38:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:46,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:38:46,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:46,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-12-13 21:38:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:46,062 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-12-13 21:38:46,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:38:46,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225761089] [2022-12-13 21:38:46,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225761089] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:38:46,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181596339] [2022-12-13 21:38:46,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:38:46,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:38:46,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:38:46,064 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:38:46,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 21:38:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:46,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 21:38:46,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:38:46,173 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-13 21:38:46,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:38:46,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181596339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:38:46,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:38:46,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 21:38:46,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597946657] [2022-12-13 21:38:46,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:38:46,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:38:46,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:38:46,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:38:46,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:38:46,175 INFO L87 Difference]: Start difference. First operand 30585 states and 38683 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 21:38:48,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:38:48,103 INFO L93 Difference]: Finished difference Result 44454 states and 56755 transitions. [2022-12-13 21:38:48,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:38:48,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 164 [2022-12-13 21:38:48,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:38:48,154 INFO L225 Difference]: With dead ends: 44454 [2022-12-13 21:38:48,154 INFO L226 Difference]: Without dead ends: 30633 [2022-12-13 21:38:48,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:38:48,177 INFO L413 NwaCegarLoop]: 4275 mSDtfsCounter, 156 mSDsluCounter, 4118 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 8393 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:38:48,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 8393 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:38:48,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30633 states. [2022-12-13 21:38:50,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30633 to 30585. [2022-12-13 21:38:50,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30585 states, 26586 states have (on average 1.2397126307078914) internal successors, (32959), 27081 states have internal predecessors, (32959), 1933 states have call successors, (1933), 1481 states have call predecessors, (1933), 2064 states have return successors, (3537), 2030 states have call predecessors, (3537), 1931 states have call successors, (3537) [2022-12-13 21:38:50,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30585 states to 30585 states and 38429 transitions. [2022-12-13 21:38:50,285 INFO L78 Accepts]: Start accepts. Automaton has 30585 states and 38429 transitions. Word has length 164 [2022-12-13 21:38:50,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:38:50,285 INFO L495 AbstractCegarLoop]: Abstraction has 30585 states and 38429 transitions. [2022-12-13 21:38:50,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 21:38:50,285 INFO L276 IsEmpty]: Start isEmpty. Operand 30585 states and 38429 transitions. [2022-12-13 21:38:50,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-13 21:38:50,301 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:38:50,301 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:38:50,305 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-13 21:38:50,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:38:50,502 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:38:50,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:38:50,503 INFO L85 PathProgramCache]: Analyzing trace with hash -465623340, now seen corresponding path program 1 times [2022-12-13 21:38:50,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:38:50,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460033662] [2022-12-13 21:38:50,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:38:50,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:38:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:50,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:38:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:50,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:38:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:50,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:38:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:50,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:38:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:50,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:38:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:50,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 21:38:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:50,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 21:38:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:50,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:38:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:50,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 21:38:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:50,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:38:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:50,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-12-13 21:38:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:50,591 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-12-13 21:38:50,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:38:50,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460033662] [2022-12-13 21:38:50,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460033662] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:38:50,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144099042] [2022-12-13 21:38:50,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:38:50,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:38:50,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:38:50,593 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:38:50,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 21:38:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:50,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 21:38:50,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:38:50,758 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-12-13 21:38:50,758 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:38:50,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144099042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:38:50,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:38:50,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-12-13 21:38:50,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102995687] [2022-12-13 21:38:50,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:38:50,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:38:50,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:38:50,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:38:50,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 21:38:50,760 INFO L87 Difference]: Start difference. First operand 30585 states and 38429 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 21:38:52,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:38:52,427 INFO L93 Difference]: Finished difference Result 41137 states and 51548 transitions. [2022-12-13 21:38:52,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:38:52,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2022-12-13 21:38:52,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:38:52,467 INFO L225 Difference]: With dead ends: 41137 [2022-12-13 21:38:52,468 INFO L226 Difference]: Without dead ends: 22531 [2022-12-13 21:38:52,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 21:38:52,494 INFO L413 NwaCegarLoop]: 4077 mSDtfsCounter, 4145 mSDsluCounter, 8103 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4154 SdHoareTripleChecker+Valid, 12180 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:38:52,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4154 Valid, 12180 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:38:52,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22531 states. [2022-12-13 21:38:54,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22531 to 22471. [2022-12-13 21:38:54,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22471 states, 19632 states have (on average 1.2434290953545233) internal successors, (24411), 19960 states have internal predecessors, (24411), 1389 states have call successors, (1389), 1057 states have call predecessors, (1389), 1448 states have return successors, (2451), 1457 states have call predecessors, (2451), 1387 states have call successors, (2451) [2022-12-13 21:38:54,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22471 states to 22471 states and 28251 transitions. [2022-12-13 21:38:54,067 INFO L78 Accepts]: Start accepts. Automaton has 22471 states and 28251 transitions. Word has length 165 [2022-12-13 21:38:54,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:38:54,067 INFO L495 AbstractCegarLoop]: Abstraction has 22471 states and 28251 transitions. [2022-12-13 21:38:54,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 21:38:54,067 INFO L276 IsEmpty]: Start isEmpty. Operand 22471 states and 28251 transitions. [2022-12-13 21:38:54,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-13 21:38:54,075 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:38:54,075 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:38:54,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-13 21:38:54,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 21:38:54,277 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:38:54,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:38:54,278 INFO L85 PathProgramCache]: Analyzing trace with hash 22423766, now seen corresponding path program 1 times [2022-12-13 21:38:54,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:38:54,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273951258] [2022-12-13 21:38:54,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:38:54,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:38:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:54,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:38:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:54,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:38:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:54,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:38:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:54,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:38:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:54,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:38:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:54,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 21:38:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:54,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 21:38:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:54,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:38:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:54,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 21:38:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:54,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:38:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:54,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-12-13 21:38:54,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:54,374 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-12-13 21:38:54,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:38:54,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273951258] [2022-12-13 21:38:54,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273951258] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:38:54,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058873508] [2022-12-13 21:38:54,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:38:54,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:38:54,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:38:54,375 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:38:54,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 21:38:54,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:54,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 21:38:54,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:38:54,491 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-12-13 21:38:54,491 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:38:54,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058873508] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:38:54,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:38:54,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-12-13 21:38:54,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155723157] [2022-12-13 21:38:54,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:38:54,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:38:54,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:38:54,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:38:54,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:38:54,493 INFO L87 Difference]: Start difference. First operand 22471 states and 28251 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 21:38:55,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:38:55,963 INFO L93 Difference]: Finished difference Result 36580 states and 45544 transitions. [2022-12-13 21:38:55,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:38:55,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2022-12-13 21:38:55,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:38:55,988 INFO L225 Difference]: With dead ends: 36580 [2022-12-13 21:38:55,988 INFO L226 Difference]: Without dead ends: 16241 [2022-12-13 21:38:56,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:38:56,011 INFO L413 NwaCegarLoop]: 4137 mSDtfsCounter, 87 mSDsluCounter, 12435 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 16572 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:38:56,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 16572 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:38:56,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16241 states. [2022-12-13 21:38:57,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16241 to 15449. [2022-12-13 21:38:57,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15449 states, 13501 states have (on average 1.2605732908673433) internal successors, (17019), 13712 states have internal predecessors, (17019), 958 states have call successors, (958), 737 states have call predecessors, (958), 988 states have return successors, (1535), 1001 states have call predecessors, (1535), 956 states have call successors, (1535) [2022-12-13 21:38:57,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15449 states to 15449 states and 19512 transitions. [2022-12-13 21:38:57,074 INFO L78 Accepts]: Start accepts. Automaton has 15449 states and 19512 transitions. Word has length 165 [2022-12-13 21:38:57,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:38:57,074 INFO L495 AbstractCegarLoop]: Abstraction has 15449 states and 19512 transitions. [2022-12-13 21:38:57,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 21:38:57,074 INFO L276 IsEmpty]: Start isEmpty. Operand 15449 states and 19512 transitions. [2022-12-13 21:38:57,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-13 21:38:57,079 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:38:57,079 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:38:57,084 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-13 21:38:57,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-13 21:38:57,281 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:38:57,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:38:57,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1805871025, now seen corresponding path program 1 times [2022-12-13 21:38:57,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:38:57,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037674081] [2022-12-13 21:38:57,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:38:57,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:38:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:57,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:38:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:57,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:38:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:57,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:38:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:57,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:38:57,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:57,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:38:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:57,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 21:38:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:57,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 21:38:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:57,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:38:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:57,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-12-13 21:38:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:57,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:38:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:57,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-12-13 21:38:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:57,383 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-12-13 21:38:57,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:38:57,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037674081] [2022-12-13 21:38:57,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037674081] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:38:57,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858745198] [2022-12-13 21:38:57,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:38:57,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:38:57,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:38:57,384 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:38:57,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 21:38:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:57,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 21:38:57,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:38:57,473 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-12-13 21:38:57,473 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:38:57,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858745198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:38:57,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:38:57,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-12-13 21:38:57,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221777830] [2022-12-13 21:38:57,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:38:57,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:38:57,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:38:57,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:38:57,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:38:57,475 INFO L87 Difference]: Start difference. First operand 15449 states and 19512 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 21:38:58,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:38:58,423 INFO L93 Difference]: Finished difference Result 26714 states and 33036 transitions. [2022-12-13 21:38:58,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:38:58,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2022-12-13 21:38:58,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:38:58,446 INFO L225 Difference]: With dead ends: 26714 [2022-12-13 21:38:58,446 INFO L226 Difference]: Without dead ends: 13397 [2022-12-13 21:38:58,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:38:58,463 INFO L413 NwaCegarLoop]: 4136 mSDtfsCounter, 49 mSDsluCounter, 12422 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 16558 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:38:58,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 16558 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:38:58,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13397 states. [2022-12-13 21:38:59,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13397 to 13101. [2022-12-13 21:38:59,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13101 states, 11462 states have (on average 1.265834932821497) internal successors, (14509), 11623 states have internal predecessors, (14509), 815 states have call successors, (815), 621 states have call predecessors, (815), 822 states have return successors, (1201), 858 states have call predecessors, (1201), 813 states have call successors, (1201) [2022-12-13 21:38:59,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13101 states to 13101 states and 16525 transitions. [2022-12-13 21:38:59,349 INFO L78 Accepts]: Start accepts. Automaton has 13101 states and 16525 transitions. Word has length 165 [2022-12-13 21:38:59,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:38:59,349 INFO L495 AbstractCegarLoop]: Abstraction has 13101 states and 16525 transitions. [2022-12-13 21:38:59,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 21:38:59,350 INFO L276 IsEmpty]: Start isEmpty. Operand 13101 states and 16525 transitions. [2022-12-13 21:38:59,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-13 21:38:59,353 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:38:59,353 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:38:59,358 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-13 21:38:59,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:38:59,555 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:38:59,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:38:59,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1637482603, now seen corresponding path program 1 times [2022-12-13 21:38:59,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:38:59,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191754192] [2022-12-13 21:38:59,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:38:59,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:38:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:59,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:38:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:59,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:38:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:59,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:38:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:59,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:38:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:59,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:38:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:59,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 21:38:59,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:59,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 21:38:59,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:59,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:38:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:59,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-12-13 21:38:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:59,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:38:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:59,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-12-13 21:38:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:59,659 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-12-13 21:38:59,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:38:59,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191754192] [2022-12-13 21:38:59,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191754192] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:38:59,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562340423] [2022-12-13 21:38:59,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:38:59,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:38:59,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:38:59,661 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:38:59,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 21:38:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:38:59,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 21:38:59,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:38:59,753 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-13 21:38:59,753 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:38:59,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562340423] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:38:59,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:38:59,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-12-13 21:38:59,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717080648] [2022-12-13 21:38:59,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:38:59,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:38:59,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:38:59,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:38:59,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:38:59,755 INFO L87 Difference]: Start difference. First operand 13101 states and 16525 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 21:39:00,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:39:00,242 INFO L93 Difference]: Finished difference Result 18414 states and 22680 transitions. [2022-12-13 21:39:00,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:39:00,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2022-12-13 21:39:00,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:39:00,251 INFO L225 Difference]: With dead ends: 18414 [2022-12-13 21:39:00,251 INFO L226 Difference]: Without dead ends: 5409 [2022-12-13 21:39:00,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:39:00,262 INFO L413 NwaCegarLoop]: 4136 mSDtfsCounter, 10 mSDsluCounter, 12407 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 16543 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:39:00,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 16543 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:39:00,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5409 states. [2022-12-13 21:39:00,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5409 to 5409. [2022-12-13 21:39:00,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5409 states, 4913 states have (on average 1.431915326684307) internal successors, (7035), 4936 states have internal predecessors, (7035), 278 states have call successors, (278), 201 states have call predecessors, (278), 216 states have return successors, (301), 273 states have call predecessors, (301), 276 states have call successors, (301) [2022-12-13 21:39:00,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5409 states to 5409 states and 7614 transitions. [2022-12-13 21:39:00,555 INFO L78 Accepts]: Start accepts. Automaton has 5409 states and 7614 transitions. Word has length 165 [2022-12-13 21:39:00,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:39:00,556 INFO L495 AbstractCegarLoop]: Abstraction has 5409 states and 7614 transitions. [2022-12-13 21:39:00,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 21:39:00,556 INFO L276 IsEmpty]: Start isEmpty. Operand 5409 states and 7614 transitions. [2022-12-13 21:39:00,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-12-13 21:39:00,558 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:39:00,558 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:39:00,562 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-13 21:39:00,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 21:39:00,759 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:39:00,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:39:00,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1365063130, now seen corresponding path program 1 times [2022-12-13 21:39:00,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:39:00,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294807243] [2022-12-13 21:39:00,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:39:00,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:39:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:39:00,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:39:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:39:00,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:39:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:39:00,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:39:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:39:00,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:39:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:39:00,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:39:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:39:00,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 21:39:00,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:39:00,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 21:39:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:39:00,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:39:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:39:00,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 21:39:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:39:00,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:39:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:39:00,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-12-13 21:39:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:39:00,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:39:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:39:00,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-12-13 21:39:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:39:00,927 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-12-13 21:39:00,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:39:00,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294807243] [2022-12-13 21:39:00,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294807243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:39:00,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:39:00,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:39:00,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495514102] [2022-12-13 21:39:00,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:39:00,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:39:00,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:39:00,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:39:00,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:39:00,928 INFO L87 Difference]: Start difference. First operand 5409 states and 7614 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-12-13 21:39:01,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:39:01,890 INFO L93 Difference]: Finished difference Result 5627 states and 7839 transitions. [2022-12-13 21:39:01,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 21:39:01,890 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 203 [2022-12-13 21:39:01,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:39:01,900 INFO L225 Difference]: With dead ends: 5627 [2022-12-13 21:39:01,900 INFO L226 Difference]: Without dead ends: 5624 [2022-12-13 21:39:01,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-12-13 21:39:01,903 INFO L413 NwaCegarLoop]: 4181 mSDtfsCounter, 4658 mSDsluCounter, 16403 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4691 SdHoareTripleChecker+Valid, 20584 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 21:39:01,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4691 Valid, 20584 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 21:39:01,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5624 states. [2022-12-13 21:39:02,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5624 to 5408. [2022-12-13 21:39:02,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5408 states, 4913 states have (on average 1.4311011601872583) internal successors, (7031), 4935 states have internal predecessors, (7031), 277 states have call successors, (277), 201 states have call predecessors, (277), 216 states have return successors, (301), 273 states have call predecessors, (301), 276 states have call successors, (301) [2022-12-13 21:39:02,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5408 states to 5408 states and 7609 transitions. [2022-12-13 21:39:02,226 INFO L78 Accepts]: Start accepts. Automaton has 5408 states and 7609 transitions. Word has length 203 [2022-12-13 21:39:02,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:39:02,226 INFO L495 AbstractCegarLoop]: Abstraction has 5408 states and 7609 transitions. [2022-12-13 21:39:02,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-12-13 21:39:02,227 INFO L276 IsEmpty]: Start isEmpty. Operand 5408 states and 7609 transitions. [2022-12-13 21:39:02,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-12-13 21:39:02,229 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:39:02,229 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:39:02,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 21:39:02,229 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:39:02,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:39:02,229 INFO L85 PathProgramCache]: Analyzing trace with hash -575528242, now seen corresponding path program 1 times [2022-12-13 21:39:02,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:39:02,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168490120] [2022-12-13 21:39:02,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:39:02,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:39:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:39:02,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 21:39:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:39:02,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:39:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:39:02,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:39:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:39:02,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:39:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:39:02,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:39:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:39:02,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 21:39:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:39:02,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 21:39:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:39:02,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:39:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:39:02,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 21:39:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:39:02,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:39:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:39:02,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-12-13 21:39:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:39:02,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 21:39:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:39:02,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-12-13 21:39:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:39:02,291 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2022-12-13 21:39:02,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:39:02,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168490120] [2022-12-13 21:39:02,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168490120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:39:02,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:39:02,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:39:02,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004706556] [2022-12-13 21:39:02,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:39:02,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:39:02,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:39:02,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:39:02,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:39:02,292 INFO L87 Difference]: Start difference. First operand 5408 states and 7609 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 21:39:02,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:39:02,962 INFO L93 Difference]: Finished difference Result 7451 states and 9980 transitions. [2022-12-13 21:39:02,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:39:02,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 207 [2022-12-13 21:39:02,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:39:02,972 INFO L225 Difference]: With dead ends: 7451 [2022-12-13 21:39:02,972 INFO L226 Difference]: Without dead ends: 6072 [2022-12-13 21:39:02,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:39:02,975 INFO L413 NwaCegarLoop]: 4155 mSDtfsCounter, 199 mSDsluCounter, 12202 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 16357 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:39:02,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 16357 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 21:39:02,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6072 states. [2022-12-13 21:39:03,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6072 to 5412. [2022-12-13 21:39:03,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5412 states, 4917 states have (on average 1.4307504575960952) internal successors, (7035), 4939 states have internal predecessors, (7035), 277 states have call successors, (277), 201 states have call predecessors, (277), 216 states have return successors, (301), 273 states have call predecessors, (301), 276 states have call successors, (301) [2022-12-13 21:39:03,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5412 states to 5412 states and 7613 transitions. [2022-12-13 21:39:03,276 INFO L78 Accepts]: Start accepts. Automaton has 5412 states and 7613 transitions. Word has length 207 [2022-12-13 21:39:03,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:39:03,277 INFO L495 AbstractCegarLoop]: Abstraction has 5412 states and 7613 transitions. [2022-12-13 21:39:03,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 21:39:03,277 INFO L276 IsEmpty]: Start isEmpty. Operand 5412 states and 7613 transitions. [2022-12-13 21:39:03,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-13 21:39:03,280 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:39:03,280 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:39:03,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 21:39:03,280 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:39:03,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:39:03,280 INFO L85 PathProgramCache]: Analyzing trace with hash 567683991, now seen corresponding path program 1 times [2022-12-13 21:39:03,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:39:03,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001477223] [2022-12-13 21:39:03,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:39:03,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:39:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:39:03,291 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 21:39:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:39:03,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 21:39:03,371 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 21:39:03,372 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-12-13 21:39:03,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-12-13 21:39:03,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 21:39:03,376 INFO L445 BasicCegarLoop]: Path program 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] [2022-12-13 21:39:03,379 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 21:39:03,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:39:03 BoogieIcfgContainer [2022-12-13 21:39:03,505 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 21:39:03,505 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 21:39:03,505 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 21:39:03,505 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 21:39:03,506 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:37:32" (3/4) ... [2022-12-13 21:39:03,507 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 21:39:03,589 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 21:39:03,589 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 21:39:03,590 INFO L158 Benchmark]: Toolchain (without parser) took 99658.00ms. Allocated memory was 151.0MB in the beginning and 4.7GB in the end (delta: 4.6GB). Free memory was 82.6MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 3.3GB. Max. memory is 16.1GB. [2022-12-13 21:39:03,590 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 107.0MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 21:39:03,590 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2411.25ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 82.2MB in the beginning and 84.8MB in the end (delta: -2.6MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. [2022-12-13 21:39:03,590 INFO L158 Benchmark]: Boogie Procedure Inliner took 308.28ms. Allocated memory was 182.5MB in the beginning and 220.2MB in the end (delta: 37.7MB). Free memory was 84.8MB in the beginning and 77.5MB in the end (delta: 7.3MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. [2022-12-13 21:39:03,590 INFO L158 Benchmark]: Boogie Preprocessor took 302.56ms. Allocated memory was 220.2MB in the beginning and 358.6MB in the end (delta: 138.4MB). Free memory was 77.5MB in the beginning and 214.7MB in the end (delta: -137.2MB). Peak memory consumption was 50.8MB. Max. memory is 16.1GB. [2022-12-13 21:39:03,590 INFO L158 Benchmark]: RCFGBuilder took 5301.96ms. Allocated memory was 358.6MB in the beginning and 734.0MB in the end (delta: 375.4MB). Free memory was 214.7MB in the beginning and 531.2MB in the end (delta: -316.5MB). Peak memory consumption was 286.4MB. Max. memory is 16.1GB. [2022-12-13 21:39:03,591 INFO L158 Benchmark]: TraceAbstraction took 91243.38ms. Allocated memory was 734.0MB in the beginning and 4.7GB in the end (delta: 4.0GB). Free memory was 531.2MB in the beginning and 1.4GB in the end (delta: -860.3MB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB. [2022-12-13 21:39:03,591 INFO L158 Benchmark]: Witness Printer took 83.97ms. Allocated memory is still 4.7GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-12-13 21:39:03,592 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.12ms. Allocated memory is still 107.0MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2411.25ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 82.2MB in the beginning and 84.8MB in the end (delta: -2.6MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 308.28ms. Allocated memory was 182.5MB in the beginning and 220.2MB in the end (delta: 37.7MB). Free memory was 84.8MB in the beginning and 77.5MB in the end (delta: 7.3MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 302.56ms. Allocated memory was 220.2MB in the beginning and 358.6MB in the end (delta: 138.4MB). Free memory was 77.5MB in the beginning and 214.7MB in the end (delta: -137.2MB). Peak memory consumption was 50.8MB. Max. memory is 16.1GB. * RCFGBuilder took 5301.96ms. Allocated memory was 358.6MB in the beginning and 734.0MB in the end (delta: 375.4MB). Free memory was 214.7MB in the beginning and 531.2MB in the end (delta: -316.5MB). Peak memory consumption was 286.4MB. Max. memory is 16.1GB. * TraceAbstraction took 91243.38ms. Allocated memory was 734.0MB in the beginning and 4.7GB in the end (delta: 4.0GB). Free memory was 531.2MB in the beginning and 1.4GB in the end (delta: -860.3MB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB. * Witness Printer took 83.97ms. Allocated memory is still 4.7GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. 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 - CounterExampleResult [Line: 11173]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int d= 4; [L34] int c= 3; [L35] int e= 5; [L36] int a= 1; [L37] int f= 6; [L38] int b= 2; [L40] int a9 = 18; [L41] int a27 = 1; [L42] int a2 = 10; [L43] int a16 = 1; [L44] int a15 = 1; [L45] int a12 = 4; [L46] int a25 = 1; [L47] int a20 = 5; [L11177] int m_pc = 0; [L11178] int t1_pc = 0; [L11179] int t2_pc = 0; [L11180] int m_st ; [L11181] int t1_st ; [L11182] int t2_st ; [L11183] int m_i ; [L11184] int t1_i ; [L11185] int t2_i ; [L11186] int M_E = 2; [L11187] int T1_E = 2; [L11188] int T2_E = 2; [L11189] int E_M = 2; [L11190] int E_1 = 2; [L11191] int E_2 = 2; [L11196] int token ; [L11198] int local ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L11776] COND FALSE !(__VERIFIER_nondet_int()) [L11779] CALL main2() [L11763] int __retres1 ; [L11767] CALL init_model() [L11677] m_i = 1 [L11678] t1_i = 1 [L11679] t2_i = 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11767] RET init_model() [L11768] CALL start_simulation() [L11704] int kernel_st ; [L11705] int tmp ; [L11706] int tmp___0 ; [L11710] kernel_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11711] FCALL update_channels() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11712] CALL init_threads() [L11396] COND TRUE m_i == 1 [L11397] m_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11401] COND TRUE t1_i == 1 [L11402] t1_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11406] COND TRUE t2_i == 1 [L11407] t2_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11712] RET init_threads() [L11713] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11509] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11514] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11519] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11524] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11529] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11534] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11713] RET fire_delta_events() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11714] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11331] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11341] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11343] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11350] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11360] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11362] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11369] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11379] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11381] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L11714] RET activate_threads() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11715] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11547] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11552] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11557] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11562] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11567] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11572] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11715] RET reset_delta_events() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11718] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11721] kernel_st = 1 [L11722] CALL eval() [L11442] int tmp ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11446] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11449] CALL, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11416] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11419] COND TRUE m_st == 0 [L11420] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11437] return (__retres1); VAL [\result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11449] RET, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11449] tmp = exists_runnable_thread() [L11451] COND TRUE \read(tmp) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L11456] COND TRUE m_st == 0 [L11457] int tmp_ndt_1; [L11458] tmp_ndt_1 = __VERIFIER_nondet_int() [L11459] COND FALSE !(\read(tmp_ndt_1)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L11470] COND TRUE t1_st == 0 [L11471] int tmp_ndt_2; [L11472] tmp_ndt_2 = __VERIFIER_nondet_int() [L11473] COND TRUE \read(tmp_ndt_2) [L11475] t1_st = 1 [L11476] CALL transmit1() [L11259] COND TRUE t1_pc == 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11270] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11272] t1_pc = 1 [L11273] t1_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11476] RET transmit1() [L11484] COND TRUE t2_st == 0 [L11485] int tmp_ndt_3; [L11486] tmp_ndt_3 = __VERIFIER_nondet_int() [L11487] COND TRUE \read(tmp_ndt_3) [L11489] t2_st = 1 [L11490] CALL transmit2() [L11295] COND TRUE t2_pc == 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L11306] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L11308] t2_pc = 1 [L11309] t2_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11490] RET transmit2() [L11446] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=1, token=0] [L11449] CALL, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11416] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11419] COND TRUE m_st == 0 [L11420] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11437] return (__retres1); VAL [\result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11449] RET, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=1, token=0] [L11449] tmp = exists_runnable_thread() [L11451] COND TRUE \read(tmp) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=1, token=0] [L11456] COND TRUE m_st == 0 [L11457] int tmp_ndt_1; [L11458] tmp_ndt_1 = __VERIFIER_nondet_int() [L11459] COND TRUE \read(tmp_ndt_1) [L11461] m_st = 1 [L11462] CALL master() [L11201] int tmp_var = __VERIFIER_nondet_int(); [L11203] COND TRUE m_pc == 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L11214] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L11217] token = __VERIFIER_nondet_int() [L11218] local = token [L11219] E_1 = 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L11220] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11620] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11331] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11341] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11343] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11350] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11351] COND TRUE E_1 == 1 [L11352] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11362] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND TRUE \read(tmp___0) [L11599] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=0] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11369] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11370] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11379] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11381] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L11620] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11220] RET immediate_notify() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L11221] E_1 = 2 [L11222] m_pc = 1 [L11223] m_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L11462] RET master() [L11470] COND TRUE t1_st == 0 [L11471] int tmp_ndt_2; [L11472] tmp_ndt_2 = __VERIFIER_nondet_int() [L11473] COND TRUE \read(tmp_ndt_2) [L11475] t1_st = 1 [L11476] CALL transmit1() [L11259] COND FALSE !(t1_pc == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11262] COND TRUE t1_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11278] token += 1 [L11279] E_2 = 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11280] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11620] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11331] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11332] COND FALSE !(E_M == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11341] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11343] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=1] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11350] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11351] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11360] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11362] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=1] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11369] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11370] COND TRUE E_2 == 1 [L11371] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11381] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND TRUE \read(tmp___1) [L11607] t2_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1, token=1] [L11620] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11280] RET immediate_notify() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11281] E_2 = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11270] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11272] t1_pc = 1 [L11273] t1_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11476] RET transmit1() [L11484] COND TRUE t2_st == 0 [L11485] int tmp_ndt_3; [L11486] tmp_ndt_3 = __VERIFIER_nondet_int() [L11487] COND TRUE \read(tmp_ndt_3) [L11489] t2_st = 1 [L11490] CALL transmit2() [L11295] COND FALSE !(t2_pc == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L11298] COND TRUE t2_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L11314] token += 1 [L11315] E_M = 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11316] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11620] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11331] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11332] COND TRUE E_M == 1 [L11333] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11343] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND TRUE \read(tmp) [L11591] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=2] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11350] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11351] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11360] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11362] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=2] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11369] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11370] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11379] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11381] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, tmp___1=0, token=2] [L11620] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11316] RET immediate_notify() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11317] E_M = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11306] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11308] t2_pc = 1 [L11309] t2_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11490] RET transmit2() [L11446] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, tmp_ndt_3=1, token=2] [L11449] CALL, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11416] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11419] COND TRUE m_st == 0 [L11420] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11437] return (__retres1); VAL [\result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11449] RET, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, tmp_ndt_3=1, token=2] [L11449] tmp = exists_runnable_thread() [L11451] COND TRUE \read(tmp) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, tmp_ndt_3=1, token=2] [L11456] COND TRUE m_st == 0 [L11457] int tmp_ndt_1; [L11458] tmp_ndt_1 = __VERIFIER_nondet_int() [L11459] COND TRUE \read(tmp_ndt_1) [L11461] m_st = 1 [L11462] CALL master() [L11201] int tmp_var = __VERIFIER_nondet_int(); [L11203] COND FALSE !(m_pc == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11206] COND TRUE m_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11228] COND FALSE !(token != local + 2) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11233] COND TRUE tmp_var <= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11234] COND TRUE tmp_var >= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11239] COND TRUE tmp_var <= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11240] COND TRUE tmp_var >= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11241] COND TRUE tmp_var == 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11242] CALL error() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11173] reach_error() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - UnprovableResult [Line: 11088]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 2323 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 91.1s, OverallIterations: 29, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.5s, AutomataDifference: 43.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 70130 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 69971 mSDsluCounter, 331372 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 214303 mSDsCounter, 611 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7190 IncrementalHoareTripleChecker+Invalid, 7801 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 611 mSolverCounterUnsat, 117069 mSDtfsCounter, 7190 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3579 GetRequests, 3352 SyntacticMatches, 6 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54053occurred in iteration=14, InterpolantAutomatonStates: 174, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 37.7s AutomataMinimizationTime, 28 MinimizatonAttempts, 24861 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 6960 NumberOfCodeBlocks, 6960 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 6706 ConstructedInterpolants, 0 QuantifiedInterpolants, 10861 SizeOfPredicates, 9 NumberOfNonLiveVariables, 9564 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 46 InterpolantComputations, 28 PerfectInterpolantSequences, 3368/3904 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 RESULT: Ultimate proved your program to be incorrect! [2022-12-13 21:39:03,604 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25c60a-6a00-4a01-88d2-7c6bc525818b/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE