./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc --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 eeee6bfce8612e4c7a8797e69f7e2696f4f49417b2ea41e83d66cf7e8ad61db4 --- 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-5e519f3 [2022-11-02 20:36:05,525 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:36:05,528 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:36:05,584 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:36:05,585 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:36:05,589 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:36:05,592 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:36:05,596 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:36:05,599 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:36:05,600 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:36:05,601 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:36:05,602 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:36:05,602 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:36:05,603 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:36:05,605 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:36:05,606 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:36:05,607 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:36:05,609 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:36:05,611 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:36:05,613 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:36:05,619 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:36:05,621 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:36:05,622 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:36:05,625 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:36:05,633 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:36:05,637 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:36:05,638 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:36:05,639 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:36:05,641 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:36:05,642 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:36:05,643 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:36:05,644 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:36:05,645 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:36:05,647 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:36:05,648 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:36:05,649 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:36:05,649 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:36:05,650 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:36:05,650 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:36:05,651 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:36:05,651 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:36:05,652 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:36:05,683 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:36:05,684 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:36:05,684 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:36:05,684 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:36:05,685 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:36:05,685 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:36:05,686 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:36:05,686 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:36:05,686 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:36:05,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:36:05,688 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:36:05,688 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:36:05,688 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:36:05,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:36:05,688 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:36:05,689 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:36:05,689 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:36:05,689 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:36:05,689 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:36:05,689 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:36:05,690 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:36:05,690 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:36:05,690 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:36:05,691 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:36:05,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:36:05,691 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:36:05,692 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:36:05,693 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:36:05,693 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:36:05,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:36:05,693 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:36:05,694 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:36:05,694 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:36:05,694 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/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_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc 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 -> eeee6bfce8612e4c7a8797e69f7e2696f4f49417b2ea41e83d66cf7e8ad61db4 [2022-11-02 20:36:06,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:36:06,042 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:36:06,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:36:06,046 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:36:06,046 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:36:06,048 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c [2022-11-02 20:36:06,139 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/data/ffc586456/2db2d3036e58429285eae1b50e42af1d/FLAGd5a823984 [2022-11-02 20:36:07,162 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:36:07,164 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c [2022-11-02 20:36:07,226 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/data/ffc586456/2db2d3036e58429285eae1b50e42af1d/FLAGd5a823984 [2022-11-02 20:36:07,489 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/data/ffc586456/2db2d3036e58429285eae1b50e42af1d [2022-11-02 20:36:07,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:36:07,495 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:36:07,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:36:07,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:36:07,503 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:36:07,504 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:36:07" (1/1) ... [2022-11-02 20:36:07,505 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aa67859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:07, skipping insertion in model container [2022-11-02 20:36:07,505 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:36:07" (1/1) ... [2022-11-02 20:36:07,514 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:36:07,749 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:36:10,068 WARN L230 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_2d05324b-14c3-4dd7-8552-536ae2e6d850/sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c[380593,380606] [2022-11-02 20:36:10,103 WARN L230 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_2d05324b-14c3-4dd7-8552-536ae2e6d850/sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c[383339,383352] [2022-11-02 20:36:10,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:36:10,300 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:36:11,541 WARN L230 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_2d05324b-14c3-4dd7-8552-536ae2e6d850/sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c[380593,380606] [2022-11-02 20:36:11,546 WARN L230 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_2d05324b-14c3-4dd7-8552-536ae2e6d850/sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c[383339,383352] [2022-11-02 20:36:11,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:36:11,623 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:36:11,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:11 WrapperNode [2022-11-02 20:36:11,624 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:36:11,625 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:36:11,625 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:36:11,626 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:36:11,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:11" (1/1) ... [2022-11-02 20:36:11,738 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:11" (1/1) ... [2022-11-02 20:36:12,168 INFO L138 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12566 [2022-11-02 20:36:12,169 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:36:12,170 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:36:12,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:36:12,170 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:36:12,180 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:11" (1/1) ... [2022-11-02 20:36:12,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:11" (1/1) ... [2022-11-02 20:36:12,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:11" (1/1) ... [2022-11-02 20:36:12,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:11" (1/1) ... [2022-11-02 20:36:12,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:11" (1/1) ... [2022-11-02 20:36:12,578 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:11" (1/1) ... [2022-11-02 20:36:12,611 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:11" (1/1) ... [2022-11-02 20:36:12,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:11" (1/1) ... [2022-11-02 20:36:12,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:36:12,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:36:12,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:36:12,778 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:36:12,783 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:11" (1/1) ... [2022-11-02 20:36:12,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:36:12,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:36:12,867 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:36:12,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:36:12,904 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-11-02 20:36:12,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:36:12,904 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-11-02 20:36:12,909 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-11-02 20:36:12,909 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-11-02 20:36:12,909 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-11-02 20:36:12,909 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-11-02 20:36:12,910 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-02 20:36:12,910 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-02 20:36:12,910 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-11-02 20:36:12,910 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-11-02 20:36:12,910 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-11-02 20:36:12,910 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-11-02 20:36:12,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:36:12,910 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-11-02 20:36:12,910 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-11-02 20:36:12,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:36:12,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:36:13,035 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:36:13,037 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:36:22,006 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:36:22,026 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:36:22,026 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-02 20:36:22,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:36:22 BoogieIcfgContainer [2022-11-02 20:36:22,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:36:22,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:36:22,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:36:22,036 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:36:22,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:36:07" (1/3) ... [2022-11-02 20:36:22,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3493a3a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:36:22, skipping insertion in model container [2022-11-02 20:36:22,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:11" (2/3) ... [2022-11-02 20:36:22,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3493a3a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:36:22, skipping insertion in model container [2022-11-02 20:36:22,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:36:22" (3/3) ... [2022-11-02 20:36:22,039 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.01.cil-2.c [2022-11-02 20:36:22,058 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:36:22,058 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 20:36:22,146 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:36:22,152 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;@719698b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:36:22,153 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-02 20:36:22,165 INFO L276 IsEmpty]: Start isEmpty. Operand has 2298 states, 2271 states have (on average 1.8590929106120653) internal successors, (4222), 2276 states have internal predecessors, (4222), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-02 20:36:22,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:36:22,176 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:22,177 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] [2022-11-02 20:36:22,177 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:36:22,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:22,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1417964819, now seen corresponding path program 1 times [2022-11-02 20:36:22,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:22,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339921603] [2022-11-02 20:36:22,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:22,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:22,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:36:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:22,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:36:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:22,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:36:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:22,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:36:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:22,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-02 20:36:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:22,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:22,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:22,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339921603] [2022-11-02 20:36:22,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339921603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:22,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:22,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:36:22,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610144225] [2022-11-02 20:36:22,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:22,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:36:22,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:22,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:36:22,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:36:22,807 INFO L87 Difference]: Start difference. First operand has 2298 states, 2271 states have (on average 1.8590929106120653) internal successors, (4222), 2276 states have internal predecessors, (4222), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (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-11-02 20:36:23,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:23,694 INFO L93 Difference]: Finished difference Result 4727 states and 8720 transitions. [2022-11-02 20:36:23,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:36:23,696 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (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 58 [2022-11-02 20:36:23,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:23,730 INFO L225 Difference]: With dead ends: 4727 [2022-11-02 20:36:23,731 INFO L226 Difference]: Without dead ends: 2368 [2022-11-02 20:36:23,742 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-11-02 20:36:23,745 INFO L413 NwaCegarLoop]: 4199 mSDtfsCounter, 4329 mSDsluCounter, 12380 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4337 SdHoareTripleChecker+Valid, 16579 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:36:23,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4337 Valid, 16579 Invalid, 494 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [80 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:36:23,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2022-11-02 20:36:23,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2325. [2022-11-02 20:36:23,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2325 states, 2283 states have (on average 1.838370565045992) internal successors, (4197), 2287 states have internal predecessors, (4197), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-11-02 20:36:23,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2325 states to 2325 states and 4252 transitions. [2022-11-02 20:36:23,893 INFO L78 Accepts]: Start accepts. Automaton has 2325 states and 4252 transitions. Word has length 58 [2022-11-02 20:36:23,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:23,894 INFO L495 AbstractCegarLoop]: Abstraction has 2325 states and 4252 transitions. [2022-11-02 20:36:23,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (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-11-02 20:36:23,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2325 states and 4252 transitions. [2022-11-02 20:36:23,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:36:23,897 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:23,897 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:36:23,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:36:23,898 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:36:23,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:23,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1082743281, now seen corresponding path program 1 times [2022-11-02 20:36:23,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:23,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443908545] [2022-11-02 20:36:23,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:23,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:24,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:36:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:24,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:36:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:24,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:36:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:24,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:36:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:24,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-02 20:36:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:24,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:24,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:24,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443908545] [2022-11-02 20:36:24,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443908545] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:24,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:24,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:36:24,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292447263] [2022-11-02 20:36:24,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:24,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:36:24,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:24,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:36:24,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:36:24,115 INFO L87 Difference]: Start difference. First operand 2325 states and 4252 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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-11-02 20:36:24,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:24,999 INFO L93 Difference]: Finished difference Result 2676 states and 4760 transitions. [2022-11-02 20:36:24,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:36:24,999 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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 58 [2022-11-02 20:36:25,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:25,018 INFO L225 Difference]: With dead ends: 2676 [2022-11-02 20:36:25,018 INFO L226 Difference]: Without dead ends: 2481 [2022-11-02 20:36:25,023 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-11-02 20:36:25,025 INFO L413 NwaCegarLoop]: 4200 mSDtfsCounter, 4245 mSDsluCounter, 16382 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4253 SdHoareTripleChecker+Valid, 20582 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:36:25,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4253 Valid, 20582 Invalid, 706 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [57 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:36:25,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2481 states. [2022-11-02 20:36:25,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2481 to 2415. [2022-11-02 20:36:25,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2415 states, 2356 states have (on average 1.8259762308998302) internal successors, (4302), 2361 states have internal predecessors, (4302), 37 states have call successors, (37), 19 states have call predecessors, (37), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2022-11-02 20:36:25,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2415 states to 2415 states and 4379 transitions. [2022-11-02 20:36:25,120 INFO L78 Accepts]: Start accepts. Automaton has 2415 states and 4379 transitions. Word has length 58 [2022-11-02 20:36:25,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:25,121 INFO L495 AbstractCegarLoop]: Abstraction has 2415 states and 4379 transitions. [2022-11-02 20:36:25,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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-11-02 20:36:25,122 INFO L276 IsEmpty]: Start isEmpty. Operand 2415 states and 4379 transitions. [2022-11-02 20:36:25,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:36:25,129 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:25,129 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] [2022-11-02 20:36:25,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:36:25,130 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:36:25,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:25,131 INFO L85 PathProgramCache]: Analyzing trace with hash -189256943, now seen corresponding path program 1 times [2022-11-02 20:36:25,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:25,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183725204] [2022-11-02 20:36:25,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:25,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:25,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:36:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:25,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:36:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:25,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:36:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:25,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:36:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:25,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-02 20:36:25,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:25,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:25,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:25,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183725204] [2022-11-02 20:36:25,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183725204] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:25,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:25,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:36:25,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286990535] [2022-11-02 20:36:25,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:25,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:36:25,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:25,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:36:25,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:36:25,341 INFO L87 Difference]: Start difference. First operand 2415 states and 4379 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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-11-02 20:36:26,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:26,382 INFO L93 Difference]: Finished difference Result 3027 states and 5257 transitions. [2022-11-02 20:36:26,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:36:26,382 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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 58 [2022-11-02 20:36:26,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:26,394 INFO L225 Difference]: With dead ends: 3027 [2022-11-02 20:36:26,394 INFO L226 Difference]: Without dead ends: 2742 [2022-11-02 20:36:26,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:36:26,398 INFO L413 NwaCegarLoop]: 4190 mSDtfsCounter, 4299 mSDsluCounter, 16374 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4309 SdHoareTripleChecker+Valid, 20564 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:36:26,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4309 Valid, 20564 Invalid, 709 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:36:26,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2742 states. [2022-11-02 20:36:26,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2742 to 2590. [2022-11-02 20:36:26,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2590 states, 2499 states have (on average 1.8043217286914766) internal successors, (4509), 2506 states have internal predecessors, (4509), 55 states have call successors, (55), 31 states have call predecessors, (55), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-11-02 20:36:26,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 4630 transitions. [2022-11-02 20:36:26,491 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 4630 transitions. Word has length 58 [2022-11-02 20:36:26,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:26,492 INFO L495 AbstractCegarLoop]: Abstraction has 2590 states and 4630 transitions. [2022-11-02 20:36:26,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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-11-02 20:36:26,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 4630 transitions. [2022-11-02 20:36:26,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:36:26,493 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:26,494 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] [2022-11-02 20:36:26,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:36:26,494 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:36:26,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:26,495 INFO L85 PathProgramCache]: Analyzing trace with hash 2056322511, now seen corresponding path program 1 times [2022-11-02 20:36:26,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:26,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415567168] [2022-11-02 20:36:26,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:26,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:26,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:36:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:26,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:36:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:26,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:36:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:26,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:36:26,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:26,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-02 20:36:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:26,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:26,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:26,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415567168] [2022-11-02 20:36:26,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415567168] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:26,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:26,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:36:26,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41364609] [2022-11-02 20:36:26,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:26,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:36:26,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:26,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:36:26,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:36:26,631 INFO L87 Difference]: Start difference. First operand 2590 states and 4630 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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-11-02 20:36:27,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:27,490 INFO L93 Difference]: Finished difference Result 3579 states and 6048 transitions. [2022-11-02 20:36:27,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:36:27,491 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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 58 [2022-11-02 20:36:27,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:27,504 INFO L225 Difference]: With dead ends: 3579 [2022-11-02 20:36:27,518 INFO L226 Difference]: Without dead ends: 3119 [2022-11-02 20:36:27,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:36:27,530 INFO L413 NwaCegarLoop]: 4191 mSDtfsCounter, 4242 mSDsluCounter, 16356 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4249 SdHoareTripleChecker+Valid, 20547 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:36:27,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4249 Valid, 20547 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:36:27,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3119 states. [2022-11-02 20:36:27,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3119 to 2889. [2022-11-02 20:36:27,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2889 states, 2740 states have (on average 1.7682481751824817) internal successors, (4845), 2751 states have internal predecessors, (4845), 87 states have call successors, (87), 53 states have call predecessors, (87), 60 states have return successors, (120), 92 states have call predecessors, (120), 85 states have call successors, (120) [2022-11-02 20:36:27,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 5052 transitions. [2022-11-02 20:36:27,693 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 5052 transitions. Word has length 58 [2022-11-02 20:36:27,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:27,701 INFO L495 AbstractCegarLoop]: Abstraction has 2889 states and 5052 transitions. [2022-11-02 20:36:27,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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-11-02 20:36:27,702 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 5052 transitions. [2022-11-02 20:36:27,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:36:27,705 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:27,706 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] [2022-11-02 20:36:27,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:36:27,706 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:36:27,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:27,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1158929233, now seen corresponding path program 1 times [2022-11-02 20:36:27,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:27,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578995362] [2022-11-02 20:36:27,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:27,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:27,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:36:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:27,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:36:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:27,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:36:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:27,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:36:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:27,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-02 20:36:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:27,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:27,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:27,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578995362] [2022-11-02 20:36:27,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578995362] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:27,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:27,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:36:27,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148559894] [2022-11-02 20:36:27,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:27,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:36:27,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:27,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:36:27,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:36:27,827 INFO L87 Difference]: Start difference. First operand 2889 states and 5052 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (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-11-02 20:36:28,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:28,587 INFO L93 Difference]: Finished difference Result 4253 states and 6998 transitions. [2022-11-02 20:36:28,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:36:28,588 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (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 58 [2022-11-02 20:36:28,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:28,605 INFO L225 Difference]: With dead ends: 4253 [2022-11-02 20:36:28,605 INFO L226 Difference]: Without dead ends: 3495 [2022-11-02 20:36:28,610 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-11-02 20:36:28,617 INFO L413 NwaCegarLoop]: 4225 mSDtfsCounter, 4354 mSDsluCounter, 12183 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4377 SdHoareTripleChecker+Valid, 16408 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:36:28,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4377 Valid, 16408 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:36:28,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3495 states. [2022-11-02 20:36:28,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3495 to 3290. [2022-11-02 20:36:28,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3290 states, 3058 states have (on average 1.723675604970569) internal successors, (5271), 3078 states have internal predecessors, (5271), 136 states have call successors, (136), 83 states have call predecessors, (136), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2022-11-02 20:36:28,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3290 states to 3290 states and 5586 transitions. [2022-11-02 20:36:28,776 INFO L78 Accepts]: Start accepts. Automaton has 3290 states and 5586 transitions. Word has length 58 [2022-11-02 20:36:28,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:28,776 INFO L495 AbstractCegarLoop]: Abstraction has 3290 states and 5586 transitions. [2022-11-02 20:36:28,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (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-11-02 20:36:28,777 INFO L276 IsEmpty]: Start isEmpty. Operand 3290 states and 5586 transitions. [2022-11-02 20:36:28,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-02 20:36:28,780 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:28,780 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:36:28,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:36:28,781 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:36:28,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:28,782 INFO L85 PathProgramCache]: Analyzing trace with hash 747002154, now seen corresponding path program 1 times [2022-11-02 20:36:28,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:28,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186297942] [2022-11-02 20:36:28,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:28,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:28,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:36:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:28,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:36:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:28,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:36:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:29,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:36:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:29,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-02 20:36:29,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:29,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-02 20:36:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:29,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:36:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:29,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:36:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:29,033 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 20:36:29,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:29,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186297942] [2022-11-02 20:36:29,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186297942] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:36:29,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663954521] [2022-11-02 20:36:29,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:29,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:36:29,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:36:29,038 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:36:29,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:36:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:29,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:36:29,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:36:29,215 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-02 20:36:29,215 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:36:29,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663954521] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:29,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:36:29,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-02 20:36:29,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358277385] [2022-11-02 20:36:29,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:29,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:36:29,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:29,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:36:29,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:36:29,219 INFO L87 Difference]: Start difference. First operand 3290 states and 5586 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-11-02 20:36:29,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:29,458 INFO L93 Difference]: Finished difference Result 5496 states and 8712 transitions. [2022-11-02 20:36:29,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:36:29,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 93 [2022-11-02 20:36:29,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:29,480 INFO L225 Difference]: With dead ends: 5496 [2022-11-02 20:36:29,481 INFO L226 Difference]: Without dead ends: 4338 [2022-11-02 20:36:29,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 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-11-02 20:36:29,487 INFO L413 NwaCegarLoop]: 4229 mSDtfsCounter, 114 mSDsluCounter, 4108 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 8337 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-11-02 20:36:29,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 8337 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:36:29,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4338 states. [2022-11-02 20:36:29,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4338 to 4338. [2022-11-02 20:36:29,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4338 states, 3897 states have (on average 1.6440851937387735) internal successors, (6407), 3930 states have internal predecessors, (6407), 255 states have call successors, (255), 161 states have call predecessors, (255), 184 states have return successors, (376), 262 states have call predecessors, (376), 253 states have call successors, (376) [2022-11-02 20:36:29,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4338 states to 4338 states and 7038 transitions. [2022-11-02 20:36:29,752 INFO L78 Accepts]: Start accepts. Automaton has 4338 states and 7038 transitions. Word has length 93 [2022-11-02 20:36:29,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:29,753 INFO L495 AbstractCegarLoop]: Abstraction has 4338 states and 7038 transitions. [2022-11-02 20:36:29,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-11-02 20:36:29,753 INFO L276 IsEmpty]: Start isEmpty. Operand 4338 states and 7038 transitions. [2022-11-02 20:36:29,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-02 20:36:29,761 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:29,761 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 20:36:29,797 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-02 20:36:29,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-02 20:36:29,987 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:36:29,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:29,987 INFO L85 PathProgramCache]: Analyzing trace with hash 385246456, now seen corresponding path program 1 times [2022-11-02 20:36:29,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:29,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276511335] [2022-11-02 20:36:29,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:29,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:30,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:36:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:30,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:36:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:30,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:36:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:30,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:36:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:30,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-02 20:36:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:30,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-02 20:36:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:30,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:36:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:30,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-02 20:36:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:30,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:36:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:30,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-02 20:36:30,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:30,203 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 20:36:30,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:30,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276511335] [2022-11-02 20:36:30,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276511335] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:36:30,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335010383] [2022-11-02 20:36:30,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:30,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:36:30,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:36:30,208 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:36:30,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:36:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:30,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:36:30,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:36:30,488 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-02 20:36:30,488 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:36:30,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335010383] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:30,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:36:30,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-11-02 20:36:30,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495718392] [2022-11-02 20:36:30,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:30,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:36:30,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:30,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:36:30,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:36:30,508 INFO L87 Difference]: Start difference. First operand 4338 states and 7038 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 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-11-02 20:36:30,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:30,870 INFO L93 Difference]: Finished difference Result 8608 states and 13011 transitions. [2022-11-02 20:36:30,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:36:30,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 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 119 [2022-11-02 20:36:30,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:30,925 INFO L225 Difference]: With dead ends: 8608 [2022-11-02 20:36:30,925 INFO L226 Difference]: Without dead ends: 6405 [2022-11-02 20:36:30,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:36:30,937 INFO L413 NwaCegarLoop]: 4141 mSDtfsCounter, 4038 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4038 SdHoareTripleChecker+Valid, 4273 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-11-02 20:36:30,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4038 Valid, 4273 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:36:30,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6405 states. [2022-11-02 20:36:31,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6405 to 6345. [2022-11-02 20:36:31,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6345 states, 5510 states have (on average 1.561705989110708) internal successors, (8605), 5572 states have internal predecessors, (8605), 475 states have call successors, (475), 311 states have call predecessors, (475), 358 states have return successors, (688), 477 states have call predecessors, (688), 473 states have call successors, (688) [2022-11-02 20:36:31,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6345 states to 6345 states and 9768 transitions. [2022-11-02 20:36:31,483 INFO L78 Accepts]: Start accepts. Automaton has 6345 states and 9768 transitions. Word has length 119 [2022-11-02 20:36:31,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:31,483 INFO L495 AbstractCegarLoop]: Abstraction has 6345 states and 9768 transitions. [2022-11-02 20:36:31,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 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-11-02 20:36:31,484 INFO L276 IsEmpty]: Start isEmpty. Operand 6345 states and 9768 transitions. [2022-11-02 20:36:31,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-02 20:36:31,494 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:31,495 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, 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-11-02 20:36:31,535 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:36:31,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:36:31,713 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:36:31,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:31,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1965387098, now seen corresponding path program 1 times [2022-11-02 20:36:31,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:31,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011029004] [2022-11-02 20:36:31,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:31,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:31,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:36:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:31,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:36:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:31,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:36:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:31,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:36:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:31,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-02 20:36:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:31,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:36:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:31,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-02 20:36:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:31,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:36:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:31,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:36:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:31,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:36:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:31,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-02 20:36:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:31,890 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-11-02 20:36:31,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:31,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011029004] [2022-11-02 20:36:31,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011029004] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:36:31,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183137164] [2022-11-02 20:36:31,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:31,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:36:31,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:36:31,892 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:36:31,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:36:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:32,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:36:32,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:36:32,063 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-02 20:36:32,063 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:36:32,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183137164] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:32,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:36:32,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-02 20:36:32,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564432481] [2022-11-02 20:36:32,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:32,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:36:32,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:32,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:36:32,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:36:32,066 INFO L87 Difference]: Start difference. First operand 6345 states and 9768 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (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-11-02 20:36:32,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:32,355 INFO L93 Difference]: Finished difference Result 9619 states and 14299 transitions. [2022-11-02 20:36:32,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:36:32,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (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 135 [2022-11-02 20:36:32,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:32,387 INFO L225 Difference]: With dead ends: 9619 [2022-11-02 20:36:32,387 INFO L226 Difference]: Without dead ends: 6673 [2022-11-02 20:36:32,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 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-11-02 20:36:32,400 INFO L413 NwaCegarLoop]: 4132 mSDtfsCounter, 4059 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4059 SdHoareTripleChecker+Valid, 4272 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-11-02 20:36:32,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4059 Valid, 4272 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:36:32,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6673 states. [2022-11-02 20:36:32,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6673 to 6635. [2022-11-02 20:36:32,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6635 states, 5768 states have (on average 1.535887656033287) internal successors, (8859), 5830 states have internal predecessors, (8859), 481 states have call successors, (481), 337 states have call predecessors, (481), 384 states have return successors, (720), 483 states have call predecessors, (720), 479 states have call successors, (720) [2022-11-02 20:36:32,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6635 states to 6635 states and 10060 transitions. [2022-11-02 20:36:32,762 INFO L78 Accepts]: Start accepts. Automaton has 6635 states and 10060 transitions. Word has length 135 [2022-11-02 20:36:32,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:32,763 INFO L495 AbstractCegarLoop]: Abstraction has 6635 states and 10060 transitions. [2022-11-02 20:36:32,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (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-11-02 20:36:32,763 INFO L276 IsEmpty]: Start isEmpty. Operand 6635 states and 10060 transitions. [2022-11-02 20:36:32,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-02 20:36:32,780 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:32,780 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, 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-11-02 20:36:32,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:36:32,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:36:32,995 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:36:32,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:32,995 INFO L85 PathProgramCache]: Analyzing trace with hash 946429697, now seen corresponding path program 1 times [2022-11-02 20:36:32,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:32,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232386701] [2022-11-02 20:36:32,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:32,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:33,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:36:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:33,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:36:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:33,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:36:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:33,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:36:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:33,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-02 20:36:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:33,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:36:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:33,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 20:36:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:33,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:36:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:33,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-02 20:36:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:33,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:36:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:33,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-02 20:36:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:33,170 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-02 20:36:33,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:33,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232386701] [2022-11-02 20:36:33,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232386701] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:36:33,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42885080] [2022-11-02 20:36:33,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:33,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:36:33,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:36:33,172 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:36:33,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:36:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:33,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:36:33,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:36:33,404 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 20:36:33,404 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:36:33,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42885080] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:33,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:36:33,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-02 20:36:33,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937845006] [2022-11-02 20:36:33,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:33,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:36:33,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:33,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:36:33,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:36:33,407 INFO L87 Difference]: Start difference. First operand 6635 states and 10060 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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-11-02 20:36:33,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:33,700 INFO L93 Difference]: Finished difference Result 9031 states and 13439 transitions. [2022-11-02 20:36:33,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:36:33,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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 136 [2022-11-02 20:36:33,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:33,725 INFO L225 Difference]: With dead ends: 9031 [2022-11-02 20:36:33,725 INFO L226 Difference]: Without dead ends: 6671 [2022-11-02 20:36:33,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 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-11-02 20:36:33,736 INFO L413 NwaCegarLoop]: 4217 mSDtfsCounter, 111 mSDsluCounter, 4099 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 8316 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-11-02 20:36:33,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 8316 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:36:33,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6671 states. [2022-11-02 20:36:34,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6671 to 6611. [2022-11-02 20:36:34,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6611 states, 5744 states have (on average 1.5217618384401115) internal successors, (8741), 5806 states have internal predecessors, (8741), 481 states have call successors, (481), 337 states have call predecessors, (481), 384 states have return successors, (720), 483 states have call predecessors, (720), 479 states have call successors, (720) [2022-11-02 20:36:34,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6611 states to 6611 states and 9942 transitions. [2022-11-02 20:36:34,088 INFO L78 Accepts]: Start accepts. Automaton has 6611 states and 9942 transitions. Word has length 136 [2022-11-02 20:36:34,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:34,088 INFO L495 AbstractCegarLoop]: Abstraction has 6611 states and 9942 transitions. [2022-11-02 20:36:34,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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-11-02 20:36:34,089 INFO L276 IsEmpty]: Start isEmpty. Operand 6611 states and 9942 transitions. [2022-11-02 20:36:34,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-02 20:36:34,100 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:34,100 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:36:34,137 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:36:34,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-02 20:36:34,314 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:36:34,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:34,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1815303137, now seen corresponding path program 1 times [2022-11-02 20:36:34,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:34,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646747569] [2022-11-02 20:36:34,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:34,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:34,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:36:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:34,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:36:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:34,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:36:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:34,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:36:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:34,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-02 20:36:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:34,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:36:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:34,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 20:36:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:34,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:36:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:34,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-02 20:36:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:34,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:36:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:34,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-02 20:36:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:34,455 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-02 20:36:34,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:34,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646747569] [2022-11-02 20:36:34,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646747569] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:36:34,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474124205] [2022-11-02 20:36:34,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:34,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:36:34,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:36:34,457 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:36:34,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:36:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:34,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:36:34,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:36:34,605 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-02 20:36:34,605 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:36:34,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474124205] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:34,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:36:34,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-02 20:36:34,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444190099] [2022-11-02 20:36:34,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:34,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:36:34,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:34,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:36:34,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:36:34,608 INFO L87 Difference]: Start difference. First operand 6611 states and 9942 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-11-02 20:36:34,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:34,940 INFO L93 Difference]: Finished difference Result 9935 states and 14498 transitions. [2022-11-02 20:36:34,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:36:34,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 136 [2022-11-02 20:36:34,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:34,958 INFO L225 Difference]: With dead ends: 9935 [2022-11-02 20:36:34,958 INFO L226 Difference]: Without dead ends: 5993 [2022-11-02 20:36:34,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 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-11-02 20:36:34,968 INFO L413 NwaCegarLoop]: 4112 mSDtfsCounter, 4089 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4089 SdHoareTripleChecker+Valid, 4136 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-11-02 20:36:34,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4089 Valid, 4136 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:36:34,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5993 states. [2022-11-02 20:36:35,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5993 to 5763. [2022-11-02 20:36:35,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5763 states, 5062 states have (on average 1.5205452390359542) internal successors, (7697), 5108 states have internal predecessors, (7697), 393 states have call successors, (393), 275 states have call predecessors, (393), 306 states have return successors, (510), 387 states have call predecessors, (510), 391 states have call successors, (510) [2022-11-02 20:36:35,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5763 states to 5763 states and 8600 transitions. [2022-11-02 20:36:35,262 INFO L78 Accepts]: Start accepts. Automaton has 5763 states and 8600 transitions. Word has length 136 [2022-11-02 20:36:35,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:35,263 INFO L495 AbstractCegarLoop]: Abstraction has 5763 states and 8600 transitions. [2022-11-02 20:36:35,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-11-02 20:36:35,263 INFO L276 IsEmpty]: Start isEmpty. Operand 5763 states and 8600 transitions. [2022-11-02 20:36:35,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-02 20:36:35,272 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:35,272 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:36:35,314 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:36:35,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:36:35,499 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:36:35,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:35,499 INFO L85 PathProgramCache]: Analyzing trace with hash 874736092, now seen corresponding path program 1 times [2022-11-02 20:36:35,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:35,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928002973] [2022-11-02 20:36:35,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:35,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:35,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:36:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:35,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:36:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:35,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:36:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:35,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:36:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:35,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-02 20:36:35,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:35,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:36:35,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:35,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 20:36:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:35,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:36:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:35,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-02 20:36:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:35,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:36:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:35,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-02 20:36:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:35,675 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-02 20:36:35,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:35,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928002973] [2022-11-02 20:36:35,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928002973] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:36:35,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691242024] [2022-11-02 20:36:35,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:35,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:36:35,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:36:35,677 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:36:35,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:36:35,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:35,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:36:35,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:36:35,934 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-02 20:36:35,934 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:36:35,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691242024] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:35,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:36:35,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-11-02 20:36:35,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459305296] [2022-11-02 20:36:35,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:35,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:36:35,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:35,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:36:35,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:36:35,939 INFO L87 Difference]: Start difference. First operand 5763 states and 8600 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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-11-02 20:36:36,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:36,330 INFO L93 Difference]: Finished difference Result 7191 states and 10479 transitions. [2022-11-02 20:36:36,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:36:36,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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 137 [2022-11-02 20:36:36,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:36,346 INFO L225 Difference]: With dead ends: 7191 [2022-11-02 20:36:36,346 INFO L226 Difference]: Without dead ends: 4833 [2022-11-02 20:36:36,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:36:36,354 INFO L413 NwaCegarLoop]: 4090 mSDtfsCounter, 4107 mSDsluCounter, 8071 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4115 SdHoareTripleChecker+Valid, 12161 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:36:36,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4115 Valid, 12161 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:36:36,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4833 states. [2022-11-02 20:36:36,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4833 to 4821. [2022-11-02 20:36:36,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4821 states, 4302 states have (on average 1.5488145048814506) internal successors, (6663), 4330 states have internal predecessors, (6663), 297 states have call successors, (297), 205 states have call predecessors, (297), 220 states have return successors, (354), 289 states have call predecessors, (354), 295 states have call successors, (354) [2022-11-02 20:36:36,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4821 states to 4821 states and 7314 transitions. [2022-11-02 20:36:36,609 INFO L78 Accepts]: Start accepts. Automaton has 4821 states and 7314 transitions. Word has length 137 [2022-11-02 20:36:36,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:36,609 INFO L495 AbstractCegarLoop]: Abstraction has 4821 states and 7314 transitions. [2022-11-02 20:36:36,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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-11-02 20:36:36,610 INFO L276 IsEmpty]: Start isEmpty. Operand 4821 states and 7314 transitions. [2022-11-02 20:36:36,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-02 20:36:36,615 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:36,615 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:36:36,650 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:36:36,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:36:36,835 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:36:36,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:36,835 INFO L85 PathProgramCache]: Analyzing trace with hash -991972582, now seen corresponding path program 1 times [2022-11-02 20:36:36,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:36,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804842017] [2022-11-02 20:36:36,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:36,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:36,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:36:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:36,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:36:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:36,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:36:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:36,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:36:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:36,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-02 20:36:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:36,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:36:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:36,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 20:36:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:36,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:36:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:36,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-02 20:36:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:36,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:36:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:36,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-02 20:36:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:36,982 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-02 20:36:36,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:36,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804842017] [2022-11-02 20:36:36,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804842017] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:36:36,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173098826] [2022-11-02 20:36:36,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:36,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:36:36,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:36:36,984 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:36:37,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:36:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:37,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:36:37,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:36:37,260 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-02 20:36:37,261 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:36:37,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173098826] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:37,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:36:37,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-11-02 20:36:37,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148953978] [2022-11-02 20:36:37,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:37,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:36:37,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:37,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:36:37,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:36:37,264 INFO L87 Difference]: Start difference. First operand 4821 states and 7314 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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-11-02 20:36:37,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:37,782 INFO L93 Difference]: Finished difference Result 7162 states and 10301 transitions. [2022-11-02 20:36:37,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:36:37,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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 137 [2022-11-02 20:36:37,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:37,800 INFO L225 Difference]: With dead ends: 7162 [2022-11-02 20:36:37,800 INFO L226 Difference]: Without dead ends: 4769 [2022-11-02 20:36:37,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:36:37,809 INFO L413 NwaCegarLoop]: 4102 mSDtfsCounter, 4128 mSDsluCounter, 8066 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4136 SdHoareTripleChecker+Valid, 12168 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:36:37,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4136 Valid, 12168 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:36:37,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4769 states. [2022-11-02 20:36:38,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4769 to 3795. [2022-11-02 20:36:38,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3795 states, 3488 states have (on average 1.6023509174311927) internal successors, (5589), 3504 states have internal predecessors, (5589), 175 states have call successors, (175), 123 states have call predecessors, (175), 130 states have return successors, (203), 169 states have call predecessors, (203), 173 states have call successors, (203) [2022-11-02 20:36:38,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3795 states to 3795 states and 5967 transitions. [2022-11-02 20:36:38,091 INFO L78 Accepts]: Start accepts. Automaton has 3795 states and 5967 transitions. Word has length 137 [2022-11-02 20:36:38,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:38,092 INFO L495 AbstractCegarLoop]: Abstraction has 3795 states and 5967 transitions. [2022-11-02 20:36:38,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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-11-02 20:36:38,092 INFO L276 IsEmpty]: Start isEmpty. Operand 3795 states and 5967 transitions. [2022-11-02 20:36:38,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-02 20:36:38,097 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:38,097 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:36:38,137 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:36:38,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-02 20:36:38,319 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:36:38,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:38,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1995852316, now seen corresponding path program 1 times [2022-11-02 20:36:38,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:38,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213896643] [2022-11-02 20:36:38,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:38,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:38,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:36:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:38,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:36:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:38,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:36:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:38,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:36:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:38,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-02 20:36:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:38,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:36:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:38,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 20:36:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:38,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:36:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:38,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-02 20:36:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:38,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:36:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:38,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-02 20:36:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:38,514 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-02 20:36:38,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:38,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213896643] [2022-11-02 20:36:38,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213896643] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:36:38,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47652043] [2022-11-02 20:36:38,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:38,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:36:38,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:36:38,517 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:36:38,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:36:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:38,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:36:38,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:36:38,686 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-11-02 20:36:38,687 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:36:38,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47652043] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:38,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:36:38,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-11-02 20:36:38,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692856404] [2022-11-02 20:36:38,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:38,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:36:38,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:38,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:36:38,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:36:38,690 INFO L87 Difference]: Start difference. First operand 3795 states and 5967 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-11-02 20:36:39,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:39,003 INFO L93 Difference]: Finished difference Result 4934 states and 7353 transitions. [2022-11-02 20:36:39,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:36:39,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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 137 [2022-11-02 20:36:39,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:39,014 INFO L225 Difference]: With dead ends: 4934 [2022-11-02 20:36:39,014 INFO L226 Difference]: Without dead ends: 3270 [2022-11-02 20:36:39,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:36:39,020 INFO L413 NwaCegarLoop]: 4102 mSDtfsCounter, 48 mSDsluCounter, 12315 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 16417 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-11-02 20:36:39,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 16417 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:36:39,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states. [2022-11-02 20:36:39,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 3234. [2022-11-02 20:36:39,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3234 states, 3034 states have (on average 1.654911008569545) internal successors, (5021), 3046 states have internal predecessors, (5021), 112 states have call successors, (112), 80 states have call predecessors, (112), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121) [2022-11-02 20:36:39,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 3234 states and 5254 transitions. [2022-11-02 20:36:39,235 INFO L78 Accepts]: Start accepts. Automaton has 3234 states and 5254 transitions. Word has length 137 [2022-11-02 20:36:39,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:39,235 INFO L495 AbstractCegarLoop]: Abstraction has 3234 states and 5254 transitions. [2022-11-02 20:36:39,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-11-02 20:36:39,236 INFO L276 IsEmpty]: Start isEmpty. Operand 3234 states and 5254 transitions. [2022-11-02 20:36:39,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-02 20:36:39,239 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:39,239 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:36:39,279 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:36:39,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-02 20:36:39,458 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:36:39,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:39,458 INFO L85 PathProgramCache]: Analyzing trace with hash 688947232, now seen corresponding path program 1 times [2022-11-02 20:36:39,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:39,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319566754] [2022-11-02 20:36:39,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:39,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:39,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:36:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:39,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:36:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:39,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:36:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:39,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:36:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:39,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-02 20:36:39,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:39,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:36:39,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:39,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 20:36:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:39,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:36:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:39,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-02 20:36:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:39,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:36:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:39,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-02 20:36:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:39,622 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-02 20:36:39,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:39,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319566754] [2022-11-02 20:36:39,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319566754] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:36:39,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667901961] [2022-11-02 20:36:39,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:39,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:36:39,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:36:39,625 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:36:39,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:36:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:39,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:36:39,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:36:39,789 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-02 20:36:39,790 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:36:39,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667901961] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:39,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:36:39,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-11-02 20:36:39,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172693844] [2022-11-02 20:36:39,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:39,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:36:39,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:39,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:36:39,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:36:39,793 INFO L87 Difference]: Start difference. First operand 3234 states and 5254 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-11-02 20:36:40,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:40,002 INFO L93 Difference]: Finished difference Result 4365 states and 6615 transitions. [2022-11-02 20:36:40,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:36:40,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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 137 [2022-11-02 20:36:40,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:40,010 INFO L225 Difference]: With dead ends: 4365 [2022-11-02 20:36:40,011 INFO L226 Difference]: Without dead ends: 3262 [2022-11-02 20:36:40,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:36:40,014 INFO L413 NwaCegarLoop]: 4101 mSDtfsCounter, 10 mSDsluCounter, 12302 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 16403 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-11-02 20:36:40,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 16403 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:36:40,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2022-11-02 20:36:40,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 3246. [2022-11-02 20:36:40,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3246 states, 3046 states have (on average 1.6454366382140513) internal successors, (5012), 3058 states have internal predecessors, (5012), 112 states have call successors, (112), 80 states have call predecessors, (112), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121) [2022-11-02 20:36:40,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3246 states to 3246 states and 5245 transitions. [2022-11-02 20:36:40,174 INFO L78 Accepts]: Start accepts. Automaton has 3246 states and 5245 transitions. Word has length 137 [2022-11-02 20:36:40,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:40,175 INFO L495 AbstractCegarLoop]: Abstraction has 3246 states and 5245 transitions. [2022-11-02 20:36:40,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-11-02 20:36:40,175 INFO L276 IsEmpty]: Start isEmpty. Operand 3246 states and 5245 transitions. [2022-11-02 20:36:40,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-02 20:36:40,179 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:40,179 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:36:40,214 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 20:36:40,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-02 20:36:40,403 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:36:40,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:40,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1312364636, now seen corresponding path program 1 times [2022-11-02 20:36:40,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:40,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505296928] [2022-11-02 20:36:40,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:40,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:40,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:36:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:40,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:36:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:40,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:36:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:40,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:36:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:40,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-02 20:36:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:40,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:36:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:40,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 20:36:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:40,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:36:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:40,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-02 20:36:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:40,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:36:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:40,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-02 20:36:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:40,576 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-11-02 20:36:40,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:40,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505296928] [2022-11-02 20:36:40,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505296928] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:40,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:40,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:36:40,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639997082] [2022-11-02 20:36:40,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:40,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:36:40,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:40,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:36:40,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:36:40,580 INFO L87 Difference]: Start difference. First operand 3246 states and 5245 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-02 20:36:41,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:41,299 INFO L93 Difference]: Finished difference Result 4206 states and 6319 transitions. [2022-11-02 20:36:41,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:36:41,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 137 [2022-11-02 20:36:41,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:41,310 INFO L225 Difference]: With dead ends: 4206 [2022-11-02 20:36:41,311 INFO L226 Difference]: Without dead ends: 4203 [2022-11-02 20:36:41,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:36:41,316 INFO L413 NwaCegarLoop]: 4172 mSDtfsCounter, 4444 mSDsluCounter, 12174 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4467 SdHoareTripleChecker+Valid, 16346 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:36:41,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4467 Valid, 16346 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:36:41,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4203 states. [2022-11-02 20:36:41,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4203 to 3622. [2022-11-02 20:36:41,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3622 states, 3356 states have (on average 1.598331346841478) internal successors, (5364), 3372 states have internal predecessors, (5364), 146 states have call successors, (146), 104 states have call predecessors, (146), 118 states have return successors, (163), 146 states have call predecessors, (163), 144 states have call successors, (163) [2022-11-02 20:36:41,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 3622 states and 5673 transitions. [2022-11-02 20:36:41,527 INFO L78 Accepts]: Start accepts. Automaton has 3622 states and 5673 transitions. Word has length 137 [2022-11-02 20:36:41,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:41,528 INFO L495 AbstractCegarLoop]: Abstraction has 3622 states and 5673 transitions. [2022-11-02 20:36:41,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-02 20:36:41,528 INFO L276 IsEmpty]: Start isEmpty. Operand 3622 states and 5673 transitions. [2022-11-02 20:36:41,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-02 20:36:41,531 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:41,531 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:36:41,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:36:41,532 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:36:41,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:41,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1384992052, now seen corresponding path program 1 times [2022-11-02 20:36:41,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:41,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316713312] [2022-11-02 20:36:41,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:41,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:41,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:36:41,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:41,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:36:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:41,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:36:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:41,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:36:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:41,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-02 20:36:41,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:41,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:36:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:41,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 20:36:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:41,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:36:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:41,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-02 20:36:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:41,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:36:41,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:41,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-02 20:36:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:41,625 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-11-02 20:36:41,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:41,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316713312] [2022-11-02 20:36:41,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316713312] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:41,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:41,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:36:41,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130712052] [2022-11-02 20:36:41,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:41,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:36:41,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:41,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:36:41,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:36:41,627 INFO L87 Difference]: Start difference. First operand 3622 states and 5673 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-02 20:36:42,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:42,150 INFO L93 Difference]: Finished difference Result 4845 states and 7161 transitions. [2022-11-02 20:36:42,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:36:42,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 141 [2022-11-02 20:36:42,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:42,162 INFO L225 Difference]: With dead ends: 4845 [2022-11-02 20:36:42,162 INFO L226 Difference]: Without dead ends: 3985 [2022-11-02 20:36:42,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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-11-02 20:36:42,165 INFO L413 NwaCegarLoop]: 4151 mSDtfsCounter, 142 mSDsluCounter, 12149 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 16300 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:36:42,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 16300 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:36:42,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3985 states. [2022-11-02 20:36:42,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3985 to 3624. [2022-11-02 20:36:42,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3624 states, 3358 states have (on average 1.5979749851101845) internal successors, (5366), 3374 states have internal predecessors, (5366), 146 states have call successors, (146), 104 states have call predecessors, (146), 118 states have return successors, (163), 146 states have call predecessors, (163), 144 states have call successors, (163) [2022-11-02 20:36:42,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3624 states to 3624 states and 5675 transitions. [2022-11-02 20:36:42,372 INFO L78 Accepts]: Start accepts. Automaton has 3624 states and 5675 transitions. Word has length 141 [2022-11-02 20:36:42,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:42,373 INFO L495 AbstractCegarLoop]: Abstraction has 3624 states and 5675 transitions. [2022-11-02 20:36:42,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-02 20:36:42,373 INFO L276 IsEmpty]: Start isEmpty. Operand 3624 states and 5675 transitions. [2022-11-02 20:36:42,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-11-02 20:36:42,376 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:42,377 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:36:42,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:36:42,377 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:36:42,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:42,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1244161439, now seen corresponding path program 1 times [2022-11-02 20:36:42,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:42,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715133036] [2022-11-02 20:36:42,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:42,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:36:42,396 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:36:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:36:42,468 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:36:42,468 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:36:42,469 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-11-02 20:36:42,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-11-02 20:36:42,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:36:42,475 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:36:42,482 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:36:42,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:36:42 BoogieIcfgContainer [2022-11-02 20:36:42,621 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:36:42,621 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:36:42,622 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:36:42,622 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:36:42,622 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:36:22" (3/4) ... [2022-11-02 20:36:42,624 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-02 20:36:42,720 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:36:42,720 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:36:42,721 INFO L158 Benchmark]: Toolchain (without parser) took 35225.47ms. Allocated memory was 119.5MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 86.5MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 398.2MB. Max. memory is 16.1GB. [2022-11-02 20:36:42,721 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 83.9MB. Free memory is still 38.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:36:42,721 INFO L158 Benchmark]: CACSL2BoogieTranslator took 4125.49ms. Allocated memory was 119.5MB in the beginning and 283.1MB in the end (delta: 163.6MB). Free memory was 86.3MB in the beginning and 182.8MB in the end (delta: -96.5MB). Peak memory consumption was 124.8MB. Max. memory is 16.1GB. [2022-11-02 20:36:42,722 INFO L158 Benchmark]: Boogie Procedure Inliner took 543.54ms. Allocated memory is still 283.1MB. Free memory was 182.8MB in the beginning and 150.3MB in the end (delta: 32.5MB). Peak memory consumption was 100.7MB. Max. memory is 16.1GB. [2022-11-02 20:36:42,722 INFO L158 Benchmark]: Boogie Preprocessor took 606.68ms. Allocated memory is still 283.1MB. Free memory was 150.3MB in the beginning and 125.2MB in the end (delta: 25.0MB). Peak memory consumption was 82.8MB. Max. memory is 16.1GB. [2022-11-02 20:36:42,722 INFO L158 Benchmark]: RCFGBuilder took 9253.11ms. Allocated memory was 283.1MB in the beginning and 815.8MB in the end (delta: 532.7MB). Free memory was 125.2MB in the beginning and 513.8MB in the end (delta: -388.6MB). Peak memory consumption was 331.7MB. Max. memory is 16.1GB. [2022-11-02 20:36:42,723 INFO L158 Benchmark]: TraceAbstraction took 20588.10ms. Allocated memory was 815.8MB in the beginning and 2.0GB in the end (delta: 1.2GB). Free memory was 512.8MB in the beginning and 1.6GB in the end (delta: -1.1GB). Peak memory consumption was 113.7MB. Max. memory is 16.1GB. [2022-11-02 20:36:42,723 INFO L158 Benchmark]: Witness Printer took 98.78ms. Allocated memory is still 2.0GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-02 20:36:42,725 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.22ms. Allocated memory is still 83.9MB. Free memory is still 38.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 4125.49ms. Allocated memory was 119.5MB in the beginning and 283.1MB in the end (delta: 163.6MB). Free memory was 86.3MB in the beginning and 182.8MB in the end (delta: -96.5MB). Peak memory consumption was 124.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 543.54ms. Allocated memory is still 283.1MB. Free memory was 182.8MB in the beginning and 150.3MB in the end (delta: 32.5MB). Peak memory consumption was 100.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 606.68ms. Allocated memory is still 283.1MB. Free memory was 150.3MB in the beginning and 125.2MB in the end (delta: 25.0MB). Peak memory consumption was 82.8MB. Max. memory is 16.1GB. * RCFGBuilder took 9253.11ms. Allocated memory was 283.1MB in the beginning and 815.8MB in the end (delta: 532.7MB). Free memory was 125.2MB in the beginning and 513.8MB in the end (delta: -388.6MB). Peak memory consumption was 331.7MB. Max. memory is 16.1GB. * TraceAbstraction took 20588.10ms. Allocated memory was 815.8MB in the beginning and 2.0GB in the end (delta: 1.2GB). Free memory was 512.8MB in the beginning and 1.6GB in the end (delta: -1.1GB). Peak memory consumption was 113.7MB. Max. memory is 16.1GB. * Witness Printer took 98.78ms. Allocated memory is still 2.0GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. 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 m_st ; [L11180] int t1_st ; [L11181] int m_i ; [L11182] int t1_i ; [L11183] int M_E = 2; [L11184] int T1_E = 2; [L11185] int E_M = 2; [L11186] int E_1 = 2; [L11190] int token ; [L11192] 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_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, token=0] [L11651] COND FALSE !(__VERIFIER_nondet_int()) [L11654] CALL main2() [L11638] int __retres1 ; [L11642] CALL init_model() [L11553] m_i = 1 [L11554] t1_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_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, token=0] [L11642] RET init_model() [L11643] CALL start_simulation() [L11579] int kernel_st ; [L11580] int tmp ; [L11581] int tmp___0 ; [L11585] 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_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, token=0] [L11586] 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_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, token=0] [L11587] CALL init_threads() [L11335] COND TRUE m_i == 1 [L11336] 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_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, token=0] [L11340] COND TRUE t1_i == 1 [L11341] 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_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, token=0] [L11587] RET init_threads() [L11588] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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_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, token=0] [L11424] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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_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, token=0] [L11429] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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_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, token=0] [L11434] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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_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, token=0] [L11439] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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_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, token=0] [L11588] 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_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, token=0] [L11589] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_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_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, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [\old(m_st)=0, \old(t1_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_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, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_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_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, token=0] [L11299] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_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_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, token=0] [L11301] return (__retres1); VAL [\old(m_st)=0, \old(t1_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_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, token=0] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_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_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, tmp=0, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [\old(m_st)=0, \old(t1_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_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, token=0] [L11308] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_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_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, token=0] [L11318] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_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_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, token=0] [L11320] return (__retres1); VAL [\old(m_st)=0, \old(t1_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_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, token=0] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_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_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, tmp=0, tmp___0=0, token=0] [L11589] 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_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, token=0] [L11590] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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_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, token=0] [L11452] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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_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, token=0] [L11457] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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_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, token=0] [L11462] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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_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, token=0] [L11467] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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_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, token=0] [L11590] 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_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, token=0] [L11593] 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_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, token=0] [L11596] kernel_st = 1 [L11597] CALL eval() [L11371] 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_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, token=0] [L11375] 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_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, token=0] [L11378] 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_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, token=0] [L11350] 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_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, token=0] [L11353] COND TRUE m_st == 0 [L11354] __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_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, token=0] [L11366] 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_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, token=0] [L11378] 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_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, token=0] [L11378] tmp = exists_runnable_thread() [L11380] 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_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, tmp=1, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] 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_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, tmp=1, tmp_ndt_1=0, token=0] [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] 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_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, token=0] [L11264] 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_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, token=0] [L11266] t1_pc = 1 [L11267] 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_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, token=0] [L11405] RET transmit1() [L11375] 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_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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L11378] 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_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, token=0] [L11350] 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_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, token=0] [L11353] COND TRUE m_st == 0 [L11354] __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_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, token=0] [L11366] 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_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, token=0] [L11378] 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_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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L11378] tmp = exists_runnable_thread() [L11380] 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_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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] 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_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, tmp_var=0, token=0] [L11208] 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_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, tmp_var=0, token=0] [L11211] token = __VERIFIER_nondet_int() [L11212] local = token [L11213] 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_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, tmp_var=0, token=0] [L11214] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_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_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, token=0] [L11506] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_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_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, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [\old(m_st)=1, \old(t1_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_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, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_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_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, token=0] [L11299] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_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_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, token=0] [L11301] return (__retres1); VAL [\old(m_st)=1, \old(t1_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_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, token=0] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_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_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, tmp=0, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [\old(m_st)=1, \old(t1_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_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, token=0] [L11308] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_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_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, token=0] [L11309] COND TRUE E_1 == 1 [L11310] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_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_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, token=0] [L11320] return (__retres1); VAL [\old(m_st)=1, \old(t1_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_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, token=0] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND TRUE \read(tmp___0) [L11493] t1_st = 0 VAL [\old(m_st)=1, \old(t1_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_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, tmp=0, tmp___0=1, token=0] [L11506] RET activate_threads() VAL [\old(m_st)=1, \old(t1_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_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, token=0] [L11214] 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_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, tmp_var=0, token=0] [L11215] E_1 = 2 [L11216] m_pc = 1 [L11217] 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_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, tmp_var=0, token=0] [L11391] RET master() [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] 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_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, token=0] [L11256] 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_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, token=0] [L11272] token += 1 [L11273] 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_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=1, token=1] [L11274] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_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_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=1, token=1] [L11506] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_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_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=1, token=1] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [\old(m_st)=2, \old(t1_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_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=1, token=1] [L11289] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_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_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=1, token=1] [L11290] COND TRUE E_M == 1 [L11291] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_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_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=1, token=1] [L11301] return (__retres1); VAL [\old(m_st)=2, \old(t1_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_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=1, token=1] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND TRUE \read(tmp) [L11485] m_st = 0 VAL [\old(m_st)=2, \old(t1_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_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=1, tmp=1, token=1] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [\old(m_st)=2, \old(t1_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_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=1, token=1] [L11308] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_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_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=1, token=1] [L11309] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_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_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=1, token=1] [L11318] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_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_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=1, token=1] [L11320] return (__retres1); VAL [\old(m_st)=2, \old(t1_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_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=1, token=1] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_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_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=1, tmp=1, tmp___0=0, token=1] [L11506] RET activate_threads() VAL [\old(m_st)=2, \old(t1_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_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=1, token=1] [L11274] 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_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=1, token=1] [L11275] 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_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=1, token=1] [L11264] 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_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=1, token=1] [L11266] t1_pc = 1 [L11267] 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_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, token=1] [L11405] RET transmit1() [L11375] 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_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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1] [L11378] 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_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, token=1] [L11350] 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_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, token=1] [L11353] COND TRUE m_st == 0 [L11354] __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_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, token=1] [L11366] 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_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, token=1] [L11378] 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_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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1] [L11378] tmp = exists_runnable_thread() [L11380] 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_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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] 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_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, tmp_var=5, token=1] [L11200] 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_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, tmp_var=5, token=1] [L11222] COND FALSE !(token != local + 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_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, tmp_var=5, token=1] [L11227] 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_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, tmp_var=5, token=1] [L11228] 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_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, tmp_var=5, token=1] [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_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, tmp_var=5, token=1] [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_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, tmp_var=5, token=1] [L11235] 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_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, tmp_var=5, token=1] [L11236] 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_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, token=1] [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_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, token=1] - UnprovableResult [Line: 11094]: 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, 2298 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 20.4s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46866 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46759 mSDsluCounter, 213809 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 147255 mSDsCounter, 543 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3726 IncrementalHoareTripleChecker+Invalid, 4269 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 543 mSolverCounterUnsat, 66554 mSDtfsCounter, 3726 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1605 GetRequests, 1460 SyntacticMatches, 4 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6635occurred in iteration=8, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 3064 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 3044 NumberOfCodeBlocks, 3044 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2877 ConstructedInterpolants, 0 QuantifiedInterpolants, 4619 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3878 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 25 InterpolantComputations, 16 PerfectInterpolantSequences, 1302/1472 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-11-02 20:36:42,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d05324b-14c3-4dd7-8552-536ae2e6d850/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE