./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R --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 7f4008cf19548475d4a1b90b2fc9651e21c073e156065e130bea6b81023185c5 --- 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-38b53e6 [2022-11-25 17:31:46,628 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:31:46,630 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:31:46,665 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:31:46,666 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:31:46,667 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:31:46,668 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:31:46,670 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:31:46,677 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:31:46,684 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:31:46,686 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:31:46,690 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:31:46,691 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:31:46,697 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:31:46,700 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:31:46,704 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:31:46,706 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:31:46,707 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:31:46,709 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:31:46,717 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:31:46,719 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:31:46,722 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:31:46,725 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:31:46,726 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:31:46,739 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:31:46,740 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:31:46,740 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:31:46,744 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:31:46,745 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:31:46,746 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:31:46,746 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:31:46,748 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:31:46,750 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:31:46,753 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:31:46,755 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:31:46,755 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:31:46,757 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:31:46,758 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:31:46,758 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:31:46,764 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:31:46,765 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:31:46,766 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 17:31:46,815 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:31:46,815 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:31:46,816 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:31:46,817 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:31:46,818 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:31:46,818 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:31:46,819 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:31:46,819 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:31:46,820 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:31:46,820 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:31:46,821 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:31:46,822 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:31:46,822 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:31:46,822 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:31:46,823 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:31:46,823 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:31:46,823 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:31:46,824 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:31:46,824 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:31:46,824 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:31:46,825 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:31:46,825 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:31:46,825 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:31:46,825 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:31:46,826 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:31:46,826 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:31:46,826 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:31:46,827 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:31:46,827 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:31:46,828 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:31:46,828 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:31:46,828 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:31:46,829 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:31:46,829 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:31:46,829 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/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_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R 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 -> 7f4008cf19548475d4a1b90b2fc9651e21c073e156065e130bea6b81023185c5 [2022-11-25 17:31:47,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:31:47,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:31:47,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:31:47,188 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:31:47,189 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:31:47,190 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2022-11-25 17:31:50,695 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:31:51,053 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:31:51,053 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2022-11-25 17:31:51,064 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/data/ba680eb42/89c33d92807d4da3876755898ef2fe58/FLAG0eb1539ee [2022-11-25 17:31:51,091 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/data/ba680eb42/89c33d92807d4da3876755898ef2fe58 [2022-11-25 17:31:51,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:31:51,097 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:31:51,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:31:51,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:31:51,105 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:31:51,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:31:51" (1/1) ... [2022-11-25 17:31:51,108 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@374c4741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:51, skipping insertion in model container [2022-11-25 17:31:51,108 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:31:51" (1/1) ... [2022-11-25 17:31:51,118 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:31:51,166 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:31:51,415 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c[12020,12033] [2022-11-25 17:31:51,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:31:51,433 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:31:51,497 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c[12020,12033] [2022-11-25 17:31:51,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:31:51,518 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:31:51,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:51 WrapperNode [2022-11-25 17:31:51,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:31:51,520 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:31:51,520 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:31:51,521 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:31:51,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:51" (1/1) ... [2022-11-25 17:31:51,543 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:51" (1/1) ... [2022-11-25 17:31:51,588 INFO L138 Inliner]: procedures = 28, calls = 51, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 381 [2022-11-25 17:31:51,588 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:31:51,589 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:31:51,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:31:51,590 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:31:51,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:51" (1/1) ... [2022-11-25 17:31:51,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:51" (1/1) ... [2022-11-25 17:31:51,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:51" (1/1) ... [2022-11-25 17:31:51,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:51" (1/1) ... [2022-11-25 17:31:51,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:51" (1/1) ... [2022-11-25 17:31:51,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:51" (1/1) ... [2022-11-25 17:31:51,632 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:51" (1/1) ... [2022-11-25 17:31:51,635 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:51" (1/1) ... [2022-11-25 17:31:51,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:31:51,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:31:51,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:31:51,642 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:31:51,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:51" (1/1) ... [2022-11-25 17:31:51,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:31:51,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:31:51,691 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:31:51,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:31:51,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:31:51,750 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2022-11-25 17:31:51,750 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2022-11-25 17:31:51,751 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2022-11-25 17:31:51,751 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2022-11-25 17:31:51,751 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2022-11-25 17:31:51,751 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2022-11-25 17:31:51,752 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2022-11-25 17:31:51,753 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2022-11-25 17:31:51,753 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2022-11-25 17:31:51,753 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2022-11-25 17:31:51,753 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-25 17:31:51,753 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-25 17:31:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:31:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:31:51,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:31:51,984 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:31:52,001 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:31:52,689 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:31:52,708 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:31:52,711 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 17:31:52,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:31:52 BoogieIcfgContainer [2022-11-25 17:31:52,716 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:31:52,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:31:52,720 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:31:52,724 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:31:52,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:31:51" (1/3) ... [2022-11-25 17:31:52,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5941c3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:31:52, skipping insertion in model container [2022-11-25 17:31:52,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:51" (2/3) ... [2022-11-25 17:31:52,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5941c3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:31:52, skipping insertion in model container [2022-11-25 17:31:52,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:31:52" (3/3) ... [2022-11-25 17:31:52,728 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2022-11-25 17:31:52,749 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:31:52,749 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 17:31:52,815 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:31:52,824 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;@5c891462, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:31:52,824 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 17:31:52,830 INFO L276 IsEmpty]: Start isEmpty. Operand has 178 states, 133 states have (on average 1.586466165413534) internal successors, (211), 138 states have internal predecessors, (211), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-11-25 17:31:52,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 17:31:52,842 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:31:52,843 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:52,844 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:31:52,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:52,850 INFO L85 PathProgramCache]: Analyzing trace with hash -2086312570, now seen corresponding path program 1 times [2022-11-25 17:31:52,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:52,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031486326] [2022-11-25 17:31:52,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:52,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:53,267 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-25 17:31:53,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:53,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031486326] [2022-11-25 17:31:53,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031486326] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:53,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:53,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:31:53,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079581305] [2022-11-25 17:31:53,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:53,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:31:53,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:53,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:31:53,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:31:53,326 INFO L87 Difference]: Start difference. First operand has 178 states, 133 states have (on average 1.586466165413534) internal successors, (211), 138 states have internal predecessors, (211), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:53,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:31:53,557 INFO L93 Difference]: Finished difference Result 357 states and 615 transitions. [2022-11-25 17:31:53,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:31:53,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-25 17:31:53,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:31:53,573 INFO L225 Difference]: With dead ends: 357 [2022-11-25 17:31:53,574 INFO L226 Difference]: Without dead ends: 182 [2022-11-25 17:31:53,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:31:53,584 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 18 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:31:53,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 799 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:31:53,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-11-25 17:31:53,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2022-11-25 17:31:53,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 135 states have (on average 1.5555555555555556) internal successors, (210), 139 states have internal predecessors, (210), 37 states have call successors, (37), 7 states have call predecessors, (37), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-11-25 17:31:53,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 284 transitions. [2022-11-25 17:31:53,655 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 284 transitions. Word has length 15 [2022-11-25 17:31:53,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:31:53,656 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 284 transitions. [2022-11-25 17:31:53,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:53,656 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 284 transitions. [2022-11-25 17:31:53,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 17:31:53,659 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:31:53,659 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:53,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:31:53,660 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:31:53,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:53,661 INFO L85 PathProgramCache]: Analyzing trace with hash 2089918424, now seen corresponding path program 1 times [2022-11-25 17:31:53,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:53,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223765310] [2022-11-25 17:31:53,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:53,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:53,739 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-25 17:31:53,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:53,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223765310] [2022-11-25 17:31:53,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223765310] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:53,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:53,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:31:53,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877561007] [2022-11-25 17:31:53,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:53,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:31:53,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:53,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:31:53,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:31:53,744 INFO L87 Difference]: Start difference. First operand 180 states and 284 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:53,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:31:53,821 INFO L93 Difference]: Finished difference Result 373 states and 591 transitions. [2022-11-25 17:31:53,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:31:53,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-25 17:31:53,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:31:53,825 INFO L225 Difference]: With dead ends: 373 [2022-11-25 17:31:53,825 INFO L226 Difference]: Without dead ends: 196 [2022-11-25 17:31:53,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:31:53,828 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 25 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:31:53,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 820 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:31:53,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-11-25 17:31:53,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 193. [2022-11-25 17:31:53,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 146 states have (on average 1.5342465753424657) internal successors, (224), 150 states have internal predecessors, (224), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-11-25 17:31:53,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 300 transitions. [2022-11-25 17:31:53,854 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 300 transitions. Word has length 16 [2022-11-25 17:31:53,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:31:53,854 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 300 transitions. [2022-11-25 17:31:53,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:53,861 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 300 transitions. [2022-11-25 17:31:53,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 17:31:53,863 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:31:53,864 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:53,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:31:53,864 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:31:53,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:53,865 INFO L85 PathProgramCache]: Analyzing trace with hash 2079657108, now seen corresponding path program 1 times [2022-11-25 17:31:53,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:53,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990640469] [2022-11-25 17:31:53,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:53,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:53,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:31:53,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:54,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:31:54,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:54,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990640469] [2022-11-25 17:31:54,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990640469] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:54,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:54,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:31:54,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255901207] [2022-11-25 17:31:54,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:54,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:31:54,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:54,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:31:54,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:31:54,029 INFO L87 Difference]: Start difference. First operand 193 states and 300 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 17:31:54,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:31:54,065 INFO L93 Difference]: Finished difference Result 405 states and 637 transitions. [2022-11-25 17:31:54,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:31:54,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-11-25 17:31:54,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:31:54,069 INFO L225 Difference]: With dead ends: 405 [2022-11-25 17:31:54,069 INFO L226 Difference]: Without dead ends: 222 [2022-11-25 17:31:54,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:31:54,073 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 22 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:31:54,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 554 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:31:54,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-11-25 17:31:54,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 195. [2022-11-25 17:31:54,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 148 states have (on average 1.527027027027027) internal successors, (226), 152 states have internal predecessors, (226), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-11-25 17:31:54,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 302 transitions. [2022-11-25 17:31:54,131 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 302 transitions. Word has length 24 [2022-11-25 17:31:54,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:31:54,132 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 302 transitions. [2022-11-25 17:31:54,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 17:31:54,132 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 302 transitions. [2022-11-25 17:31:54,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-25 17:31:54,134 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:31:54,134 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 17:31:54,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:31:54,134 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:31:54,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:54,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1546063421, now seen corresponding path program 1 times [2022-11-25 17:31:54,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:54,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473751923] [2022-11-25 17:31:54,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:54,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:54,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:31:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:54,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:31:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:54,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:31:54,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:54,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473751923] [2022-11-25 17:31:54,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473751923] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:54,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:54,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:31:54,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847341798] [2022-11-25 17:31:54,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:54,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:31:54,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:54,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:31:54,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:31:54,336 INFO L87 Difference]: Start difference. First operand 195 states and 302 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:31:54,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:31:54,407 INFO L93 Difference]: Finished difference Result 479 states and 762 transitions. [2022-11-25 17:31:54,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:31:54,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-11-25 17:31:54,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:31:54,412 INFO L225 Difference]: With dead ends: 479 [2022-11-25 17:31:54,412 INFO L226 Difference]: Without dead ends: 300 [2022-11-25 17:31:54,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:31:54,415 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 118 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:31:54,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1170 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:31:54,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-11-25 17:31:54,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 199. [2022-11-25 17:31:54,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 151 states have (on average 1.5165562913907285) internal successors, (229), 155 states have internal predecessors, (229), 38 states have call successors, (38), 8 states have call predecessors, (38), 9 states have return successors, (39), 39 states have call predecessors, (39), 38 states have call successors, (39) [2022-11-25 17:31:54,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 306 transitions. [2022-11-25 17:31:54,443 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 306 transitions. Word has length 32 [2022-11-25 17:31:54,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:31:54,444 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 306 transitions. [2022-11-25 17:31:54,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:31:54,444 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 306 transitions. [2022-11-25 17:31:54,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-25 17:31:54,446 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:31:54,446 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] [2022-11-25 17:31:54,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:31:54,447 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:31:54,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:54,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1069273240, now seen corresponding path program 1 times [2022-11-25 17:31:54,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:54,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122087000] [2022-11-25 17:31:54,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:54,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:54,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:31:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:54,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:31:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:54,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-25 17:31:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:54,573 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-25 17:31:54,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:54,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122087000] [2022-11-25 17:31:54,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122087000] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:54,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:54,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:31:54,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645874436] [2022-11-25 17:31:54,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:54,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:31:54,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:54,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:31:54,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:31:54,578 INFO L87 Difference]: Start difference. First operand 199 states and 306 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 17:31:54,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:31:54,709 INFO L93 Difference]: Finished difference Result 343 states and 534 transitions. [2022-11-25 17:31:54,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:31:54,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-11-25 17:31:54,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:31:54,712 INFO L225 Difference]: With dead ends: 343 [2022-11-25 17:31:54,712 INFO L226 Difference]: Without dead ends: 195 [2022-11-25 17:31:54,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:31:54,719 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 118 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:31:54,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1190 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:31:54,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-11-25 17:31:54,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2022-11-25 17:31:54,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 148 states have (on average 1.4932432432432432) internal successors, (221), 152 states have internal predecessors, (221), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-11-25 17:31:54,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 297 transitions. [2022-11-25 17:31:54,758 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 297 transitions. Word has length 35 [2022-11-25 17:31:54,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:31:54,759 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 297 transitions. [2022-11-25 17:31:54,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 17:31:54,759 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 297 transitions. [2022-11-25 17:31:54,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-25 17:31:54,767 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:31:54,767 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 17:31:54,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:31:54,769 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:31:54,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:54,770 INFO L85 PathProgramCache]: Analyzing trace with hash -32659331, now seen corresponding path program 1 times [2022-11-25 17:31:54,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:54,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405166238] [2022-11-25 17:31:54,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:54,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:54,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:31:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:54,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:31:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:54,918 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:31:54,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:54,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405166238] [2022-11-25 17:31:54,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405166238] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:31:54,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778746256] [2022-11-25 17:31:54,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:54,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:31:54,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:31:54,927 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:31:54,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 17:31:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:55,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:31:55,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:31:55,141 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:31:55,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:31:55,242 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:31:55,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778746256] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:31:55,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:31:55,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-25 17:31:55,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628429526] [2022-11-25 17:31:55,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:31:55,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:31:55,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:55,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:31:55,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:31:55,248 INFO L87 Difference]: Start difference. First operand 195 states and 297 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:31:55,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:31:55,348 INFO L93 Difference]: Finished difference Result 438 states and 681 transitions. [2022-11-25 17:31:55,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:31:55,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2022-11-25 17:31:55,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:31:55,358 INFO L225 Difference]: With dead ends: 438 [2022-11-25 17:31:55,359 INFO L226 Difference]: Without dead ends: 254 [2022-11-25 17:31:55,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:31:55,369 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 58 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:31:55,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1064 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:31:55,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-11-25 17:31:55,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 248. [2022-11-25 17:31:55,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 191 states have (on average 1.4659685863874345) internal successors, (280), 195 states have internal predecessors, (280), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-11-25 17:31:55,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 376 transitions. [2022-11-25 17:31:55,416 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 376 transitions. Word has length 35 [2022-11-25 17:31:55,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:31:55,418 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 376 transitions. [2022-11-25 17:31:55,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:31:55,419 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 376 transitions. [2022-11-25 17:31:55,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-25 17:31:55,425 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:31:55,426 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:55,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 17:31:55,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-25 17:31:55,633 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:31:55,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:55,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1003259933, now seen corresponding path program 2 times [2022-11-25 17:31:55,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:55,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837737662] [2022-11-25 17:31:55,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:55,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:55,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:31:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:55,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:31:55,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:55,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:31:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:55,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:31:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:55,766 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-25 17:31:55,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:55,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837737662] [2022-11-25 17:31:55,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837737662] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:55,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:55,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:31:55,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825665136] [2022-11-25 17:31:55,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:55,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:31:55,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:55,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:31:55,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:31:55,772 INFO L87 Difference]: Start difference. First operand 248 states and 376 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:31:55,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:31:55,842 INFO L93 Difference]: Finished difference Result 506 states and 778 transitions. [2022-11-25 17:31:55,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:31:55,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2022-11-25 17:31:55,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:31:55,848 INFO L225 Difference]: With dead ends: 506 [2022-11-25 17:31:55,848 INFO L226 Difference]: Without dead ends: 287 [2022-11-25 17:31:55,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:31:55,856 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 24 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:31:55,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 812 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:31:55,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-11-25 17:31:55,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2022-11-25 17:31:55,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 223 states have (on average 1.4215246636771302) internal successors, (317), 227 states have internal predecessors, (317), 51 states have call successors, (51), 9 states have call predecessors, (51), 9 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2022-11-25 17:31:55,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 419 transitions. [2022-11-25 17:31:55,899 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 419 transitions. Word has length 57 [2022-11-25 17:31:55,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:31:55,900 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 419 transitions. [2022-11-25 17:31:55,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:31:55,900 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 419 transitions. [2022-11-25 17:31:55,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-25 17:31:55,904 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:31:55,905 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:55,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:31:55,906 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:31:55,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:55,907 INFO L85 PathProgramCache]: Analyzing trace with hash -447415154, now seen corresponding path program 1 times [2022-11-25 17:31:55,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:55,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523968594] [2022-11-25 17:31:55,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:55,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:56,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:31:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:56,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:31:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:56,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:31:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:56,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:31:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:56,034 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-25 17:31:56,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:56,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523968594] [2022-11-25 17:31:56,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523968594] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:56,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:56,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:31:56,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672731520] [2022-11-25 17:31:56,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:56,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:31:56,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:56,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:31:56,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:31:56,042 INFO L87 Difference]: Start difference. First operand 284 states and 419 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:31:56,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:31:56,110 INFO L93 Difference]: Finished difference Result 543 states and 825 transitions. [2022-11-25 17:31:56,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:31:56,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2022-11-25 17:31:56,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:31:56,115 INFO L225 Difference]: With dead ends: 543 [2022-11-25 17:31:56,115 INFO L226 Difference]: Without dead ends: 293 [2022-11-25 17:31:56,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:31:56,118 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 19 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:31:56,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 798 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:31:56,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-11-25 17:31:56,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 291. [2022-11-25 17:31:56,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 229 states have (on average 1.4192139737991267) internal successors, (325), 233 states have internal predecessors, (325), 51 states have call successors, (51), 10 states have call predecessors, (51), 10 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2022-11-25 17:31:56,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 427 transitions. [2022-11-25 17:31:56,152 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 427 transitions. Word has length 57 [2022-11-25 17:31:56,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:31:56,153 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 427 transitions. [2022-11-25 17:31:56,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:31:56,154 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 427 transitions. [2022-11-25 17:31:56,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-25 17:31:56,155 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:31:56,155 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:56,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:31:56,156 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:31:56,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:56,157 INFO L85 PathProgramCache]: Analyzing trace with hash 879511853, now seen corresponding path program 1 times [2022-11-25 17:31:56,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:56,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317064479] [2022-11-25 17:31:56,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:56,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:56,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:31:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:56,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:31:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:56,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:31:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:56,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:31:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:56,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:31:56,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:56,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:31:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:56,312 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-25 17:31:56,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:56,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317064479] [2022-11-25 17:31:56,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317064479] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:56,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:56,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:31:56,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81365213] [2022-11-25 17:31:56,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:56,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:31:56,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:56,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:31:56,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:31:56,316 INFO L87 Difference]: Start difference. First operand 291 states and 427 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:31:56,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:31:56,361 INFO L93 Difference]: Finished difference Result 531 states and 793 transitions. [2022-11-25 17:31:56,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:31:56,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 75 [2022-11-25 17:31:56,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:31:56,365 INFO L225 Difference]: With dead ends: 531 [2022-11-25 17:31:56,365 INFO L226 Difference]: Without dead ends: 293 [2022-11-25 17:31:56,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:31:56,367 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 0 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:31:56,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1080 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:31:56,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-11-25 17:31:56,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 291. [2022-11-25 17:31:56,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 229 states have (on average 1.4061135371179039) internal successors, (322), 233 states have internal predecessors, (322), 51 states have call successors, (51), 10 states have call predecessors, (51), 10 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2022-11-25 17:31:56,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 424 transitions. [2022-11-25 17:31:56,393 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 424 transitions. Word has length 75 [2022-11-25 17:31:56,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:31:56,393 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 424 transitions. [2022-11-25 17:31:56,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:31:56,394 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 424 transitions. [2022-11-25 17:31:56,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-25 17:31:56,396 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:31:56,396 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:56,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:31:56,397 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:31:56,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:56,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1733898963, now seen corresponding path program 1 times [2022-11-25 17:31:56,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:56,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701522127] [2022-11-25 17:31:56,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:56,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:56,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:56,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:31:56,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:56,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:31:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:56,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:31:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:56,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:31:56,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:56,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:31:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:56,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:31:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:56,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:31:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:56,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:31:56,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:56,629 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-11-25 17:31:56,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:56,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701522127] [2022-11-25 17:31:56,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701522127] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:56,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:56,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:31:56,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022290632] [2022-11-25 17:31:56,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:56,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:31:56,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:56,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:31:56,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:31:56,632 INFO L87 Difference]: Start difference. First operand 291 states and 424 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:31:56,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:31:56,703 INFO L93 Difference]: Finished difference Result 568 states and 849 transitions. [2022-11-25 17:31:56,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:31:56,704 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 104 [2022-11-25 17:31:56,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:31:56,710 INFO L225 Difference]: With dead ends: 568 [2022-11-25 17:31:56,710 INFO L226 Difference]: Without dead ends: 335 [2022-11-25 17:31:56,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:31:56,712 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 25 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:31:56,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 812 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:31:56,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-11-25 17:31:56,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 332. [2022-11-25 17:31:56,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 266 states have (on average 1.368421052631579) internal successors, (364), 270 states have internal predecessors, (364), 54 states have call successors, (54), 11 states have call predecessors, (54), 11 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-11-25 17:31:56,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 472 transitions. [2022-11-25 17:31:56,739 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 472 transitions. Word has length 104 [2022-11-25 17:31:56,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:31:56,740 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 472 transitions. [2022-11-25 17:31:56,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:31:56,741 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 472 transitions. [2022-11-25 17:31:56,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-25 17:31:56,742 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:31:56,742 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:56,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:31:56,743 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:31:56,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:56,743 INFO L85 PathProgramCache]: Analyzing trace with hash -8134044, now seen corresponding path program 1 times [2022-11-25 17:31:56,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:56,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065375931] [2022-11-25 17:31:56,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:56,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:56,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:31:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:56,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:31:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:56,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:31:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:56,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:31:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:56,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:31:56,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:56,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:31:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:56,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:31:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:56,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:31:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:56,883 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2022-11-25 17:31:56,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:56,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065375931] [2022-11-25 17:31:56,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065375931] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:56,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:56,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:31:56,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108228049] [2022-11-25 17:31:56,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:56,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:31:56,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:56,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:31:56,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:31:56,886 INFO L87 Difference]: Start difference. First operand 332 states and 472 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:31:56,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:31:56,958 INFO L93 Difference]: Finished difference Result 594 states and 869 transitions. [2022-11-25 17:31:56,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:31:56,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 105 [2022-11-25 17:31:56,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:31:56,962 INFO L225 Difference]: With dead ends: 594 [2022-11-25 17:31:56,962 INFO L226 Difference]: Without dead ends: 326 [2022-11-25 17:31:56,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:31:56,964 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 15 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:31:56,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 771 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:31:56,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-11-25 17:31:56,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2022-11-25 17:31:56,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 261 states have (on average 1.3486590038314177) internal successors, (352), 265 states have internal predecessors, (352), 53 states have call successors, (53), 11 states have call predecessors, (53), 11 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2022-11-25 17:31:56,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 458 transitions. [2022-11-25 17:31:56,988 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 458 transitions. Word has length 105 [2022-11-25 17:31:56,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:31:56,989 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 458 transitions. [2022-11-25 17:31:56,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:31:56,989 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 458 transitions. [2022-11-25 17:31:56,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-25 17:31:56,991 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:31:56,991 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-25 17:31:56,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:31:56,992 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:31:56,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:56,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1589641163, now seen corresponding path program 1 times [2022-11-25 17:31:56,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:56,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873666644] [2022-11-25 17:31:56,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:56,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:31:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:31:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:31:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:31:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:31:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:31:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:31:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:31:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:31:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:31:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,182 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2022-11-25 17:31:57,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:57,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873666644] [2022-11-25 17:31:57,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873666644] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:57,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:57,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:31:57,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572502877] [2022-11-25 17:31:57,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:57,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:31:57,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:57,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:31:57,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:31:57,185 INFO L87 Difference]: Start difference. First operand 326 states and 458 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-25 17:31:57,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:31:57,227 INFO L93 Difference]: Finished difference Result 569 states and 818 transitions. [2022-11-25 17:31:57,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:31:57,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 124 [2022-11-25 17:31:57,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:31:57,230 INFO L225 Difference]: With dead ends: 569 [2022-11-25 17:31:57,231 INFO L226 Difference]: Without dead ends: 328 [2022-11-25 17:31:57,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:31:57,233 INFO L413 NwaCegarLoop]: 269 mSDtfsCounter, 0 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:31:57,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1065 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:31:57,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-11-25 17:31:57,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 326. [2022-11-25 17:31:57,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 261 states have (on average 1.3371647509578544) internal successors, (349), 265 states have internal predecessors, (349), 53 states have call successors, (53), 11 states have call predecessors, (53), 11 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2022-11-25 17:31:57,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 455 transitions. [2022-11-25 17:31:57,255 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 455 transitions. Word has length 124 [2022-11-25 17:31:57,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:31:57,255 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 455 transitions. [2022-11-25 17:31:57,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-25 17:31:57,256 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 455 transitions. [2022-11-25 17:31:57,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-11-25 17:31:57,258 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:31:57,258 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-25 17:31:57,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 17:31:57,258 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:31:57,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:57,259 INFO L85 PathProgramCache]: Analyzing trace with hash -164352821, now seen corresponding path program 1 times [2022-11-25 17:31:57,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:57,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672834771] [2022-11-25 17:31:57,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:57,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:31:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:31:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:31:57,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:31:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:31:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:31:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:31:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:31:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:31:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:31:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:31:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:31:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,445 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2022-11-25 17:31:57,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:57,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672834771] [2022-11-25 17:31:57,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672834771] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:57,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:57,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:31:57,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142395457] [2022-11-25 17:31:57,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:57,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:31:57,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:57,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:31:57,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:31:57,449 INFO L87 Difference]: Start difference. First operand 326 states and 455 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-25 17:31:57,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:31:57,528 INFO L93 Difference]: Finished difference Result 532 states and 778 transitions. [2022-11-25 17:31:57,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:31:57,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 157 [2022-11-25 17:31:57,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:31:57,531 INFO L225 Difference]: With dead ends: 532 [2022-11-25 17:31:57,532 INFO L226 Difference]: Without dead ends: 324 [2022-11-25 17:31:57,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:31:57,534 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 13 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:31:57,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 739 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:31:57,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-11-25 17:31:57,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2022-11-25 17:31:57,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 260 states have (on average 1.3346153846153845) internal successors, (347), 264 states have internal predecessors, (347), 52 states have call successors, (52), 11 states have call predecessors, (52), 11 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-11-25 17:31:57,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 451 transitions. [2022-11-25 17:31:57,555 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 451 transitions. Word has length 157 [2022-11-25 17:31:57,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:31:57,555 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 451 transitions. [2022-11-25 17:31:57,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-25 17:31:57,556 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 451 transitions. [2022-11-25 17:31:57,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-11-25 17:31:57,559 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:31:57,559 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:31:57,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 17:31:57,560 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:31:57,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:57,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1524827283, now seen corresponding path program 1 times [2022-11-25 17:31:57,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:57,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035506607] [2022-11-25 17:31:57,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:57,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:31:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:31:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:31:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:31:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:31:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:31:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:31:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:31:57,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:31:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:31:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:31:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:31:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:31:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:31:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-25 17:31:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:57,772 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2022-11-25 17:31:57,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:57,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035506607] [2022-11-25 17:31:57,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035506607] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:57,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:57,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:31:57,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794461877] [2022-11-25 17:31:57,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:57,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:31:57,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:57,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:31:57,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:31:57,778 INFO L87 Difference]: Start difference. First operand 324 states and 451 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-25 17:31:57,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:31:57,869 INFO L93 Difference]: Finished difference Result 472 states and 674 transitions. [2022-11-25 17:31:57,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:31:57,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 176 [2022-11-25 17:31:57,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:31:57,873 INFO L225 Difference]: With dead ends: 472 [2022-11-25 17:31:57,873 INFO L226 Difference]: Without dead ends: 307 [2022-11-25 17:31:57,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:31:57,875 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 35 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:31:57,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 720 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:31:57,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-11-25 17:31:57,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2022-11-25 17:31:57,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 246 states have (on average 1.3252032520325203) internal successors, (326), 250 states have internal predecessors, (326), 49 states have call successors, (49), 11 states have call predecessors, (49), 11 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2022-11-25 17:31:57,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 424 transitions. [2022-11-25 17:31:57,920 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 424 transitions. Word has length 176 [2022-11-25 17:31:57,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:31:57,921 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 424 transitions. [2022-11-25 17:31:57,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-25 17:31:57,921 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 424 transitions. [2022-11-25 17:31:57,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-11-25 17:31:57,925 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:31:57,925 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:31:57,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 17:31:57,926 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:31:57,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:57,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1721529288, now seen corresponding path program 1 times [2022-11-25 17:31:57,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:57,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668031937] [2022-11-25 17:31:57,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:57,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:31:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:31:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:31:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:31:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:31:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:31:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:31:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:31:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:31:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:31:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:31:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:31:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:31:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:31:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-25 17:31:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,143 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2022-11-25 17:31:58,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:58,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668031937] [2022-11-25 17:31:58,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668031937] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:58,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:58,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:31:58,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748785711] [2022-11-25 17:31:58,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:58,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:31:58,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:58,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:31:58,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:31:58,149 INFO L87 Difference]: Start difference. First operand 307 states and 424 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-25 17:31:58,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:31:58,222 INFO L93 Difference]: Finished difference Result 455 states and 647 transitions. [2022-11-25 17:31:58,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:31:58,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 178 [2022-11-25 17:31:58,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:31:58,227 INFO L225 Difference]: With dead ends: 455 [2022-11-25 17:31:58,227 INFO L226 Difference]: Without dead ends: 288 [2022-11-25 17:31:58,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:31:58,231 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 30 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:31:58,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 724 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:31:58,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-11-25 17:31:58,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2022-11-25 17:31:58,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 230 states have (on average 1.317391304347826) internal successors, (303), 234 states have internal predecessors, (303), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-25 17:31:58,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 395 transitions. [2022-11-25 17:31:58,252 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 395 transitions. Word has length 178 [2022-11-25 17:31:58,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:31:58,253 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 395 transitions. [2022-11-25 17:31:58,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-25 17:31:58,253 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 395 transitions. [2022-11-25 17:31:58,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-11-25 17:31:58,256 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:31:58,256 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:31:58,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 17:31:58,257 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:31:58,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:58,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1770335087, now seen corresponding path program 1 times [2022-11-25 17:31:58,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:58,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834141535] [2022-11-25 17:31:58,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:58,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:31:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:31:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:31:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:31:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:31:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:31:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:31:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:31:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:31:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:31:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:31:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:31:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:31:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:31:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-11-25 17:31:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,480 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2022-11-25 17:31:58,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:58,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834141535] [2022-11-25 17:31:58,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834141535] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:58,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:58,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:31:58,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46439639] [2022-11-25 17:31:58,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:58,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:31:58,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:58,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:31:58,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:31:58,484 INFO L87 Difference]: Start difference. First operand 288 states and 395 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-25 17:31:58,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:31:58,518 INFO L93 Difference]: Finished difference Result 435 states and 617 transitions. [2022-11-25 17:31:58,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:31:58,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 179 [2022-11-25 17:31:58,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:31:58,521 INFO L225 Difference]: With dead ends: 435 [2022-11-25 17:31:58,521 INFO L226 Difference]: Without dead ends: 288 [2022-11-25 17:31:58,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:31:58,523 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 0 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:31:58,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1044 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:31:58,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-11-25 17:31:58,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2022-11-25 17:31:58,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 230 states have (on average 1.291304347826087) internal successors, (297), 234 states have internal predecessors, (297), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-25 17:31:58,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 389 transitions. [2022-11-25 17:31:58,542 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 389 transitions. Word has length 179 [2022-11-25 17:31:58,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:31:58,542 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 389 transitions. [2022-11-25 17:31:58,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-25 17:31:58,543 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 389 transitions. [2022-11-25 17:31:58,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-11-25 17:31:58,546 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:31:58,547 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:31:58,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 17:31:58,547 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:31:58,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:58,548 INFO L85 PathProgramCache]: Analyzing trace with hash -984884076, now seen corresponding path program 1 times [2022-11-25 17:31:58,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:58,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954908955] [2022-11-25 17:31:58,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:58,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:31:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:31:58,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:31:58,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:31:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:31:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:31:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:31:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:31:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:31:58,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:31:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:31:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:31:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:31:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-11-25 17:31:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:58,808 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2022-11-25 17:31:58,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:58,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954908955] [2022-11-25 17:31:58,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954908955] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:31:58,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371930559] [2022-11-25 17:31:58,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:58,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:31:58,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:31:58,811 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:31:58,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 17:31:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:59,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:31:59,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:31:59,108 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2022-11-25 17:31:59,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:31:59,264 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2022-11-25 17:31:59,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371930559] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 17:31:59,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:31:59,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2022-11-25 17:31:59,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722699477] [2022-11-25 17:31:59,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:59,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:31:59,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:59,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:31:59,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:31:59,268 INFO L87 Difference]: Start difference. First operand 288 states and 389 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 17:31:59,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:31:59,331 INFO L93 Difference]: Finished difference Result 456 states and 639 transitions. [2022-11-25 17:31:59,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:31:59,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 186 [2022-11-25 17:31:59,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:31:59,334 INFO L225 Difference]: With dead ends: 456 [2022-11-25 17:31:59,335 INFO L226 Difference]: Without dead ends: 267 [2022-11-25 17:31:59,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:31:59,336 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 30 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:31:59,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 495 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:31:59,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-11-25 17:31:59,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2022-11-25 17:31:59,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 212 states have (on average 1.2830188679245282) internal successors, (272), 216 states have internal predecessors, (272), 43 states have call successors, (43), 11 states have call predecessors, (43), 11 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2022-11-25 17:31:59,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 358 transitions. [2022-11-25 17:31:59,355 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 358 transitions. Word has length 186 [2022-11-25 17:31:59,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:31:59,356 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 358 transitions. [2022-11-25 17:31:59,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 17:31:59,356 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 358 transitions. [2022-11-25 17:31:59,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-11-25 17:31:59,359 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:31:59,360 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:31:59,372 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 17:31:59,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-25 17:31:59,566 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:31:59,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:59,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1901722937, now seen corresponding path program 1 times [2022-11-25 17:31:59,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:59,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404801761] [2022-11-25 17:31:59,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:59,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:59,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:31:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:59,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:31:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:59,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:31:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:59,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:31:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:59,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:31:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:59,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:31:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:59,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:31:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:59,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:31:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:59,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:31:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:59,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:31:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:59,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:31:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:59,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:31:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:59,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:31:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:59,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:31:59,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:59,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:31:59,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:59,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:31:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:59,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 17:31:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:59,783 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2022-11-25 17:31:59,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:59,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404801761] [2022-11-25 17:31:59,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404801761] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:59,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:59,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:31:59,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014257683] [2022-11-25 17:31:59,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:59,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:31:59,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:59,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:31:59,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:31:59,786 INFO L87 Difference]: Start difference. First operand 267 states and 358 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-11-25 17:31:59,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:31:59,849 INFO L93 Difference]: Finished difference Result 413 states and 580 transitions. [2022-11-25 17:31:59,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:31:59,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 210 [2022-11-25 17:31:59,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:31:59,852 INFO L225 Difference]: With dead ends: 413 [2022-11-25 17:31:59,852 INFO L226 Difference]: Without dead ends: 273 [2022-11-25 17:31:59,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:31:59,855 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 6 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:31:59,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 764 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:31:59,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-11-25 17:31:59,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2022-11-25 17:31:59,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 215 states have (on average 1.2790697674418605) internal successors, (275), 219 states have internal predecessors, (275), 43 states have call successors, (43), 12 states have call predecessors, (43), 12 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2022-11-25 17:31:59,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 361 transitions. [2022-11-25 17:31:59,871 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 361 transitions. Word has length 210 [2022-11-25 17:31:59,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:31:59,873 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 361 transitions. [2022-11-25 17:31:59,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-11-25 17:31:59,874 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 361 transitions. [2022-11-25 17:31:59,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2022-11-25 17:31:59,877 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:31:59,877 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-25 17:31:59,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 17:31:59,878 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:31:59,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:59,878 INFO L85 PathProgramCache]: Analyzing trace with hash -2012455842, now seen corresponding path program 1 times [2022-11-25 17:31:59,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:59,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116927795] [2022-11-25 17:31:59,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:59,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:59,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:31:59,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:59,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:31:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:59,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:31:59,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:32:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:32:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:32:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:32:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:32:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:32:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:32:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:32:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:32:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:32:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:32:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 17:32:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-25 17:32:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,101 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2022-11-25 17:32:00,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:32:00,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116927795] [2022-11-25 17:32:00,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116927795] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:32:00,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944241509] [2022-11-25 17:32:00,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:00,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:32:00,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:32:00,104 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:32:00,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 17:32:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 700 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:32:00,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:32:00,366 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2022-11-25 17:32:00,366 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:32:00,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944241509] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:32:00,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:32:00,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-11-25 17:32:00,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443985837] [2022-11-25 17:32:00,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:00,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:32:00,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:32:00,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:32:00,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:32:00,370 INFO L87 Difference]: Start difference. First operand 271 states and 361 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-11-25 17:32:00,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:32:00,419 INFO L93 Difference]: Finished difference Result 422 states and 587 transitions. [2022-11-25 17:32:00,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:32:00,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 217 [2022-11-25 17:32:00,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:32:00,423 INFO L225 Difference]: With dead ends: 422 [2022-11-25 17:32:00,423 INFO L226 Difference]: Without dead ends: 278 [2022-11-25 17:32:00,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 254 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-25 17:32:00,425 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 7 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:32:00,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 769 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:32:00,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-11-25 17:32:00,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2022-11-25 17:32:00,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 219 states have (on average 1.273972602739726) internal successors, (279), 223 states have internal predecessors, (279), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2022-11-25 17:32:00,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 365 transitions. [2022-11-25 17:32:00,444 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 365 transitions. Word has length 217 [2022-11-25 17:32:00,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:32:00,445 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 365 transitions. [2022-11-25 17:32:00,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-11-25 17:32:00,446 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 365 transitions. [2022-11-25 17:32:00,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-11-25 17:32:00,449 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:32:00,450 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:32:00,465 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 17:32:00,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:32:00,657 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:32:00,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:00,657 INFO L85 PathProgramCache]: Analyzing trace with hash -323224646, now seen corresponding path program 1 times [2022-11-25 17:32:00,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:32:00,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248881619] [2022-11-25 17:32:00,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:00,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:32:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:32:00,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:32:00,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:32:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:32:00,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:32:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:32:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:32:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:32:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:32:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:32:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:32:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:32:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:32:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:32:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 17:32:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-25 17:32:00,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-25 17:32:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:00,958 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2022-11-25 17:32:00,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:32:00,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248881619] [2022-11-25 17:32:00,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248881619] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:32:00,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347667709] [2022-11-25 17:32:00,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:00,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:32:00,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:32:00,962 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:32:00,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 17:32:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:01,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:32:01,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:32:01,230 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2022-11-25 17:32:01,230 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:32:01,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347667709] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:32:01,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:32:01,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-11-25 17:32:01,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928515760] [2022-11-25 17:32:01,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:01,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:32:01,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:32:01,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:32:01,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:32:01,234 INFO L87 Difference]: Start difference. First operand 276 states and 365 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-25 17:32:01,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:32:01,279 INFO L93 Difference]: Finished difference Result 424 states and 585 transitions. [2022-11-25 17:32:01,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:32:01,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 225 [2022-11-25 17:32:01,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:32:01,283 INFO L225 Difference]: With dead ends: 424 [2022-11-25 17:32:01,283 INFO L226 Difference]: Without dead ends: 275 [2022-11-25 17:32:01,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 264 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-25 17:32:01,285 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 7 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:32:01,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 755 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:32:01,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-11-25 17:32:01,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2022-11-25 17:32:01,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 219 states have (on average 1.2602739726027397) internal successors, (276), 222 states have internal predecessors, (276), 42 states have call successors, (42), 13 states have call predecessors, (42), 13 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-11-25 17:32:01,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 360 transitions. [2022-11-25 17:32:01,304 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 360 transitions. Word has length 225 [2022-11-25 17:32:01,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:32:01,305 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 360 transitions. [2022-11-25 17:32:01,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-25 17:32:01,306 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 360 transitions. [2022-11-25 17:32:01,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2022-11-25 17:32:01,309 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:32:01,310 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-25 17:32:01,324 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 17:32:01,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:32:01,518 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:32:01,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:01,519 INFO L85 PathProgramCache]: Analyzing trace with hash -270122890, now seen corresponding path program 1 times [2022-11-25 17:32:01,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:32:01,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738590212] [2022-11-25 17:32:01,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:01,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:32:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:01,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:32:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:01,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:32:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:01,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:32:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:01,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:32:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:01,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:32:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:01,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:32:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:01,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:32:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:01,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:32:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:01,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:32:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:01,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:32:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:01,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:01,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:32:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:01,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:32:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:01,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:32:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:01,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:01,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:32:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:01,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 17:32:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:01,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-25 17:32:01,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:01,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-25 17:32:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:01,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-25 17:32:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:01,752 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2022-11-25 17:32:01,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:32:01,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738590212] [2022-11-25 17:32:01,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738590212] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:32:01,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:32:01,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:32:01,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484664441] [2022-11-25 17:32:01,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:01,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:32:01,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:32:01,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:32:01,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:32:01,756 INFO L87 Difference]: Start difference. First operand 275 states and 360 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2022-11-25 17:32:02,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:32:02,144 INFO L93 Difference]: Finished difference Result 457 states and 636 transitions. [2022-11-25 17:32:02,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:32:02,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 232 [2022-11-25 17:32:02,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:32:02,148 INFO L225 Difference]: With dead ends: 457 [2022-11-25 17:32:02,148 INFO L226 Difference]: Without dead ends: 309 [2022-11-25 17:32:02,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:32:02,150 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 175 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:32:02,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 529 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:32:02,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-11-25 17:32:02,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 274. [2022-11-25 17:32:02,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 219 states have (on average 1.2557077625570776) internal successors, (275), 221 states have internal predecessors, (275), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-11-25 17:32:02,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 357 transitions. [2022-11-25 17:32:02,180 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 357 transitions. Word has length 232 [2022-11-25 17:32:02,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:32:02,181 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 357 transitions. [2022-11-25 17:32:02,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2022-11-25 17:32:02,182 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 357 transitions. [2022-11-25 17:32:02,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-11-25 17:32:02,185 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:32:02,186 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-25 17:32:02,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 17:32:02,186 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:32:02,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:02,187 INFO L85 PathProgramCache]: Analyzing trace with hash 28448745, now seen corresponding path program 1 times [2022-11-25 17:32:02,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:32:02,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404478362] [2022-11-25 17:32:02,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:02,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:32:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:02,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:32:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:02,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:32:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:02,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:32:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:02,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:32:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:02,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:32:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:02,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:32:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:02,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:32:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:02,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:32:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:02,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:32:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:02,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:32:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:02,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:02,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:32:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:02,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:32:02,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:02,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:32:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:02,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:02,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:32:02,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:02,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 17:32:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:02,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-25 17:32:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:02,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-25 17:32:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:02,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-25 17:32:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:02,554 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2022-11-25 17:32:02,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:32:02,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404478362] [2022-11-25 17:32:02,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404478362] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:32:02,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:32:02,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:32:02,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801635071] [2022-11-25 17:32:02,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:02,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:32:02,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:32:02,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:32:02,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:32:02,563 INFO L87 Difference]: Start difference. First operand 274 states and 357 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-25 17:32:03,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:32:03,518 INFO L93 Difference]: Finished difference Result 634 states and 855 transitions. [2022-11-25 17:32:03,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:32:03,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 235 [2022-11-25 17:32:03,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:32:03,523 INFO L225 Difference]: With dead ends: 634 [2022-11-25 17:32:03,523 INFO L226 Difference]: Without dead ends: 487 [2022-11-25 17:32:03,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:32:03,530 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 421 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 17:32:03,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 653 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 17:32:03,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2022-11-25 17:32:03,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 481. [2022-11-25 17:32:03,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 379 states have (on average 1.3087071240105541) internal successors, (496), 381 states have internal predecessors, (496), 70 states have call successors, (70), 31 states have call predecessors, (70), 31 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2022-11-25 17:32:03,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 636 transitions. [2022-11-25 17:32:03,580 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 636 transitions. Word has length 235 [2022-11-25 17:32:03,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:32:03,581 INFO L495 AbstractCegarLoop]: Abstraction has 481 states and 636 transitions. [2022-11-25 17:32:03,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-25 17:32:03,581 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 636 transitions. [2022-11-25 17:32:03,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2022-11-25 17:32:03,586 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:32:03,586 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:32:03,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-25 17:32:03,587 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:32:03,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:03,588 INFO L85 PathProgramCache]: Analyzing trace with hash 443330850, now seen corresponding path program 1 times [2022-11-25 17:32:03,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:32:03,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018493497] [2022-11-25 17:32:03,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:03,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:32:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:03,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:32:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:03,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:32:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:03,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:32:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:03,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:32:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:03,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:32:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:03,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:32:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:03,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:32:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:03,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:32:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:03,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:32:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:03,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:32:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:03,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:03,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:03,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:32:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:03,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:32:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:03,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:32:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:03,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:03,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:32:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:03,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 17:32:03,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:03,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-25 17:32:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:03,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-25 17:32:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:03,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-25 17:32:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:03,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-25 17:32:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:03,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-11-25 17:32:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:03,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-11-25 17:32:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:03,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-11-25 17:32:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:03,865 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2022-11-25 17:32:03,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:32:03,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018493497] [2022-11-25 17:32:03,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018493497] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:32:03,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:32:03,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:32:03,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186907000] [2022-11-25 17:32:03,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:03,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:32:03,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:32:03,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:32:03,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:32:03,870 INFO L87 Difference]: Start difference. First operand 481 states and 636 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-11-25 17:32:04,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:32:04,614 INFO L93 Difference]: Finished difference Result 1052 states and 1442 transitions. [2022-11-25 17:32:04,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:32:04,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 266 [2022-11-25 17:32:04,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:32:04,620 INFO L225 Difference]: With dead ends: 1052 [2022-11-25 17:32:04,621 INFO L226 Difference]: Without dead ends: 770 [2022-11-25 17:32:04,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:32:04,623 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 224 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:32:04,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 494 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 17:32:04,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2022-11-25 17:32:04,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 601. [2022-11-25 17:32:04,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 474 states have (on average 1.3164556962025316) internal successors, (624), 480 states have internal predecessors, (624), 85 states have call successors, (85), 41 states have call predecessors, (85), 41 states have return successors, (85), 81 states have call predecessors, (85), 85 states have call successors, (85) [2022-11-25 17:32:04,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 794 transitions. [2022-11-25 17:32:04,707 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 794 transitions. Word has length 266 [2022-11-25 17:32:04,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:32:04,708 INFO L495 AbstractCegarLoop]: Abstraction has 601 states and 794 transitions. [2022-11-25 17:32:04,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-11-25 17:32:04,708 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 794 transitions. [2022-11-25 17:32:04,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2022-11-25 17:32:04,714 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:32:04,714 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:32:04,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-25 17:32:04,715 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:32:04,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:04,716 INFO L85 PathProgramCache]: Analyzing trace with hash 363579022, now seen corresponding path program 1 times [2022-11-25 17:32:04,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:32:04,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159781475] [2022-11-25 17:32:04,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:04,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:32:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:04,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:32:04,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:04,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:32:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:04,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:32:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:04,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:32:04,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:04,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:32:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:04,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:32:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:04,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:32:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:04,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:32:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:04,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:32:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:04,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:32:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:04,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:04,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:32:04,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:04,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:32:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:04,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:32:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:04,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:04,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:32:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:04,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 17:32:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:04,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-25 17:32:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:04,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-25 17:32:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:04,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-25 17:32:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:04,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-11-25 17:32:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:04,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-11-25 17:32:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:04,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-11-25 17:32:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:04,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-11-25 17:32:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:04,947 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2022-11-25 17:32:04,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:32:04,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159781475] [2022-11-25 17:32:04,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159781475] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:32:04,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:32:04,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:32:04,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371457298] [2022-11-25 17:32:04,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:04,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:32:04,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:32:04,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:32:04,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:32:04,951 INFO L87 Difference]: Start difference. First operand 601 states and 794 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-11-25 17:32:05,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:32:05,675 INFO L93 Difference]: Finished difference Result 1329 states and 1806 transitions. [2022-11-25 17:32:05,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:32:05,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 267 [2022-11-25 17:32:05,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:32:05,683 INFO L225 Difference]: With dead ends: 1329 [2022-11-25 17:32:05,683 INFO L226 Difference]: Without dead ends: 960 [2022-11-25 17:32:05,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:32:05,687 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 225 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:32:05,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 519 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:32:05,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2022-11-25 17:32:05,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 952. [2022-11-25 17:32:05,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 745 states have (on average 1.3436241610738255) internal successors, (1001), 759 states have internal predecessors, (1001), 139 states have call successors, (139), 67 states have call predecessors, (139), 67 states have return successors, (139), 129 states have call predecessors, (139), 139 states have call successors, (139) [2022-11-25 17:32:05,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1279 transitions. [2022-11-25 17:32:05,856 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1279 transitions. Word has length 267 [2022-11-25 17:32:05,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:32:05,858 INFO L495 AbstractCegarLoop]: Abstraction has 952 states and 1279 transitions. [2022-11-25 17:32:05,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-11-25 17:32:05,858 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1279 transitions. [2022-11-25 17:32:05,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-11-25 17:32:05,863 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:32:05,864 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:32:05,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-25 17:32:05,865 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:32:05,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:05,866 INFO L85 PathProgramCache]: Analyzing trace with hash -947160963, now seen corresponding path program 1 times [2022-11-25 17:32:05,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:32:05,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24255705] [2022-11-25 17:32:05,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:05,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:32:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:05,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:32:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:05,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:32:05,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:05,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:32:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:05,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:32:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:05,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:32:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:06,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:32:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:06,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:32:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:06,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:32:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:06,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:32:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:06,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:32:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:06,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:06,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:32:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:06,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:32:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:06,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:32:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:06,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:06,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:32:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:06,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 17:32:06,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:06,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-25 17:32:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:06,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-25 17:32:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:06,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-25 17:32:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:06,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-11-25 17:32:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:06,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-11-25 17:32:06,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:06,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-11-25 17:32:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:06,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-11-25 17:32:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:06,105 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2022-11-25 17:32:06,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:32:06,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24255705] [2022-11-25 17:32:06,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24255705] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:32:06,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:32:06,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:32:06,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647134874] [2022-11-25 17:32:06,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:06,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:32:06,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:32:06,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:32:06,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:32:06,110 INFO L87 Difference]: Start difference. First operand 952 states and 1279 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-25 17:32:06,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:32:06,898 INFO L93 Difference]: Finished difference Result 2220 states and 3057 transitions. [2022-11-25 17:32:06,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:32:06,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 268 [2022-11-25 17:32:06,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:32:06,908 INFO L225 Difference]: With dead ends: 2220 [2022-11-25 17:32:06,908 INFO L226 Difference]: Without dead ends: 1540 [2022-11-25 17:32:06,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:32:06,911 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 225 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:32:06,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 543 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:32:06,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2022-11-25 17:32:07,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 1526. [2022-11-25 17:32:07,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1187 states have (on average 1.3689974726200504) internal successors, (1625), 1215 states have internal predecessors, (1625), 231 states have call successors, (231), 107 states have call predecessors, (231), 107 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2022-11-25 17:32:07,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 2087 transitions. [2022-11-25 17:32:07,148 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 2087 transitions. Word has length 268 [2022-11-25 17:32:07,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:32:07,149 INFO L495 AbstractCegarLoop]: Abstraction has 1526 states and 2087 transitions. [2022-11-25 17:32:07,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-25 17:32:07,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 2087 transitions. [2022-11-25 17:32:07,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-11-25 17:32:07,156 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:32:07,156 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:32:07,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-25 17:32:07,157 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:32:07,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:07,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1341527749, now seen corresponding path program 1 times [2022-11-25 17:32:07,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:32:07,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035457386] [2022-11-25 17:32:07,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:07,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:32:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:07,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:32:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:07,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:32:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:07,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:32:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:07,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:32:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:07,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:32:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:07,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:32:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:07,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:32:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:07,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:32:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:07,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:32:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:07,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:32:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:07,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:07,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:32:07,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:07,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:32:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:07,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:32:07,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:07,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:07,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:32:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:07,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 17:32:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:07,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-25 17:32:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:07,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-25 17:32:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:07,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-25 17:32:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:07,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-11-25 17:32:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:07,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-11-25 17:32:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:07,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-11-25 17:32:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:07,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-11-25 17:32:07,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:07,611 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2022-11-25 17:32:07,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:32:07,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035457386] [2022-11-25 17:32:07,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035457386] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:32:07,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122951445] [2022-11-25 17:32:07,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:07,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:32:07,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:32:07,614 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:32:07,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 17:32:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:07,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 909 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:32:07,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:32:07,938 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2022-11-25 17:32:07,938 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:32:07,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122951445] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:32:07,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:32:07,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2022-11-25 17:32:07,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810188872] [2022-11-25 17:32:07,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:07,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:32:07,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:32:07,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:32:07,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:32:07,942 INFO L87 Difference]: Start difference. First operand 1526 states and 2087 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-25 17:32:08,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:32:08,236 INFO L93 Difference]: Finished difference Result 2820 states and 3914 transitions. [2022-11-25 17:32:08,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:32:08,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 268 [2022-11-25 17:32:08,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:32:08,246 INFO L225 Difference]: With dead ends: 2820 [2022-11-25 17:32:08,246 INFO L226 Difference]: Without dead ends: 1526 [2022-11-25 17:32:08,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:32:08,251 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 51 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:32:08,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 672 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:32:08,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2022-11-25 17:32:08,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 1526. [2022-11-25 17:32:08,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1187 states have (on average 1.3487784330244312) internal successors, (1601), 1215 states have internal predecessors, (1601), 231 states have call successors, (231), 107 states have call predecessors, (231), 107 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2022-11-25 17:32:08,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 2063 transitions. [2022-11-25 17:32:08,506 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 2063 transitions. Word has length 268 [2022-11-25 17:32:08,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:32:08,506 INFO L495 AbstractCegarLoop]: Abstraction has 1526 states and 2063 transitions. [2022-11-25 17:32:08,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-25 17:32:08,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 2063 transitions. [2022-11-25 17:32:08,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-11-25 17:32:08,513 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:32:08,513 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:32:08,519 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 17:32:08,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:32:08,720 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:32:08,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:08,720 INFO L85 PathProgramCache]: Analyzing trace with hash 731956630, now seen corresponding path program 1 times [2022-11-25 17:32:08,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:32:08,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740794138] [2022-11-25 17:32:08,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:08,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:32:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:08,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:32:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:08,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:32:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:08,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:32:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:09,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:32:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:09,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:32:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:09,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:32:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:09,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:32:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:09,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:32:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:09,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:32:09,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:09,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:32:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:09,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:09,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:32:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:09,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:32:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:09,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:32:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:09,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:09,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:32:09,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:09,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 17:32:09,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:09,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-25 17:32:09,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:09,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-25 17:32:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:09,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-25 17:32:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:09,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-11-25 17:32:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:09,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-11-25 17:32:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:09,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-11-25 17:32:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:09,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-11-25 17:32:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:09,148 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2022-11-25 17:32:09,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:32:09,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740794138] [2022-11-25 17:32:09,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740794138] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:32:09,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615787062] [2022-11-25 17:32:09,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:09,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:32:09,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:32:09,151 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:32:09,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 17:32:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:09,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:32:09,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:32:09,468 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2022-11-25 17:32:09,468 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:32:09,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615787062] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:32:09,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:32:09,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2022-11-25 17:32:09,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647758118] [2022-11-25 17:32:09,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:09,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:32:09,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:32:09,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:32:09,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:32:09,471 INFO L87 Difference]: Start difference. First operand 1526 states and 2063 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-25 17:32:09,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:32:09,767 INFO L93 Difference]: Finished difference Result 2820 states and 3858 transitions. [2022-11-25 17:32:09,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:32:09,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 269 [2022-11-25 17:32:09,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:32:09,776 INFO L225 Difference]: With dead ends: 2820 [2022-11-25 17:32:09,776 INFO L226 Difference]: Without dead ends: 1574 [2022-11-25 17:32:09,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:32:09,781 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 15 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:32:09,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 695 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:32:09,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2022-11-25 17:32:09,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1574. [2022-11-25 17:32:09,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1574 states, 1227 states have (on average 1.3504482477587612) internal successors, (1657), 1255 states have internal predecessors, (1657), 231 states have call successors, (231), 115 states have call predecessors, (231), 115 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2022-11-25 17:32:09,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 2119 transitions. [2022-11-25 17:32:09,979 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 2119 transitions. Word has length 269 [2022-11-25 17:32:09,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:32:09,980 INFO L495 AbstractCegarLoop]: Abstraction has 1574 states and 2119 transitions. [2022-11-25 17:32:09,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-25 17:32:09,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 2119 transitions. [2022-11-25 17:32:09,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2022-11-25 17:32:09,985 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:32:09,985 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:32:09,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 17:32:10,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-25 17:32:10,192 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:32:10,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:10,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1189094123, now seen corresponding path program 1 times [2022-11-25 17:32:10,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:32:10,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397111864] [2022-11-25 17:32:10,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:10,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:32:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:10,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:32:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:10,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:32:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:10,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:32:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:10,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:32:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:10,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:32:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:10,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:32:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:10,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:32:10,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:10,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:32:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:10,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:32:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:10,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:32:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:10,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:10,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:10,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:32:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:10,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:32:10,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:10,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:32:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:10,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:10,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:32:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:10,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 17:32:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:10,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-25 17:32:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:10,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-25 17:32:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:10,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-25 17:32:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:10,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-11-25 17:32:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:10,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-11-25 17:32:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:10,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-11-25 17:32:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:10,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-11-25 17:32:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:10,759 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2022-11-25 17:32:10,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:32:10,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397111864] [2022-11-25 17:32:10,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397111864] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:32:10,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:32:10,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:32:10,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922699357] [2022-11-25 17:32:10,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:10,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:32:10,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:32:10,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:32:10,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:32:10,762 INFO L87 Difference]: Start difference. First operand 1574 states and 2119 transitions. Second operand has 7 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-11-25 17:32:11,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:32:11,683 INFO L93 Difference]: Finished difference Result 2404 states and 3466 transitions. [2022-11-25 17:32:11,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:32:11,684 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 270 [2022-11-25 17:32:11,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:32:11,705 INFO L225 Difference]: With dead ends: 2404 [2022-11-25 17:32:11,706 INFO L226 Difference]: Without dead ends: 2402 [2022-11-25 17:32:11,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:32:11,710 INFO L413 NwaCegarLoop]: 321 mSDtfsCounter, 234 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 1490 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:32:11,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 1490 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 17:32:11,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2402 states. [2022-11-25 17:32:11,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2402 to 1622. [2022-11-25 17:32:11,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 1259 states have (on average 1.34154090548054) internal successors, (1689), 1295 states have internal predecessors, (1689), 239 states have call successors, (239), 123 states have call predecessors, (239), 123 states have return successors, (239), 211 states have call predecessors, (239), 239 states have call successors, (239) [2022-11-25 17:32:11,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2167 transitions. [2022-11-25 17:32:11,976 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2167 transitions. Word has length 270 [2022-11-25 17:32:11,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:32:11,977 INFO L495 AbstractCegarLoop]: Abstraction has 1622 states and 2167 transitions. [2022-11-25 17:32:11,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-11-25 17:32:11,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2167 transitions. [2022-11-25 17:32:11,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2022-11-25 17:32:11,980 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:32:11,980 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:32:11,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-25 17:32:11,981 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:32:11,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:11,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1337818136, now seen corresponding path program 1 times [2022-11-25 17:32:11,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:32:11,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370446870] [2022-11-25 17:32:11,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:11,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:32:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:12,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:32:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:12,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:32:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:12,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:32:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:12,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:32:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:12,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:32:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:12,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:32:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:12,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:32:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:12,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:32:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:12,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:32:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:12,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:32:12,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:12,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:12,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:32:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:12,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:32:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:12,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:32:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:12,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:12,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:32:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:12,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 17:32:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:12,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-25 17:32:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:12,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-25 17:32:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:12,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-25 17:32:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:12,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-11-25 17:32:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:12,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-11-25 17:32:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:12,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-11-25 17:32:12,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:12,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-11-25 17:32:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:12,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-11-25 17:32:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:12,388 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 142 proven. 27 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2022-11-25 17:32:12,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:32:12,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370446870] [2022-11-25 17:32:12,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370446870] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:32:12,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403218379] [2022-11-25 17:32:12,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:12,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:32:12,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:32:12,391 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:32:12,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 17:32:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:12,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 17:32:12,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:32:12,947 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 251 proven. 37 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2022-11-25 17:32:12,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:32:13,604 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 146 proven. 23 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2022-11-25 17:32:13,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403218379] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:32:13,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:32:13,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 19 [2022-11-25 17:32:13,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641206467] [2022-11-25 17:32:13,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:32:13,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-25 17:32:13,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:32:13,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 17:32:13,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-11-25 17:32:13,618 INFO L87 Difference]: Start difference. First operand 1622 states and 2167 transitions. Second operand has 19 states, 19 states have (on average 7.947368421052632) internal successors, (151), 14 states have internal predecessors, (151), 5 states have call successors, (32), 5 states have call predecessors, (32), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) [2022-11-25 17:32:16,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:32:16,789 INFO L93 Difference]: Finished difference Result 4724 states and 6830 transitions. [2022-11-25 17:32:16,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-25 17:32:16,790 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.947368421052632) internal successors, (151), 14 states have internal predecessors, (151), 5 states have call successors, (32), 5 states have call predecessors, (32), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) Word has length 278 [2022-11-25 17:32:16,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:32:16,809 INFO L225 Difference]: With dead ends: 4724 [2022-11-25 17:32:16,809 INFO L226 Difference]: Without dead ends: 3382 [2022-11-25 17:32:16,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 641 GetRequests, 601 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=211, Invalid=1121, Unknown=0, NotChecked=0, Total=1332 [2022-11-25 17:32:16,815 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 552 mSDsluCounter, 2372 mSDsCounter, 0 mSdLazyCounter, 2598 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 2667 SdHoareTripleChecker+Invalid, 2787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 2598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:32:16,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 2667 Invalid, 2787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 2598 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-25 17:32:16,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3382 states. [2022-11-25 17:32:17,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3382 to 2408. [2022-11-25 17:32:17,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2408 states, 1862 states have (on average 1.3286788399570355) internal successors, (2474), 1914 states have internal predecessors, (2474), 356 states have call successors, (356), 183 states have call predecessors, (356), 189 states have return successors, (364), 318 states have call predecessors, (364), 356 states have call successors, (364) [2022-11-25 17:32:17,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 2408 states and 3194 transitions. [2022-11-25 17:32:17,196 INFO L78 Accepts]: Start accepts. Automaton has 2408 states and 3194 transitions. Word has length 278 [2022-11-25 17:32:17,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:32:17,197 INFO L495 AbstractCegarLoop]: Abstraction has 2408 states and 3194 transitions. [2022-11-25 17:32:17,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.947368421052632) internal successors, (151), 14 states have internal predecessors, (151), 5 states have call successors, (32), 5 states have call predecessors, (32), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) [2022-11-25 17:32:17,197 INFO L276 IsEmpty]: Start isEmpty. Operand 2408 states and 3194 transitions. [2022-11-25 17:32:17,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2022-11-25 17:32:17,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:32:17,201 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:32:17,219 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 17:32:17,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-25 17:32:17,415 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:32:17,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:17,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1995535143, now seen corresponding path program 1 times [2022-11-25 17:32:17,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:32:17,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294001884] [2022-11-25 17:32:17,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:17,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:32:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:17,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:32:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:17,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:32:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:17,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:32:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:17,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:32:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:17,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:32:17,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:17,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:32:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:17,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:32:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:17,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:32:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:17,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:32:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:17,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:32:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:17,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:17,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:32:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:17,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:32:17,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:17,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:32:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:17,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:17,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:32:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:17,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 17:32:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:17,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-25 17:32:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:17,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-25 17:32:17,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:17,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-25 17:32:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:17,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-11-25 17:32:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:17,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-11-25 17:32:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:17,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-11-25 17:32:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:17,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-11-25 17:32:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:17,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-11-25 17:32:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:17,617 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2022-11-25 17:32:17,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:32:17,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294001884] [2022-11-25 17:32:17,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294001884] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:32:17,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52553115] [2022-11-25 17:32:17,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:17,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:32:17,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:32:17,619 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:32:17,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 17:32:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:17,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 934 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:32:17,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:32:17,869 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2022-11-25 17:32:17,869 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:32:17,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52553115] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:32:17,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:32:17,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-11-25 17:32:17,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852224552] [2022-11-25 17:32:17,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:17,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:32:17,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:32:17,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:32:17,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:32:17,872 INFO L87 Difference]: Start difference. First operand 2408 states and 3194 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-25 17:32:18,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:32:18,185 INFO L93 Difference]: Finished difference Result 4649 states and 6264 transitions. [2022-11-25 17:32:18,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:32:18,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 278 [2022-11-25 17:32:18,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:32:18,198 INFO L225 Difference]: With dead ends: 4649 [2022-11-25 17:32:18,199 INFO L226 Difference]: Without dead ends: 2344 [2022-11-25 17:32:18,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 328 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-25 17:32:18,206 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 11 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:32:18,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 695 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:32:18,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2344 states. [2022-11-25 17:32:18,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2344 to 2344. [2022-11-25 17:32:18,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2344 states, 1818 states have (on average 1.3113311331133113) internal successors, (2384), 1870 states have internal predecessors, (2384), 340 states have call successors, (340), 183 states have call predecessors, (340), 185 states have return successors, (344), 298 states have call predecessors, (344), 340 states have call successors, (344) [2022-11-25 17:32:18,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 2344 states and 3068 transitions. [2022-11-25 17:32:18,548 INFO L78 Accepts]: Start accepts. Automaton has 2344 states and 3068 transitions. Word has length 278 [2022-11-25 17:32:18,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:32:18,549 INFO L495 AbstractCegarLoop]: Abstraction has 2344 states and 3068 transitions. [2022-11-25 17:32:18,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-25 17:32:18,550 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 3068 transitions. [2022-11-25 17:32:18,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2022-11-25 17:32:18,554 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:32:18,554 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:32:18,566 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 17:32:18,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:32:18,761 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:32:18,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:18,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1834324692, now seen corresponding path program 1 times [2022-11-25 17:32:18,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:32:18,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213724704] [2022-11-25 17:32:18,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:18,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:32:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:18,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:32:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:18,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:32:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:18,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:32:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:18,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:32:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:18,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:32:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:18,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:32:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:18,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:32:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:18,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:32:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:18,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:32:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:18,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:32:18,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:18,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:18,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:32:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:18,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:32:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:18,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:32:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:18,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 17:32:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:18,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-25 17:32:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:18,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-25 17:32:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:18,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-25 17:32:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:18,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-11-25 17:32:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:18,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-11-25 17:32:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:18,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-11-25 17:32:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:18,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-11-25 17:32:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:18,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-11-25 17:32:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:18,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2022-11-25 17:32:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:18,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-11-25 17:32:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:18,946 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 121 proven. 19 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2022-11-25 17:32:18,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:32:18,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213724704] [2022-11-25 17:32:18,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213724704] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:32:18,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675842911] [2022-11-25 17:32:18,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:18,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:32:18,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:32:18,948 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:32:18,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 17:32:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:19,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:32:19,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:32:19,208 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2022-11-25 17:32:19,208 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:32:19,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675842911] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:32:19,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:32:19,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-11-25 17:32:19,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727213602] [2022-11-25 17:32:19,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:19,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:32:19,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:32:19,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:32:19,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:32:19,211 INFO L87 Difference]: Start difference. First operand 2344 states and 3068 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-25 17:32:19,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:32:19,560 INFO L93 Difference]: Finished difference Result 4431 states and 5905 transitions. [2022-11-25 17:32:19,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:32:19,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 281 [2022-11-25 17:32:19,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:32:19,572 INFO L225 Difference]: With dead ends: 4431 [2022-11-25 17:32:19,573 INFO L226 Difference]: Without dead ends: 2172 [2022-11-25 17:32:19,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 331 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-25 17:32:19,581 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 8 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:32:19,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 698 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:32:19,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states. [2022-11-25 17:32:19,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 2172. [2022-11-25 17:32:19,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2172 states, 1676 states have (on average 1.3048926014319808) internal successors, (2187), 1728 states have internal predecessors, (2187), 323 states have call successors, (323), 172 states have call predecessors, (323), 172 states have return successors, (323), 279 states have call predecessors, (323), 323 states have call successors, (323) [2022-11-25 17:32:19,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 2172 states and 2833 transitions. [2022-11-25 17:32:19,822 INFO L78 Accepts]: Start accepts. Automaton has 2172 states and 2833 transitions. Word has length 281 [2022-11-25 17:32:19,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:32:19,823 INFO L495 AbstractCegarLoop]: Abstraction has 2172 states and 2833 transitions. [2022-11-25 17:32:19,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-25 17:32:19,823 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 2833 transitions. [2022-11-25 17:32:19,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2022-11-25 17:32:19,826 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:32:19,826 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:32:19,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 17:32:20,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:32:20,034 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:32:20,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:20,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1939290951, now seen corresponding path program 1 times [2022-11-25 17:32:20,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:32:20,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188511518] [2022-11-25 17:32:20,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:20,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:32:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:20,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:32:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:20,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:32:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:20,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:32:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:20,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:32:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:20,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:32:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:20,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:32:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:20,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:32:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:20,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:32:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:20,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:32:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:20,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:32:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:20,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:20,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:32:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:20,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:32:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:20,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:32:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:20,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:20,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:20,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:32:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:20,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 17:32:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:20,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-25 17:32:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:21,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-25 17:32:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:21,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-25 17:32:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:21,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-11-25 17:32:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:21,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-11-25 17:32:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:21,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-11-25 17:32:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:21,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-11-25 17:32:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:21,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-11-25 17:32:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:21,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2022-11-25 17:32:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:21,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2022-11-25 17:32:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:21,084 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 16 proven. 146 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2022-11-25 17:32:21,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:32:21,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188511518] [2022-11-25 17:32:21,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188511518] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:32:21,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901825919] [2022-11-25 17:32:21,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:21,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:32:21,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:32:21,087 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:32:21,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 17:32:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:21,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 982 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-25 17:32:21,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:32:21,528 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2022-11-25 17:32:21,528 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:32:21,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901825919] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:32:21,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:32:21,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 21 [2022-11-25 17:32:21,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667807077] [2022-11-25 17:32:21,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:21,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:32:21,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:32:21,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:32:21,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2022-11-25 17:32:21,530 INFO L87 Difference]: Start difference. First operand 2172 states and 2833 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2022-11-25 17:32:22,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:32:22,557 INFO L93 Difference]: Finished difference Result 5326 states and 7176 transitions. [2022-11-25 17:32:22,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 17:32:22,558 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) Word has length 293 [2022-11-25 17:32:22,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:32:22,588 INFO L225 Difference]: With dead ends: 5326 [2022-11-25 17:32:22,588 INFO L226 Difference]: Without dead ends: 3720 [2022-11-25 17:32:22,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2022-11-25 17:32:22,594 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 363 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1930 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:32:22,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1930 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:32:22,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3720 states. [2022-11-25 17:32:23,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3720 to 3182. [2022-11-25 17:32:23,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3182 states, 2447 states have (on average 1.298324478953821) internal successors, (3177), 2527 states have internal predecessors, (3177), 467 states have call successors, (467), 267 states have call predecessors, (467), 267 states have return successors, (467), 395 states have call predecessors, (467), 467 states have call successors, (467) [2022-11-25 17:32:23,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3182 states to 3182 states and 4111 transitions. [2022-11-25 17:32:23,051 INFO L78 Accepts]: Start accepts. Automaton has 3182 states and 4111 transitions. Word has length 293 [2022-11-25 17:32:23,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:32:23,052 INFO L495 AbstractCegarLoop]: Abstraction has 3182 states and 4111 transitions. [2022-11-25 17:32:23,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2022-11-25 17:32:23,052 INFO L276 IsEmpty]: Start isEmpty. Operand 3182 states and 4111 transitions. [2022-11-25 17:32:23,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2022-11-25 17:32:23,056 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:32:23,056 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:32:23,068 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 17:32:23,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-25 17:32:23,264 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:32:23,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:23,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1839544214, now seen corresponding path program 1 times [2022-11-25 17:32:23,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:32:23,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774163671] [2022-11-25 17:32:23,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:23,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:32:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:23,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:32:23,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:23,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:32:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:23,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:32:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:23,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:32:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:23,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:32:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:23,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:32:23,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:23,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:32:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:23,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:32:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:23,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:32:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:23,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:32:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:23,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:23,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:32:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:23,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:32:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:23,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:32:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:23,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:23,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:32:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:23,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 17:32:23,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:23,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-25 17:32:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:23,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-25 17:32:23,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:23,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-25 17:32:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:23,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-11-25 17:32:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:23,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-11-25 17:32:23,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:23,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-11-25 17:32:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:23,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-11-25 17:32:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:23,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-11-25 17:32:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:23,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2022-11-25 17:32:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:23,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2022-11-25 17:32:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:23,526 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 774 trivial. 0 not checked. [2022-11-25 17:32:23,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:32:23,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774163671] [2022-11-25 17:32:23,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774163671] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:32:23,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:32:23,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:32:23,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561418709] [2022-11-25 17:32:23,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:23,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:32:23,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:32:23,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:32:23,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:32:23,530 INFO L87 Difference]: Start difference. First operand 3182 states and 4111 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 5 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2022-11-25 17:32:25,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:32:25,142 INFO L93 Difference]: Finished difference Result 9758 states and 14097 transitions. [2022-11-25 17:32:25,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:32:25,143 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 5 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 299 [2022-11-25 17:32:25,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:32:25,177 INFO L225 Difference]: With dead ends: 9758 [2022-11-25 17:32:25,177 INFO L226 Difference]: Without dead ends: 7082 [2022-11-25 17:32:25,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:32:25,185 INFO L413 NwaCegarLoop]: 554 mSDtfsCounter, 454 mSDsluCounter, 1221 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1775 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:32:25,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1775 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 17:32:25,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7082 states. [2022-11-25 17:32:25,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7082 to 3438. [2022-11-25 17:32:25,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3438 states, 2655 states have (on average 1.3111111111111111) internal successors, (3481), 2735 states have internal predecessors, (3481), 515 states have call successors, (515), 267 states have call predecessors, (515), 267 states have return successors, (515), 443 states have call predecessors, (515), 515 states have call successors, (515) [2022-11-25 17:32:25,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3438 states to 3438 states and 4511 transitions. [2022-11-25 17:32:25,732 INFO L78 Accepts]: Start accepts. Automaton has 3438 states and 4511 transitions. Word has length 299 [2022-11-25 17:32:25,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:32:25,733 INFO L495 AbstractCegarLoop]: Abstraction has 3438 states and 4511 transitions. [2022-11-25 17:32:25,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 5 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2022-11-25 17:32:25,733 INFO L276 IsEmpty]: Start isEmpty. Operand 3438 states and 4511 transitions. [2022-11-25 17:32:25,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2022-11-25 17:32:25,736 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:32:25,737 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:32:25,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-25 17:32:25,737 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:32:25,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:25,737 INFO L85 PathProgramCache]: Analyzing trace with hash 9129234, now seen corresponding path program 1 times [2022-11-25 17:32:25,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:32:25,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008292458] [2022-11-25 17:32:25,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:25,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:32:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:25,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:32:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:25,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:32:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:25,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:32:25,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:25,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:32:25,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:25,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:32:25,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:25,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:32:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:25,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:32:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:25,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:32:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:25,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:32:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:26,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:32:26,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:26,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:26,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:32:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:26,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:32:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:26,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:32:26,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:26,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:26,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:32:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:26,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 17:32:26,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:26,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-25 17:32:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:26,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-25 17:32:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:26,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-25 17:32:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:26,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-11-25 17:32:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:26,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-11-25 17:32:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:26,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-11-25 17:32:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:26,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-11-25 17:32:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:26,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-11-25 17:32:26,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:26,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2022-11-25 17:32:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:26,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2022-11-25 17:32:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:26,125 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 771 trivial. 0 not checked. [2022-11-25 17:32:26,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:32:26,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008292458] [2022-11-25 17:32:26,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008292458] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:32:26,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:32:26,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:32:26,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834947537] [2022-11-25 17:32:26,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:26,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:32:26,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:32:26,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:32:26,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:32:26,128 INFO L87 Difference]: Start difference. First operand 3438 states and 4511 transitions. Second operand has 6 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2022-11-25 17:32:26,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:32:26,944 INFO L93 Difference]: Finished difference Result 6215 states and 8207 transitions. [2022-11-25 17:32:26,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:32:26,945 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 299 [2022-11-25 17:32:26,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:32:26,958 INFO L225 Difference]: With dead ends: 6215 [2022-11-25 17:32:26,958 INFO L226 Difference]: Without dead ends: 3384 [2022-11-25 17:32:26,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:32:26,965 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 63 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:32:26,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 781 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:32:26,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3384 states. [2022-11-25 17:32:27,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3384 to 3384. [2022-11-25 17:32:27,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3384 states, 2610 states have (on average 1.3080459770114943) internal successors, (3414), 2685 states have internal predecessors, (3414), 511 states have call successors, (511), 263 states have call predecessors, (511), 262 states have return successors, (510), 442 states have call predecessors, (510), 510 states have call successors, (510) [2022-11-25 17:32:27,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3384 states to 3384 states and 4435 transitions. [2022-11-25 17:32:27,455 INFO L78 Accepts]: Start accepts. Automaton has 3384 states and 4435 transitions. Word has length 299 [2022-11-25 17:32:27,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:32:27,456 INFO L495 AbstractCegarLoop]: Abstraction has 3384 states and 4435 transitions. [2022-11-25 17:32:27,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2022-11-25 17:32:27,457 INFO L276 IsEmpty]: Start isEmpty. Operand 3384 states and 4435 transitions. [2022-11-25 17:32:27,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2022-11-25 17:32:27,461 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:32:27,461 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:32:27,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-25 17:32:27,461 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:32:27,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:27,462 INFO L85 PathProgramCache]: Analyzing trace with hash -788096576, now seen corresponding path program 1 times [2022-11-25 17:32:27,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:32:27,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788182779] [2022-11-25 17:32:27,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:27,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:32:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:27,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:32:27,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:27,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:32:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:27,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:32:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:27,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:32:27,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:27,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:32:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:28,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:32:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:28,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:32:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:28,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:32:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:28,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:32:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:28,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:32:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:28,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:28,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:32:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:28,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:32:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:28,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:32:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:28,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:28,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:32:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:28,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 17:32:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:28,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-25 17:32:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:28,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-25 17:32:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:28,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-25 17:32:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:28,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-11-25 17:32:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:28,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-11-25 17:32:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:28,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-11-25 17:32:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:28,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-11-25 17:32:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:28,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-11-25 17:32:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:28,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-11-25 17:32:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:28,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-11-25 17:32:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:28,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2022-11-25 17:32:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:28,113 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2022-11-25 17:32:28,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:32:28,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788182779] [2022-11-25 17:32:28,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788182779] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:32:28,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268507816] [2022-11-25 17:32:28,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:28,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:32:28,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:32:28,122 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:32:28,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 17:32:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:28,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 1012 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-25 17:32:28,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:32:28,696 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 189 proven. 4 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2022-11-25 17:32:28,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:32:28,943 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2022-11-25 17:32:28,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268507816] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 17:32:28,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:32:28,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12, 10] total 21 [2022-11-25 17:32:28,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304824144] [2022-11-25 17:32:28,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:28,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 17:32:28,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:32:28,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 17:32:28,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2022-11-25 17:32:28,946 INFO L87 Difference]: Start difference. First operand 3384 states and 4435 transitions. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 9 states have internal predecessors, (98), 4 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2022-11-25 17:32:31,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:32:31,965 INFO L93 Difference]: Finished difference Result 12710 states and 17414 transitions. [2022-11-25 17:32:31,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-25 17:32:31,965 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 9 states have internal predecessors, (98), 4 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) Word has length 304 [2022-11-25 17:32:31,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:32:32,010 INFO L225 Difference]: With dead ends: 12710 [2022-11-25 17:32:32,010 INFO L226 Difference]: Without dead ends: 9846 [2022-11-25 17:32:32,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 694 GetRequests, 655 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=1377, Unknown=0, NotChecked=0, Total=1560 [2022-11-25 17:32:32,021 INFO L413 NwaCegarLoop]: 529 mSDtfsCounter, 1180 mSDsluCounter, 3083 mSDsCounter, 0 mSdLazyCounter, 1582 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1205 SdHoareTripleChecker+Valid, 3612 SdHoareTripleChecker+Invalid, 1942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 1582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:32:32,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1205 Valid, 3612 Invalid, 1942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 1582 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-25 17:32:32,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9846 states. [2022-11-25 17:32:32,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9846 to 5490. [2022-11-25 17:32:32,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5490 states, 4214 states have (on average 1.3028001898433792) internal successors, (5490), 4334 states have internal predecessors, (5490), 852 states have call successors, (852), 424 states have call predecessors, (852), 423 states have return successors, (851), 738 states have call predecessors, (851), 851 states have call successors, (851) [2022-11-25 17:32:32,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5490 states to 5490 states and 7193 transitions. [2022-11-25 17:32:32,810 INFO L78 Accepts]: Start accepts. Automaton has 5490 states and 7193 transitions. Word has length 304 [2022-11-25 17:32:32,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:32:32,811 INFO L495 AbstractCegarLoop]: Abstraction has 5490 states and 7193 transitions. [2022-11-25 17:32:32,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 9 states have internal predecessors, (98), 4 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2022-11-25 17:32:32,812 INFO L276 IsEmpty]: Start isEmpty. Operand 5490 states and 7193 transitions. [2022-11-25 17:32:32,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2022-11-25 17:32:32,815 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:32:32,815 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:32:32,826 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-25 17:32:33,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-25 17:32:33,027 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:32:33,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:33,027 INFO L85 PathProgramCache]: Analyzing trace with hash -112763456, now seen corresponding path program 1 times [2022-11-25 17:32:33,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:32:33,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151681721] [2022-11-25 17:32:33,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:33,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:32:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:33,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:32:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:33,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:32:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:33,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:32:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:33,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:32:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:33,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:32:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:33,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:32:33,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:33,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:32:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:33,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:32:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:33,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:32:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:33,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:32:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:33,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:33,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:32:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:33,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:32:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:33,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:32:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:33,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:33,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:33,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:32:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:33,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 17:32:33,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:33,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-25 17:32:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:33,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-25 17:32:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:33,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-25 17:32:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:33,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-11-25 17:32:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:33,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-11-25 17:32:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:33,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-11-25 17:32:33,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:33,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-11-25 17:32:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:33,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-11-25 17:32:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:33,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-11-25 17:32:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:33,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-11-25 17:32:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:33,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2022-11-25 17:32:33,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:33,602 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2022-11-25 17:32:33,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:32:33,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151681721] [2022-11-25 17:32:33,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151681721] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:32:33,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109956710] [2022-11-25 17:32:33,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:33,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:32:33,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:32:33,605 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:32:33,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 17:32:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:33,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 1012 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-25 17:32:33,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:32:33,970 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2022-11-25 17:32:33,970 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:32:33,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109956710] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:32:33,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:32:33,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 15 [2022-11-25 17:32:33,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958706146] [2022-11-25 17:32:33,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:33,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:32:33,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:32:33,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:32:33,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-11-25 17:32:33,975 INFO L87 Difference]: Start difference. First operand 5490 states and 7193 transitions. Second operand has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2022-11-25 17:32:35,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:32:35,488 INFO L93 Difference]: Finished difference Result 12314 states and 16769 transitions. [2022-11-25 17:32:35,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 17:32:35,489 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) Word has length 304 [2022-11-25 17:32:35,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:32:35,519 INFO L225 Difference]: With dead ends: 12314 [2022-11-25 17:32:35,519 INFO L226 Difference]: Without dead ends: 7296 [2022-11-25 17:32:35,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-11-25 17:32:35,532 INFO L413 NwaCegarLoop]: 466 mSDtfsCounter, 392 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 2190 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:32:35,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 2190 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:32:35,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7296 states. [2022-11-25 17:32:36,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7296 to 5326. [2022-11-25 17:32:36,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5326 states, 4090 states have (on average 1.2953545232273838) internal successors, (5298), 4206 states have internal predecessors, (5298), 816 states have call successors, (816), 420 states have call predecessors, (816), 419 states have return successors, (815), 706 states have call predecessors, (815), 815 states have call successors, (815) [2022-11-25 17:32:36,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5326 states to 5326 states and 6929 transitions. [2022-11-25 17:32:36,443 INFO L78 Accepts]: Start accepts. Automaton has 5326 states and 6929 transitions. Word has length 304 [2022-11-25 17:32:36,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:32:36,444 INFO L495 AbstractCegarLoop]: Abstraction has 5326 states and 6929 transitions. [2022-11-25 17:32:36,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2022-11-25 17:32:36,444 INFO L276 IsEmpty]: Start isEmpty. Operand 5326 states and 6929 transitions. [2022-11-25 17:32:36,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2022-11-25 17:32:36,448 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:32:36,448 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:32:36,455 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-25 17:32:36,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:32:36,655 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:32:36,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:36,655 INFO L85 PathProgramCache]: Analyzing trace with hash -446467712, now seen corresponding path program 1 times [2022-11-25 17:32:36,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:32:36,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484530713] [2022-11-25 17:32:36,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:36,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:32:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:36,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:32:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:36,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:32:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:36,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:32:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:36,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:32:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:36,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:32:36,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:36,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:32:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:36,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:32:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:36,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:32:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:36,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:32:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:36,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:32:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:36,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:36,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:32:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:36,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:32:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:36,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:32:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:36,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:36,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:32:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:36,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 17:32:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:36,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-25 17:32:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:36,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-25 17:32:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:36,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-25 17:32:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:36,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-11-25 17:32:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:36,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-11-25 17:32:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:36,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-11-25 17:32:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:36,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-11-25 17:32:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:36,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-11-25 17:32:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:36,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-11-25 17:32:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:36,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-11-25 17:32:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:36,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2022-11-25 17:32:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:36,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2022-11-25 17:32:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:36,855 INFO L134 CoverageAnalysis]: Checked inductivity of 718 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2022-11-25 17:32:36,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:32:36,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484530713] [2022-11-25 17:32:36,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484530713] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:32:36,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:32:36,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:32:36,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583212821] [2022-11-25 17:32:36,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:36,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:32:36,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:32:36,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:32:36,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:32:36,861 INFO L87 Difference]: Start difference. First operand 5326 states and 6929 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-11-25 17:32:38,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:32:38,219 INFO L93 Difference]: Finished difference Result 8964 states and 11706 transitions. [2022-11-25 17:32:38,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:32:38,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 311 [2022-11-25 17:32:38,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:32:38,238 INFO L225 Difference]: With dead ends: 8964 [2022-11-25 17:32:38,238 INFO L226 Difference]: Without dead ends: 4406 [2022-11-25 17:32:38,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:32:38,250 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 475 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 17:32:38,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 782 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 17:32:38,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4406 states. [2022-11-25 17:32:38,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4406 to 4380. [2022-11-25 17:32:38,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4380 states, 3369 states have (on average 1.2766399525081626) internal successors, (4301), 3463 states have internal predecessors, (4301), 665 states have call successors, (665), 345 states have call predecessors, (665), 345 states have return successors, (665), 571 states have call predecessors, (665), 665 states have call successors, (665) [2022-11-25 17:32:38,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4380 states to 4380 states and 5631 transitions. [2022-11-25 17:32:38,889 INFO L78 Accepts]: Start accepts. Automaton has 4380 states and 5631 transitions. Word has length 311 [2022-11-25 17:32:38,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:32:38,889 INFO L495 AbstractCegarLoop]: Abstraction has 4380 states and 5631 transitions. [2022-11-25 17:32:38,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-11-25 17:32:38,890 INFO L276 IsEmpty]: Start isEmpty. Operand 4380 states and 5631 transitions. [2022-11-25 17:32:38,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2022-11-25 17:32:38,896 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:32:38,896 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-25 17:32:38,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-25 17:32:38,897 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:32:38,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:38,897 INFO L85 PathProgramCache]: Analyzing trace with hash -409137599, now seen corresponding path program 1 times [2022-11-25 17:32:38,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:32:38,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574886812] [2022-11-25 17:32:38,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:38,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:32:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:32:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:32:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:32:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:32:40,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:32:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:32:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:32:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:32:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:32:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:32:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:32:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:32:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:32:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:32:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:32:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 17:32:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-25 17:32:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-25 17:32:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-25 17:32:40,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-11-25 17:32:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-11-25 17:32:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-11-25 17:32:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-11-25 17:32:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-11-25 17:32:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-11-25 17:32:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-11-25 17:32:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2022-11-25 17:32:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-11-25 17:32:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2022-11-25 17:32:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2022-11-25 17:32:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2022-11-25 17:32:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-11-25 17:32:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2022-11-25 17:32:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2022-11-25 17:32:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,207 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 16 proven. 26 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2022-11-25 17:32:40,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:32:40,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574886812] [2022-11-25 17:32:40,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574886812] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:32:40,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283675120] [2022-11-25 17:32:40,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:40,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:32:40,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:32:40,209 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:32:40,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-25 17:32:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 1299 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-25 17:32:40,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:32:41,078 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 240 proven. 91 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2022-11-25 17:32:41,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:32:41,817 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 34 proven. 71 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2022-11-25 17:32:41,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283675120] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:32:41,818 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:32:41,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 34 [2022-11-25 17:32:41,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707774718] [2022-11-25 17:32:41,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:32:41,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-25 17:32:41,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:32:41,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-25 17:32:41,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1033, Unknown=0, NotChecked=0, Total=1122 [2022-11-25 17:32:41,822 INFO L87 Difference]: Start difference. First operand 4380 states and 5631 transitions. Second operand has 34 states, 34 states have (on average 7.205882352941177) internal successors, (245), 29 states have internal predecessors, (245), 10 states have call successors, (67), 9 states have call predecessors, (67), 15 states have return successors, (67), 14 states have call predecessors, (67), 10 states have call successors, (67) [2022-11-25 17:34:19,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:34:19,771 INFO L93 Difference]: Finished difference Result 59981 states and 84394 transitions. [2022-11-25 17:34:19,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 712 states. [2022-11-25 17:34:19,787 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 7.205882352941177) internal successors, (245), 29 states have internal predecessors, (245), 10 states have call successors, (67), 9 states have call predecessors, (67), 15 states have return successors, (67), 14 states have call predecessors, (67), 10 states have call successors, (67) Word has length 359 [2022-11-25 17:34:19,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:34:20,087 INFO L225 Difference]: With dead ends: 59981 [2022-11-25 17:34:20,088 INFO L226 Difference]: Without dead ends: 56005 [2022-11-25 17:34:20,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1555 GetRequests, 813 SyntacticMatches, 1 SemanticMatches, 741 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250261 ImplicationChecksByTransitivity, 55.6s TimeCoverageRelationStatistics Valid=28017, Invalid=523289, Unknown=0, NotChecked=0, Total=551306 [2022-11-25 17:34:20,204 INFO L413 NwaCegarLoop]: 975 mSDtfsCounter, 8416 mSDsluCounter, 16510 mSDsCounter, 0 mSdLazyCounter, 34058 mSolverCounterSat, 12407 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8416 SdHoareTripleChecker+Valid, 17485 SdHoareTripleChecker+Invalid, 46465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 12407 IncrementalHoareTripleChecker+Valid, 34058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:34:20,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8416 Valid, 17485 Invalid, 46465 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [12407 Valid, 34058 Invalid, 0 Unknown, 0 Unchecked, 29.5s Time] [2022-11-25 17:34:20,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56005 states. [2022-11-25 17:34:23,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56005 to 9660. [2022-11-25 17:34:23,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9660 states, 7405 states have (on average 1.2515867656988522) internal successors, (9268), 7603 states have internal predecessors, (9268), 1473 states have call successors, (1473), 737 states have call predecessors, (1473), 781 states have return successors, (1535), 1319 states have call predecessors, (1535), 1473 states have call successors, (1535) [2022-11-25 17:34:23,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9660 states to 9660 states and 12276 transitions. [2022-11-25 17:34:23,614 INFO L78 Accepts]: Start accepts. Automaton has 9660 states and 12276 transitions. Word has length 359 [2022-11-25 17:34:23,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:34:23,615 INFO L495 AbstractCegarLoop]: Abstraction has 9660 states and 12276 transitions. [2022-11-25 17:34:23,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.205882352941177) internal successors, (245), 29 states have internal predecessors, (245), 10 states have call successors, (67), 9 states have call predecessors, (67), 15 states have return successors, (67), 14 states have call predecessors, (67), 10 states have call successors, (67) [2022-11-25 17:34:23,616 INFO L276 IsEmpty]: Start isEmpty. Operand 9660 states and 12276 transitions. [2022-11-25 17:34:23,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2022-11-25 17:34:23,643 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:34:23,644 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:34:23,651 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-25 17:34:23,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-25 17:34:23,850 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:34:23,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:23,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1100506943, now seen corresponding path program 1 times [2022-11-25 17:34:23,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:23,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334095161] [2022-11-25 17:34:23,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:23,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:34:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:34:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:34:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:34:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:34:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:34:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:34:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:34:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:34:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:34:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:34:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:34:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:34:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:34:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:34:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:34:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 17:34:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-25 17:34:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-25 17:34:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-25 17:34:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-11-25 17:34:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-11-25 17:34:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-11-25 17:34:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-11-25 17:34:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-11-25 17:34:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2022-11-25 17:34:25,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2022-11-25 17:34:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2022-11-25 17:34:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2022-11-25 17:34:25,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2022-11-25 17:34:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2022-11-25 17:34:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2022-11-25 17:34:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2022-11-25 17:34:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2022-11-25 17:34:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2022-11-25 17:34:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,734 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 22 proven. 25 refuted. 0 times theorem prover too weak. 865 trivial. 0 not checked. [2022-11-25 17:34:25,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:25,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334095161] [2022-11-25 17:34:25,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334095161] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:34:25,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651041832] [2022-11-25 17:34:25,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:25,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:34:25,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:34:25,737 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:34:25,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-25 17:34:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:26,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 1300 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-25 17:34:26,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:34:26,672 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 206 proven. 118 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2022-11-25 17:34:26,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:34:27,497 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 33 proven. 69 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2022-11-25 17:34:27,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651041832] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:34:27,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:34:27,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 13] total 41 [2022-11-25 17:34:27,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191091201] [2022-11-25 17:34:27,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:34:27,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-25 17:34:27,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:27,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-25 17:34:27,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1535, Unknown=0, NotChecked=0, Total=1640 [2022-11-25 17:34:27,504 INFO L87 Difference]: Start difference. First operand 9660 states and 12276 transitions. Second operand has 41 states, 41 states have (on average 6.0) internal successors, (246), 35 states have internal predecessors, (246), 11 states have call successors, (68), 9 states have call predecessors, (68), 14 states have return successors, (68), 16 states have call predecessors, (68), 11 states have call successors, (68) [2022-11-25 17:35:11,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:35:11,417 INFO L93 Difference]: Finished difference Result 30248 states and 39247 transitions. [2022-11-25 17:35:11,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 298 states. [2022-11-25 17:35:11,418 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 6.0) internal successors, (246), 35 states have internal predecessors, (246), 11 states have call successors, (68), 9 states have call predecessors, (68), 14 states have return successors, (68), 16 states have call predecessors, (68), 11 states have call successors, (68) Word has length 360 [2022-11-25 17:35:11,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:35:11,484 INFO L225 Difference]: With dead ends: 30248 [2022-11-25 17:35:11,484 INFO L226 Difference]: Without dead ends: 21404 [2022-11-25 17:35:11,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1130 GetRequests, 796 SyntacticMatches, 1 SemanticMatches, 333 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42730 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=6929, Invalid=104961, Unknown=0, NotChecked=0, Total=111890 [2022-11-25 17:35:11,510 INFO L413 NwaCegarLoop]: 978 mSDtfsCounter, 5337 mSDsluCounter, 22305 mSDsCounter, 0 mSdLazyCounter, 32539 mSolverCounterSat, 3595 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5338 SdHoareTripleChecker+Valid, 23283 SdHoareTripleChecker+Invalid, 36134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 3595 IncrementalHoareTripleChecker+Valid, 32539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.8s IncrementalHoareTripleChecker+Time [2022-11-25 17:35:11,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5338 Valid, 23283 Invalid, 36134 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [3595 Valid, 32539 Invalid, 0 Unknown, 0 Unchecked, 20.8s Time] [2022-11-25 17:35:11,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21404 states. [2022-11-25 17:35:14,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21404 to 8611. [2022-11-25 17:35:14,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8611 states, 6621 states have (on average 1.2360670593565926) internal successors, (8184), 6810 states have internal predecessors, (8184), 1244 states have call successors, (1244), 699 states have call predecessors, (1244), 745 states have return successors, (1302), 1101 states have call predecessors, (1302), 1244 states have call successors, (1302) [2022-11-25 17:35:14,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8611 states to 8611 states and 10730 transitions. [2022-11-25 17:35:14,076 INFO L78 Accepts]: Start accepts. Automaton has 8611 states and 10730 transitions. Word has length 360 [2022-11-25 17:35:14,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:35:14,077 INFO L495 AbstractCegarLoop]: Abstraction has 8611 states and 10730 transitions. [2022-11-25 17:35:14,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 6.0) internal successors, (246), 35 states have internal predecessors, (246), 11 states have call successors, (68), 9 states have call predecessors, (68), 14 states have return successors, (68), 16 states have call predecessors, (68), 11 states have call successors, (68) [2022-11-25 17:35:14,077 INFO L276 IsEmpty]: Start isEmpty. Operand 8611 states and 10730 transitions. [2022-11-25 17:35:14,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2022-11-25 17:35:14,093 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:35:14,094 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:35:14,110 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-25 17:35:14,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-11-25 17:35:14,300 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:35:14,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:14,301 INFO L85 PathProgramCache]: Analyzing trace with hash 182416949, now seen corresponding path program 1 times [2022-11-25 17:35:14,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:35:14,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759594078] [2022-11-25 17:35:14,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:14,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:35:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:14,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:35:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:14,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:35:14,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:14,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:35:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:14,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:35:14,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:14,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:35:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:14,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:35:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:14,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:35:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:14,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:35:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:14,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:35:14,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:14,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:35:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:14,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:35:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:14,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:35:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:14,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:35:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:14,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:35:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:14,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:35:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:14,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:35:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:14,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 17:35:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:14,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-25 17:35:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:14,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-25 17:35:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:14,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-25 17:35:14,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:14,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-11-25 17:35:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:14,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-25 17:35:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:14,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-11-25 17:35:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:14,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-11-25 17:35:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:14,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-11-25 17:35:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:14,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-11-25 17:35:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:14,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2022-11-25 17:35:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:14,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-11-25 17:35:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:14,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-11-25 17:35:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:14,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-11-25 17:35:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:14,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2022-11-25 17:35:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:14,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2022-11-25 17:35:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:14,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2022-11-25 17:35:14,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:14,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2022-11-25 17:35:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:14,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2022-11-25 17:35:14,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:14,511 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 868 trivial. 0 not checked. [2022-11-25 17:35:14,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:35:14,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759594078] [2022-11-25 17:35:14,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759594078] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:35:14,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:35:14,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:35:14,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041241184] [2022-11-25 17:35:14,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:35:14,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:35:14,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:35:14,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:35:14,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:35:14,514 INFO L87 Difference]: Start difference. First operand 8611 states and 10730 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2022-11-25 17:35:16,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:35:16,977 INFO L93 Difference]: Finished difference Result 17487 states and 21743 transitions. [2022-11-25 17:35:16,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:35:16,978 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 361 [2022-11-25 17:35:16,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:35:17,000 INFO L225 Difference]: With dead ends: 17487 [2022-11-25 17:35:17,001 INFO L226 Difference]: Without dead ends: 8487 [2022-11-25 17:35:17,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:35:17,015 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 114 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:35:17,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 602 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:35:17,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8487 states. [2022-11-25 17:35:19,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8487 to 8487. [2022-11-25 17:35:19,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8487 states, 6543 states have (on average 1.2057160324010392) internal successors, (7889), 6702 states have internal predecessors, (7889), 1244 states have call successors, (1244), 699 states have call predecessors, (1244), 699 states have return successors, (1244), 1085 states have call predecessors, (1244), 1244 states have call successors, (1244) [2022-11-25 17:35:19,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8487 states to 8487 states and 10377 transitions. [2022-11-25 17:35:19,438 INFO L78 Accepts]: Start accepts. Automaton has 8487 states and 10377 transitions. Word has length 361 [2022-11-25 17:35:19,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:35:19,439 INFO L495 AbstractCegarLoop]: Abstraction has 8487 states and 10377 transitions. [2022-11-25 17:35:19,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2022-11-25 17:35:19,439 INFO L276 IsEmpty]: Start isEmpty. Operand 8487 states and 10377 transitions. [2022-11-25 17:35:19,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2022-11-25 17:35:19,460 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:35:19,460 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:35:19,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-25 17:35:19,460 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:35:19,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:19,461 INFO L85 PathProgramCache]: Analyzing trace with hash 889989627, now seen corresponding path program 1 times [2022-11-25 17:35:19,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:35:19,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798048407] [2022-11-25 17:35:19,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:19,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:35:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:35:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:35:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:35:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:35:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:35:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:35:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:35:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:35:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:35:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:35:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:35:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:35:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:35:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:35:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:35:20,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:35:20,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 17:35:20,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-25 17:35:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-25 17:35:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-25 17:35:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-11-25 17:35:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-25 17:35:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-11-25 17:35:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-11-25 17:35:20,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-11-25 17:35:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-11-25 17:35:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2022-11-25 17:35:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-11-25 17:35:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-11-25 17:35:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-11-25 17:35:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2022-11-25 17:35:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2022-11-25 17:35:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2022-11-25 17:35:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2022-11-25 17:35:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2022-11-25 17:35:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2022-11-25 17:35:20,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,326 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 48 proven. 49 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2022-11-25 17:35:20,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:35:20,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798048407] [2022-11-25 17:35:20,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798048407] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:35:20,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112211986] [2022-11-25 17:35:20,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:20,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:35:20,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:35:20,328 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:35:20,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-25 17:35:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:20,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 1325 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-25 17:35:20,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:35:20,976 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 274 proven. 101 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2022-11-25 17:35:20,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:35:21,726 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 56 proven. 52 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2022-11-25 17:35:21,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112211986] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:35:21,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:35:21,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 23 [2022-11-25 17:35:21,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801326889] [2022-11-25 17:35:21,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:35:21,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-25 17:35:21,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:35:21,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-25 17:35:21,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2022-11-25 17:35:21,729 INFO L87 Difference]: Start difference. First operand 8487 states and 10377 transitions. Second operand has 23 states, 23 states have (on average 9.0) internal successors, (207), 19 states have internal predecessors, (207), 5 states have call successors, (53), 9 states have call predecessors, (53), 14 states have return successors, (49), 7 states have call predecessors, (49), 4 states have call successors, (49) [2022-11-25 17:35:36,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:35:36,701 INFO L93 Difference]: Finished difference Result 36170 states and 45449 transitions. [2022-11-25 17:35:36,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-11-25 17:35:36,701 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.0) internal successors, (207), 19 states have internal predecessors, (207), 5 states have call successors, (53), 9 states have call predecessors, (53), 14 states have return successors, (49), 7 states have call predecessors, (49), 4 states have call successors, (49) Word has length 371 [2022-11-25 17:35:36,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:35:36,783 INFO L225 Difference]: With dead ends: 36170 [2022-11-25 17:35:36,783 INFO L226 Difference]: Without dead ends: 29616 [2022-11-25 17:35:36,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 907 GetRequests, 834 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1183 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=801, Invalid=4169, Unknown=0, NotChecked=0, Total=4970 [2022-11-25 17:35:36,796 INFO L413 NwaCegarLoop]: 839 mSDtfsCounter, 1288 mSDsluCounter, 8352 mSDsCounter, 0 mSdLazyCounter, 4500 mSolverCounterSat, 759 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1310 SdHoareTripleChecker+Valid, 9191 SdHoareTripleChecker+Invalid, 5259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 759 IncrementalHoareTripleChecker+Valid, 4500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-25 17:35:36,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1310 Valid, 9191 Invalid, 5259 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [759 Valid, 4500 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-11-25 17:35:36,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29616 states. [2022-11-25 17:35:40,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29616 to 13853. [2022-11-25 17:35:40,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13853 states, 10601 states have (on average 1.2046033393076125) internal successors, (12770), 10853 states have internal predecessors, (12770), 2118 states have call successors, (2118), 1133 states have call predecessors, (2118), 1133 states have return successors, (2118), 1866 states have call predecessors, (2118), 2118 states have call successors, (2118) [2022-11-25 17:35:40,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13853 states to 13853 states and 17006 transitions. [2022-11-25 17:35:40,979 INFO L78 Accepts]: Start accepts. Automaton has 13853 states and 17006 transitions. Word has length 371 [2022-11-25 17:35:40,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:35:40,980 INFO L495 AbstractCegarLoop]: Abstraction has 13853 states and 17006 transitions. [2022-11-25 17:35:40,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.0) internal successors, (207), 19 states have internal predecessors, (207), 5 states have call successors, (53), 9 states have call predecessors, (53), 14 states have return successors, (49), 7 states have call predecessors, (49), 4 states have call successors, (49) [2022-11-25 17:35:40,981 INFO L276 IsEmpty]: Start isEmpty. Operand 13853 states and 17006 transitions. [2022-11-25 17:35:41,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2022-11-25 17:35:41,016 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:35:41,016 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:35:41,026 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-25 17:35:41,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:35:41,224 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:35:41,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:41,225 INFO L85 PathProgramCache]: Analyzing trace with hash -642586994, now seen corresponding path program 1 times [2022-11-25 17:35:41,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:35:41,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725723850] [2022-11-25 17:35:41,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:41,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:35:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:35:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:35:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:35:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:35:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:35:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:35:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:35:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:35:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:35:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:35:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:35:42,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:35:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:35:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:35:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:35:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:35:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 17:35:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-25 17:35:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-25 17:35:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-11-25 17:35:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-11-25 17:35:42,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-25 17:35:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-11-25 17:35:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-11-25 17:35:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-11-25 17:35:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-11-25 17:35:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2022-11-25 17:35:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-11-25 17:35:42,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-11-25 17:35:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-11-25 17:35:42,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2022-11-25 17:35:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2022-11-25 17:35:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2022-11-25 17:35:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2022-11-25 17:35:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2022-11-25 17:35:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2022-11-25 17:35:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:42,756 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 22 proven. 25 refuted. 0 times theorem prover too weak. 922 trivial. 0 not checked. [2022-11-25 17:35:42,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:35:42,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725723850] [2022-11-25 17:35:42,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725723850] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:35:42,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566989205] [2022-11-25 17:35:42,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:42,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:35:42,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:35:42,758 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:35:42,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-25 17:35:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:43,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 1325 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-25 17:35:43,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:35:43,753 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 343 proven. 126 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2022-11-25 17:35:43,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:35:44,804 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 42 proven. 204 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2022-11-25 17:35:44,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566989205] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:35:44,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:35:44,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 15, 19] total 49 [2022-11-25 17:35:44,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384661918] [2022-11-25 17:35:44,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:35:44,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-25 17:35:44,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:35:44,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-25 17:35:44,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=2219, Unknown=0, NotChecked=0, Total=2352 [2022-11-25 17:35:44,811 INFO L87 Difference]: Start difference. First operand 13853 states and 17006 transitions. Second operand has 49 states, 48 states have (on average 6.166666666666667) internal successors, (296), 42 states have internal predecessors, (296), 14 states have call successors, (79), 10 states have call predecessors, (79), 13 states have return successors, (80), 18 states have call predecessors, (80), 13 states have call successors, (80) [2022-11-25 17:36:35,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:36:35,529 INFO L93 Difference]: Finished difference Result 65548 states and 89338 transitions. [2022-11-25 17:36:35,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2022-11-25 17:36:35,530 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 6.166666666666667) internal successors, (296), 42 states have internal predecessors, (296), 14 states have call successors, (79), 10 states have call predecessors, (79), 13 states have return successors, (80), 18 states have call predecessors, (80), 13 states have call successors, (80) Word has length 371 [2022-11-25 17:36:35,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:36:35,694 INFO L225 Difference]: With dead ends: 65548 [2022-11-25 17:36:35,694 INFO L226 Difference]: Without dead ends: 52798 [2022-11-25 17:36:35,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1061 GetRequests, 804 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23062 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=4017, Invalid=62805, Unknown=0, NotChecked=0, Total=66822 [2022-11-25 17:36:35,726 INFO L413 NwaCegarLoop]: 661 mSDtfsCounter, 4081 mSDsluCounter, 17233 mSDsCounter, 0 mSdLazyCounter, 23884 mSolverCounterSat, 2360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4099 SdHoareTripleChecker+Valid, 17894 SdHoareTripleChecker+Invalid, 26244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 2360 IncrementalHoareTripleChecker+Valid, 23884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:36:35,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4099 Valid, 17894 Invalid, 26244 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [2360 Valid, 23884 Invalid, 0 Unknown, 0 Unchecked, 15.6s Time] [2022-11-25 17:36:35,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52798 states. [2022-11-25 17:36:42,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52798 to 15606. [2022-11-25 17:36:42,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15606 states, 11969 states have (on average 1.1989305706408222) internal successors, (14350), 12238 states have internal predecessors, (14350), 2349 states have call successors, (2349), 1285 states have call predecessors, (2349), 1287 states have return successors, (2353), 2082 states have call predecessors, (2353), 2349 states have call successors, (2353) [2022-11-25 17:36:42,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15606 states to 15606 states and 19052 transitions. [2022-11-25 17:36:42,277 INFO L78 Accepts]: Start accepts. Automaton has 15606 states and 19052 transitions. Word has length 371 [2022-11-25 17:36:42,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:36:42,278 INFO L495 AbstractCegarLoop]: Abstraction has 15606 states and 19052 transitions. [2022-11-25 17:36:42,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 6.166666666666667) internal successors, (296), 42 states have internal predecessors, (296), 14 states have call successors, (79), 10 states have call predecessors, (79), 13 states have return successors, (80), 18 states have call predecessors, (80), 13 states have call successors, (80) [2022-11-25 17:36:42,278 INFO L276 IsEmpty]: Start isEmpty. Operand 15606 states and 19052 transitions. [2022-11-25 17:36:42,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2022-11-25 17:36:42,314 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:36:42,315 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:36:42,329 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-25 17:36:42,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:36:42,523 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:36:42,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:36:42,524 INFO L85 PathProgramCache]: Analyzing trace with hash 88317705, now seen corresponding path program 1 times [2022-11-25 17:36:42,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:36:42,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596323187] [2022-11-25 17:36:42,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:36:42,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:36:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:36:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:36:42,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 17:36:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 17:36:42,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 17:36:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:36:42,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:36:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:36:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-25 17:36:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:36:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:36:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:36:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-25 17:36:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:36:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:36:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:36:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-25 17:36:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-25 17:36:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-11-25 17:36:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-11-25 17:36:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-11-25 17:36:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-11-25 17:36:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-11-25 17:36:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-11-25 17:36:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2022-11-25 17:36:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2022-11-25 17:36:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-11-25 17:36:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2022-11-25 17:36:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2022-11-25 17:36:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2022-11-25 17:36:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2022-11-25 17:36:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2022-11-25 17:36:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2022-11-25 17:36:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2022-11-25 17:36:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2022-11-25 17:36:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2022-11-25 17:36:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:42,855 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 9 proven. 136 refuted. 0 times theorem prover too weak. 839 trivial. 0 not checked. [2022-11-25 17:36:42,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:36:42,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596323187] [2022-11-25 17:36:42,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596323187] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:36:42,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090020581] [2022-11-25 17:36:42,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:36:42,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:36:42,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:36:42,858 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:36:42,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-25 17:36:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:43,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 1325 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:36:43,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:36:43,261 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2022-11-25 17:36:43,262 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:36:43,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090020581] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:36:43,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:36:43,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-11-25 17:36:43,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385419475] [2022-11-25 17:36:43,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:36:43,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:36:43,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:36:43,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:36:43,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:36:43,268 INFO L87 Difference]: Start difference. First operand 15606 states and 19052 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-25 17:36:50,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:36:50,297 INFO L93 Difference]: Finished difference Result 30520 states and 37332 transitions. [2022-11-25 17:36:50,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:36:50,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 374 [2022-11-25 17:36:50,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:36:50,346 INFO L225 Difference]: With dead ends: 30520 [2022-11-25 17:36:50,346 INFO L226 Difference]: Without dead ends: 14915 [2022-11-25 17:36:50,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 446 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-25 17:36:50,377 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 28 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:36:50,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 658 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:36:50,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14915 states. [2022-11-25 17:36:55,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14915 to 14915. [2022-11-25 17:36:55,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14915 states, 11415 states have (on average 1.2020148926850636) internal successors, (13721), 11684 states have internal predecessors, (13721), 2276 states have call successors, (2276), 1223 states have call predecessors, (2276), 1223 states have return successors, (2276), 2007 states have call predecessors, (2276), 2276 states have call successors, (2276) [2022-11-25 17:36:55,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14915 states to 14915 states and 18273 transitions. [2022-11-25 17:36:55,885 INFO L78 Accepts]: Start accepts. Automaton has 14915 states and 18273 transitions. Word has length 374 [2022-11-25 17:36:55,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:36:55,885 INFO L495 AbstractCegarLoop]: Abstraction has 14915 states and 18273 transitions. [2022-11-25 17:36:55,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-25 17:36:55,886 INFO L276 IsEmpty]: Start isEmpty. Operand 14915 states and 18273 transitions. [2022-11-25 17:36:55,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2022-11-25 17:36:55,918 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:36:55,919 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-25 17:36:55,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-25 17:36:56,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:36:56,127 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:36:56,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:36:56,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1456395492, now seen corresponding path program 1 times [2022-11-25 17:36:56,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:36:56,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222932838] [2022-11-25 17:36:56,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:36:56,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:36:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:56,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:36:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:56,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:36:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:56,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:36:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:56,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:36:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:56,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:36:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:56,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:36:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:56,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:36:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:56,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:36:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:56,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:36:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:56,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:36:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:56,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:36:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:56,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:36:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:56,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:36:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:56,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:36:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:56,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:36:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:56,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:36:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:56,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 17:36:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:57,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-25 17:36:57,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:57,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-11-25 17:36:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:57,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-11-25 17:36:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:57,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-11-25 17:36:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:57,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-25 17:36:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:57,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-11-25 17:36:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:57,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-11-25 17:36:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:57,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-11-25 17:36:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:57,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-11-25 17:36:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:57,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2022-11-25 17:36:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:57,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2022-11-25 17:36:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:57,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2022-11-25 17:36:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:57,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2022-11-25 17:36:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:57,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2022-11-25 17:36:57,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:57,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2022-11-25 17:36:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:57,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2022-11-25 17:36:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:57,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2022-11-25 17:36:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:57,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2022-11-25 17:36:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:57,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2022-11-25 17:36:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:57,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2022-11-25 17:36:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:57,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1039 backedges. 89 proven. 172 refuted. 0 times theorem prover too weak. 778 trivial. 0 not checked. [2022-11-25 17:36:57,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:36:57,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222932838] [2022-11-25 17:36:57,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222932838] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:36:57,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772288217] [2022-11-25 17:36:57,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:36:57,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:36:57,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:36:57,170 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:36:57,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-25 17:36:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:57,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 1350 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-25 17:36:57,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:36:58,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1039 backedges. 367 proven. 83 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2022-11-25 17:36:58,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:36:59,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1039 backedges. 54 proven. 46 refuted. 0 times theorem prover too weak. 939 trivial. 0 not checked. [2022-11-25 17:36:59,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772288217] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:36:59,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:36:59,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 10] total 34 [2022-11-25 17:36:59,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302359393] [2022-11-25 17:36:59,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:36:59,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-25 17:36:59,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:36:59,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-25 17:36:59,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1033, Unknown=0, NotChecked=0, Total=1122 [2022-11-25 17:36:59,171 INFO L87 Difference]: Start difference. First operand 14915 states and 18273 transitions. Second operand has 34 states, 32 states have (on average 8.84375) internal successors, (283), 29 states have internal predecessors, (283), 9 states have call successors, (65), 7 states have call predecessors, (65), 15 states have return successors, (65), 12 states have call predecessors, (65), 9 states have call successors, (65) [2022-11-25 17:37:15,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:37:15,201 INFO L93 Difference]: Finished difference Result 30732 states and 38715 transitions. [2022-11-25 17:37:15,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-11-25 17:37:15,202 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 8.84375) internal successors, (283), 29 states have internal predecessors, (283), 9 states have call successors, (65), 7 states have call predecessors, (65), 15 states have return successors, (65), 12 states have call predecessors, (65), 9 states have call successors, (65) Word has length 381 [2022-11-25 17:37:15,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:37:15,258 INFO L225 Difference]: With dead ends: 30732 [2022-11-25 17:37:15,258 INFO L226 Difference]: Without dead ends: 15463 [2022-11-25 17:37:15,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 918 GetRequests, 824 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2216 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=810, Invalid=8120, Unknown=0, NotChecked=0, Total=8930 [2022-11-25 17:37:15,282 INFO L413 NwaCegarLoop]: 497 mSDtfsCounter, 1146 mSDsluCounter, 9075 mSDsCounter, 0 mSdLazyCounter, 5385 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1185 SdHoareTripleChecker+Valid, 9572 SdHoareTripleChecker+Invalid, 5787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 5385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:37:15,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1185 Valid, 9572 Invalid, 5787 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [402 Valid, 5385 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-11-25 17:37:15,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15463 states. [2022-11-25 17:37:19,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15463 to 8494. [2022-11-25 17:37:19,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8494 states, 6553 states have (on average 1.1864794750495955) internal successors, (7775), 6658 states have internal predecessors, (7775), 1237 states have call successors, (1237), 703 states have call predecessors, (1237), 703 states have return successors, (1237), 1132 states have call predecessors, (1237), 1237 states have call successors, (1237) [2022-11-25 17:37:19,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8494 states to 8494 states and 10249 transitions. [2022-11-25 17:37:19,971 INFO L78 Accepts]: Start accepts. Automaton has 8494 states and 10249 transitions. Word has length 381 [2022-11-25 17:37:19,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:37:19,971 INFO L495 AbstractCegarLoop]: Abstraction has 8494 states and 10249 transitions. [2022-11-25 17:37:19,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 8.84375) internal successors, (283), 29 states have internal predecessors, (283), 9 states have call successors, (65), 7 states have call predecessors, (65), 15 states have return successors, (65), 12 states have call predecessors, (65), 9 states have call successors, (65) [2022-11-25 17:37:19,972 INFO L276 IsEmpty]: Start isEmpty. Operand 8494 states and 10249 transitions. [2022-11-25 17:37:19,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2022-11-25 17:37:19,983 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:37:19,983 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:37:19,990 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-25 17:37:20,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:37:20,187 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:37:20,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:37:20,188 INFO L85 PathProgramCache]: Analyzing trace with hash 507838617, now seen corresponding path program 1 times [2022-11-25 17:37:20,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:37:20,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354996232] [2022-11-25 17:37:20,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:37:20,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:37:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:21,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:37:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:21,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:37:21,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:21,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:37:21,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:21,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:37:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:21,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:37:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:22,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:37:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:22,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:37:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:22,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:37:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:22,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:37:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:22,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:37:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:22,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:37:22,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:22,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:37:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:22,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:37:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:22,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:37:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:22,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:37:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:22,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:37:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:22,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 17:37:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:22,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-25 17:37:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:22,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-25 17:37:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:22,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-11-25 17:37:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:22,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-11-25 17:37:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:22,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-11-25 17:37:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:22,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-11-25 17:37:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:22,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-11-25 17:37:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:22,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-11-25 17:37:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:22,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2022-11-25 17:37:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:22,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2022-11-25 17:37:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:22,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2022-11-25 17:37:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:22,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-11-25 17:37:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:22,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2022-11-25 17:37:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:22,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2022-11-25 17:37:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:22,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2022-11-25 17:37:22,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:22,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2022-11-25 17:37:22,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:22,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2022-11-25 17:37:22,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:22,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2022-11-25 17:37:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:22,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2022-11-25 17:37:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:22,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2022-11-25 17:37:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:22,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 378 [2022-11-25 17:37:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:22,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 22 proven. 25 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2022-11-25 17:37:22,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:37:22,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354996232] [2022-11-25 17:37:22,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354996232] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:37:22,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870662836] [2022-11-25 17:37:22,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:37:22,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:37:22,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:37:22,294 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:37:22,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-25 17:37:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:37:22,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 1377 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-25 17:37:22,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:37:24,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 571 proven. 261 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2022-11-25 17:37:24,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:37:27,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 155 proven. 154 refuted. 0 times theorem prover too weak. 794 trivial. 0 not checked. [2022-11-25 17:37:27,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870662836] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:37:27,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:37:27,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27, 21] total 64 [2022-11-25 17:37:27,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954792958] [2022-11-25 17:37:27,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:37:27,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-11-25 17:37:27,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:37:27,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-11-25 17:37:27,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=3796, Unknown=0, NotChecked=0, Total=4032 [2022-11-25 17:37:27,185 INFO L87 Difference]: Start difference. First operand 8494 states and 10249 transitions. Second operand has 64 states, 64 states have (on average 6.078125) internal successors, (389), 55 states have internal predecessors, (389), 20 states have call successors, (85), 12 states have call predecessors, (85), 22 states have return successors, (89), 28 states have call predecessors, (89), 20 states have call successors, (89) [2022-11-25 17:38:14,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:14,287 INFO L93 Difference]: Finished difference Result 29514 states and 38296 transitions. [2022-11-25 17:38:14,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2022-11-25 17:38:14,288 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 6.078125) internal successors, (389), 55 states have internal predecessors, (389), 20 states have call successors, (85), 12 states have call predecessors, (85), 22 states have return successors, (89), 28 states have call predecessors, (89), 20 states have call successors, (89) Word has length 393 [2022-11-25 17:38:14,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:14,364 INFO L225 Difference]: With dead ends: 29514 [2022-11-25 17:38:14,365 INFO L226 Difference]: Without dead ends: 21813 [2022-11-25 17:38:14,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1042 GetRequests, 837 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12150 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=2708, Invalid=39934, Unknown=0, NotChecked=0, Total=42642 [2022-11-25 17:38:14,385 INFO L413 NwaCegarLoop]: 612 mSDtfsCounter, 2152 mSDsluCounter, 20145 mSDsCounter, 0 mSdLazyCounter, 25351 mSolverCounterSat, 1264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2170 SdHoareTripleChecker+Valid, 20757 SdHoareTripleChecker+Invalid, 26615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 1264 IncrementalHoareTripleChecker+Valid, 25351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.7s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:14,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2170 Valid, 20757 Invalid, 26615 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [1264 Valid, 25351 Invalid, 0 Unknown, 0 Unchecked, 19.7s Time] [2022-11-25 17:38:14,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21813 states. [2022-11-25 17:38:20,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21813 to 8842. [2022-11-25 17:38:20,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8842 states, 6822 states have (on average 1.1871885077689828) internal successors, (8099), 6926 states have internal predecessors, (8099), 1276 states have call successors, (1276), 743 states have call predecessors, (1276), 743 states have return successors, (1276), 1172 states have call predecessors, (1276), 1276 states have call successors, (1276) [2022-11-25 17:38:20,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8842 states to 8842 states and 10651 transitions. [2022-11-25 17:38:20,270 INFO L78 Accepts]: Start accepts. Automaton has 8842 states and 10651 transitions. Word has length 393 [2022-11-25 17:38:20,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:20,271 INFO L495 AbstractCegarLoop]: Abstraction has 8842 states and 10651 transitions. [2022-11-25 17:38:20,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 6.078125) internal successors, (389), 55 states have internal predecessors, (389), 20 states have call successors, (85), 12 states have call predecessors, (85), 22 states have return successors, (89), 28 states have call predecessors, (89), 20 states have call successors, (89) [2022-11-25 17:38:20,272 INFO L276 IsEmpty]: Start isEmpty. Operand 8842 states and 10651 transitions. [2022-11-25 17:38:20,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2022-11-25 17:38:20,290 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:20,290 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:38:20,307 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-25 17:38:20,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:38:20,500 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:38:20,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:20,501 INFO L85 PathProgramCache]: Analyzing trace with hash -2086466752, now seen corresponding path program 1 times [2022-11-25 17:38:20,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:20,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574371323] [2022-11-25 17:38:20,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:20,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:20,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:20,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:38:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:20,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:38:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:20,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:38:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:20,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:38:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:20,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:38:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:20,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:38:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:20,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:38:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:20,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:38:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:20,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:38:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:20,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:38:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:20,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:38:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:20,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:38:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:20,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:38:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:20,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:38:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:20,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:38:20,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:20,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:38:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:20,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 17:38:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:20,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-25 17:38:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:20,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-25 17:38:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:20,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-11-25 17:38:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:21,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-11-25 17:38:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:21,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-11-25 17:38:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:21,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-11-25 17:38:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:21,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-11-25 17:38:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:21,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-11-25 17:38:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:21,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2022-11-25 17:38:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:21,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2022-11-25 17:38:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:21,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2022-11-25 17:38:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:21,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-11-25 17:38:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:21,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2022-11-25 17:38:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:21,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2022-11-25 17:38:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:21,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2022-11-25 17:38:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:21,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2022-11-25 17:38:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:21,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2022-11-25 17:38:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:21,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2022-11-25 17:38:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:21,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 364 [2022-11-25 17:38:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:21,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2022-11-25 17:38:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:21,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 378 [2022-11-25 17:38:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:21,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2022-11-25 17:38:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:21,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 395 [2022-11-25 17:38:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:21,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 404 [2022-11-25 17:38:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:21,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1223 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 1203 trivial. 0 not checked. [2022-11-25 17:38:21,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:21,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574371323] [2022-11-25 17:38:21,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574371323] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:38:21,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786754470] [2022-11-25 17:38:21,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:21,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:38:21,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:38:21,086 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:38:21,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-25 17:38:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:21,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 1463 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-25 17:38:21,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:38:22,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1223 backedges. 476 proven. 87 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2022-11-25 17:38:22,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:38:22,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1223 backedges. 52 proven. 34 refuted. 0 times theorem prover too weak. 1137 trivial. 0 not checked. [2022-11-25 17:38:22,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786754470] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:38:22,641 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:38:22,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 10] total 27 [2022-11-25 17:38:22,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95329442] [2022-11-25 17:38:22,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:38:22,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-25 17:38:22,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:22,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-25 17:38:22,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2022-11-25 17:38:22,646 INFO L87 Difference]: Start difference. First operand 8842 states and 10651 transitions. Second operand has 27 states, 24 states have (on average 10.75) internal successors, (258), 24 states have internal predecessors, (258), 9 states have call successors, (67), 8 states have call predecessors, (67), 11 states have return successors, (64), 8 states have call predecessors, (64), 9 states have call successors, (64) [2022-11-25 17:38:31,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:38:31,964 INFO L93 Difference]: Finished difference Result 17932 states and 22136 transitions. [2022-11-25 17:38:31,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-25 17:38:31,967 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 10.75) internal successors, (258), 24 states have internal predecessors, (258), 9 states have call successors, (67), 8 states have call predecessors, (67), 11 states have return successors, (64), 8 states have call predecessors, (64), 9 states have call successors, (64) Word has length 419 [2022-11-25 17:38:31,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:38:31,994 INFO L225 Difference]: With dead ends: 17932 [2022-11-25 17:38:31,995 INFO L226 Difference]: Without dead ends: 10172 [2022-11-25 17:38:32,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 946 GetRequests, 898 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=320, Invalid=2130, Unknown=0, NotChecked=0, Total=2450 [2022-11-25 17:38:32,006 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 600 mSDsluCounter, 2879 mSDsCounter, 0 mSdLazyCounter, 1965 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 3153 SdHoareTripleChecker+Invalid, 2187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 1965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:38:32,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 3153 Invalid, 2187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 1965 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-25 17:38:32,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10172 states. [2022-11-25 17:38:36,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10172 to 8742. [2022-11-25 17:38:36,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8742 states, 6743 states have (on average 1.1827079934747144) internal successors, (7975), 6846 states have internal predecessors, (7975), 1263 states have call successors, (1263), 735 states have call predecessors, (1263), 735 states have return successors, (1263), 1160 states have call predecessors, (1263), 1263 states have call successors, (1263) [2022-11-25 17:38:36,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8742 states to 8742 states and 10501 transitions. [2022-11-25 17:38:36,245 INFO L78 Accepts]: Start accepts. Automaton has 8742 states and 10501 transitions. Word has length 419 [2022-11-25 17:38:36,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:38:36,246 INFO L495 AbstractCegarLoop]: Abstraction has 8742 states and 10501 transitions. [2022-11-25 17:38:36,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 10.75) internal successors, (258), 24 states have internal predecessors, (258), 9 states have call successors, (67), 8 states have call predecessors, (67), 11 states have return successors, (64), 8 states have call predecessors, (64), 9 states have call successors, (64) [2022-11-25 17:38:36,246 INFO L276 IsEmpty]: Start isEmpty. Operand 8742 states and 10501 transitions. [2022-11-25 17:38:36,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2022-11-25 17:38:36,293 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:38:36,293 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 11, 9, 8, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:38:36,323 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-25 17:38:36,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:38:36,503 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:38:36,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:38:36,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1773801962, now seen corresponding path program 1 times [2022-11-25 17:38:36,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:38:36,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769934576] [2022-11-25 17:38:36,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:36,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:38:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:38:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:38:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:38:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:38:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:38:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:38:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:38:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:38:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:38:36,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:38:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:38:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:38:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:38:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:38:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:38:36,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:38:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 17:38:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-25 17:38:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-25 17:38:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-25 17:38:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-11-25 17:38:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-11-25 17:38:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-11-25 17:38:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-11-25 17:38:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-11-25 17:38:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-11-25 17:38:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-11-25 17:38:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2022-11-25 17:38:36,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2022-11-25 17:38:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-11-25 17:38:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2022-11-25 17:38:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2022-11-25 17:38:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2022-11-25 17:38:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2022-11-25 17:38:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2022-11-25 17:38:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 364 [2022-11-25 17:38:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2022-11-25 17:38:36,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 378 [2022-11-25 17:38:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2022-11-25 17:38:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 395 [2022-11-25 17:38:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 403 [2022-11-25 17:38:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:36,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 411 [2022-11-25 17:38:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:37,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1263 backedges. 41 proven. 2 refuted. 0 times theorem prover too weak. 1220 trivial. 0 not checked. [2022-11-25 17:38:37,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:38:37,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769934576] [2022-11-25 17:38:37,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769934576] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:38:37,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598037035] [2022-11-25 17:38:37,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:38:37,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:38:37,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:38:37,021 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:38:37,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-25 17:38:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:38:37,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 1488 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 17:38:37,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:38:38,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1263 backedges. 187 proven. 401 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2022-11-25 17:38:38,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:38:38,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1263 backedges. 23 proven. 31 refuted. 0 times theorem prover too weak. 1209 trivial. 0 not checked. [2022-11-25 17:38:38,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598037035] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:38:38,575 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:38:38,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 20 [2022-11-25 17:38:38,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243018356] [2022-11-25 17:38:38,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:38:38,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-25 17:38:38,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:38:38,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-25 17:38:38,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2022-11-25 17:38:38,582 INFO L87 Difference]: Start difference. First operand 8742 states and 10501 transitions. Second operand has 20 states, 20 states have (on average 15.45) internal successors, (309), 17 states have internal predecessors, (309), 7 states have call successors, (95), 7 states have call predecessors, (95), 9 states have return successors, (94), 9 states have call predecessors, (94), 7 states have call successors, (94) [2022-11-25 17:39:10,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:39:10,935 INFO L93 Difference]: Finished difference Result 35443 states and 45525 transitions. [2022-11-25 17:39:10,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-11-25 17:39:10,935 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 15.45) internal successors, (309), 17 states have internal predecessors, (309), 7 states have call successors, (95), 7 states have call predecessors, (95), 9 states have return successors, (94), 9 states have call predecessors, (94), 7 states have call successors, (94) Word has length 424 [2022-11-25 17:39:10,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:39:11,006 INFO L225 Difference]: With dead ends: 35443 [2022-11-25 17:39:11,007 INFO L226 Difference]: Without dead ends: 28477 [2022-11-25 17:39:11,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1080 GetRequests, 952 SyntacticMatches, 9 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4985 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1415, Invalid=13105, Unknown=0, NotChecked=0, Total=14520 [2022-11-25 17:39:11,020 INFO L413 NwaCegarLoop]: 503 mSDtfsCounter, 2595 mSDsluCounter, 5340 mSDsCounter, 0 mSdLazyCounter, 7033 mSolverCounterSat, 1444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2609 SdHoareTripleChecker+Valid, 5843 SdHoareTripleChecker+Invalid, 8477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1444 IncrementalHoareTripleChecker+Valid, 7033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:39:11,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2609 Valid, 5843 Invalid, 8477 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1444 Valid, 7033 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-11-25 17:39:11,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28477 states. [2022-11-25 17:39:17,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28477 to 13216. [2022-11-25 17:39:17,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13216 states, 10233 states have (on average 1.174337926316818) internal successors, (12017), 10378 states have internal predecessors, (12017), 1898 states have call successors, (1898), 1084 states have call predecessors, (1898), 1084 states have return successors, (1898), 1753 states have call predecessors, (1898), 1898 states have call successors, (1898) [2022-11-25 17:39:17,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13216 states to 13216 states and 15813 transitions. [2022-11-25 17:39:17,241 INFO L78 Accepts]: Start accepts. Automaton has 13216 states and 15813 transitions. Word has length 424 [2022-11-25 17:39:17,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:39:17,242 INFO L495 AbstractCegarLoop]: Abstraction has 13216 states and 15813 transitions. [2022-11-25 17:39:17,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 15.45) internal successors, (309), 17 states have internal predecessors, (309), 7 states have call successors, (95), 7 states have call predecessors, (95), 9 states have return successors, (94), 9 states have call predecessors, (94), 7 states have call successors, (94) [2022-11-25 17:39:17,242 INFO L276 IsEmpty]: Start isEmpty. Operand 13216 states and 15813 transitions. [2022-11-25 17:39:17,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2022-11-25 17:39:17,255 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:39:17,255 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 9, 9, 9, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:39:17,262 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-25 17:39:17,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:39:17,456 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:39:17,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:39:17,457 INFO L85 PathProgramCache]: Analyzing trace with hash -339759017, now seen corresponding path program 1 times [2022-11-25 17:39:17,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:39:17,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562954091] [2022-11-25 17:39:17,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:39:17,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:39:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:39:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:39:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:39:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:39:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:39:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:39:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:39:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:39:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:39:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:39:18,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:39:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:39:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:39:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:39:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:39:18,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:39:18,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 17:39:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-25 17:39:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-25 17:39:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-25 17:39:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-11-25 17:39:18,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-11-25 17:39:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-11-25 17:39:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-11-25 17:39:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-11-25 17:39:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-11-25 17:39:18,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-11-25 17:39:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2022-11-25 17:39:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2022-11-25 17:39:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-11-25 17:39:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2022-11-25 17:39:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2022-11-25 17:39:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2022-11-25 17:39:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2022-11-25 17:39:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2022-11-25 17:39:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2022-11-25 17:39:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2022-11-25 17:39:18,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 375 [2022-11-25 17:39:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 384 [2022-11-25 17:39:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 393 [2022-11-25 17:39:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 401 [2022-11-25 17:39:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 410 [2022-11-25 17:39:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:18,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1273 backedges. 24 proven. 23 refuted. 0 times theorem prover too weak. 1226 trivial. 0 not checked. [2022-11-25 17:39:18,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:39:18,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562954091] [2022-11-25 17:39:18,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562954091] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:39:18,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243751821] [2022-11-25 17:39:18,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:39:18,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:39:18,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:39:18,654 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:39:18,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-25 17:39:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:39:19,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 1486 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-25 17:39:19,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:39:19,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1273 backedges. 599 proven. 4 refuted. 0 times theorem prover too weak. 670 trivial. 0 not checked. [2022-11-25 17:39:19,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:39:19,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1273 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 1228 trivial. 0 not checked. [2022-11-25 17:39:19,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243751821] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:39:19,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:39:19,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 24 [2022-11-25 17:39:19,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151597301] [2022-11-25 17:39:19,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:39:19,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-25 17:39:19,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:39:19,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-25 17:39:19,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=499, Unknown=0, NotChecked=0, Total=552 [2022-11-25 17:39:19,609 INFO L87 Difference]: Start difference. First operand 13216 states and 15813 transitions. Second operand has 24 states, 24 states have (on average 11.291666666666666) internal successors, (271), 21 states have internal predecessors, (271), 10 states have call successors, (87), 5 states have call predecessors, (87), 7 states have return successors, (87), 12 states have call predecessors, (87), 10 states have call successors, (87) [2022-11-25 17:40:31,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:40:31,877 INFO L93 Difference]: Finished difference Result 68069 states and 87791 transitions. [2022-11-25 17:40:31,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 332 states. [2022-11-25 17:40:31,878 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 11.291666666666666) internal successors, (271), 21 states have internal predecessors, (271), 10 states have call successors, (87), 5 states have call predecessors, (87), 7 states have return successors, (87), 12 states have call predecessors, (87), 10 states have call successors, (87) Word has length 425 [2022-11-25 17:40:31,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:40:32,046 INFO L225 Difference]: With dead ends: 68069 [2022-11-25 17:40:32,046 INFO L226 Difference]: Without dead ends: 56080 [2022-11-25 17:40:32,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1308 GetRequests, 959 SyntacticMatches, 0 SemanticMatches, 349 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53501 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=7741, Invalid=115109, Unknown=0, NotChecked=0, Total=122850 [2022-11-25 17:40:32,075 INFO L413 NwaCegarLoop]: 905 mSDtfsCounter, 3350 mSDsluCounter, 9606 mSDsCounter, 0 mSdLazyCounter, 17660 mSolverCounterSat, 2832 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3368 SdHoareTripleChecker+Valid, 10511 SdHoareTripleChecker+Invalid, 20492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 2832 IncrementalHoareTripleChecker+Valid, 17660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:40:32,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3368 Valid, 10511 Invalid, 20492 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [2832 Valid, 17660 Invalid, 0 Unknown, 0 Unchecked, 12.4s Time] [2022-11-25 17:40:32,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56080 states. [2022-11-25 17:40:39,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56080 to 12188. [2022-11-25 17:40:39,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12188 states, 9513 states have (on average 1.1792284242615367) internal successors, (11218), 9619 states have internal predecessors, (11218), 1694 states have call successors, (1694), 980 states have call predecessors, (1694), 980 states have return successors, (1694), 1588 states have call predecessors, (1694), 1694 states have call successors, (1694) [2022-11-25 17:40:39,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12188 states to 12188 states and 14606 transitions. [2022-11-25 17:40:39,952 INFO L78 Accepts]: Start accepts. Automaton has 12188 states and 14606 transitions. Word has length 425 [2022-11-25 17:40:39,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:40:39,953 INFO L495 AbstractCegarLoop]: Abstraction has 12188 states and 14606 transitions. [2022-11-25 17:40:39,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 11.291666666666666) internal successors, (271), 21 states have internal predecessors, (271), 10 states have call successors, (87), 5 states have call predecessors, (87), 7 states have return successors, (87), 12 states have call predecessors, (87), 10 states have call successors, (87) [2022-11-25 17:40:39,953 INFO L276 IsEmpty]: Start isEmpty. Operand 12188 states and 14606 transitions. [2022-11-25 17:40:39,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2022-11-25 17:40:39,965 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:40:39,965 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:40:39,972 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-25 17:40:40,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-11-25 17:40:40,166 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:40:40,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:40:40,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1820955306, now seen corresponding path program 1 times [2022-11-25 17:40:40,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:40:40,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360194054] [2022-11-25 17:40:40,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:40:40,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:40:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:40:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:40:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:40:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:40:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:40:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:40:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:40:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:40:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:40:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:40:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:40:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:40:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:40:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:40:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:40:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:40:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 17:40:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-25 17:40:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-25 17:40:40,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-25 17:40:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-11-25 17:40:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-11-25 17:40:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-11-25 17:40:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-11-25 17:40:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-11-25 17:40:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-11-25 17:40:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-11-25 17:40:40,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2022-11-25 17:40:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2022-11-25 17:40:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2022-11-25 17:40:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2022-11-25 17:40:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2022-11-25 17:40:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2022-11-25 17:40:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2022-11-25 17:40:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2022-11-25 17:40:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2022-11-25 17:40:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 366 [2022-11-25 17:40:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 375 [2022-11-25 17:40:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 385 [2022-11-25 17:40:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 396 [2022-11-25 17:40:40,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 404 [2022-11-25 17:40:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 412 [2022-11-25 17:40:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2022-11-25 17:40:40,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:40:40,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360194054] [2022-11-25 17:40:40,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360194054] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:40:40,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148084702] [2022-11-25 17:40:40,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:40:40,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:40:40,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:40:40,540 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:40:40,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-25 17:40:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:40,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 1495 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-25 17:40:40,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:40:41,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 560 proven. 90 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2022-11-25 17:40:41,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:40:42,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 75 proven. 54 refuted. 0 times theorem prover too weak. 1171 trivial. 0 not checked. [2022-11-25 17:40:42,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148084702] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:40:42,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:40:42,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 27 [2022-11-25 17:40:42,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811362833] [2022-11-25 17:40:42,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:40:42,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-25 17:40:42,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:40:42,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-25 17:40:42,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2022-11-25 17:40:42,388 INFO L87 Difference]: Start difference. First operand 12188 states and 14606 transitions. Second operand has 27 states, 27 states have (on average 10.037037037037036) internal successors, (271), 22 states have internal predecessors, (271), 5 states have call successors, (76), 9 states have call predecessors, (76), 15 states have return successors, (75), 9 states have call predecessors, (75), 5 states have call successors, (75) [2022-11-25 17:41:31,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:41:31,569 INFO L93 Difference]: Finished difference Result 43887 states and 54953 transitions. [2022-11-25 17:41:31,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2022-11-25 17:41:31,569 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 10.037037037037036) internal successors, (271), 22 states have internal predecessors, (271), 5 states have call successors, (76), 9 states have call predecessors, (76), 15 states have return successors, (75), 9 states have call predecessors, (75), 5 states have call successors, (75) Word has length 427 [2022-11-25 17:41:31,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:41:31,641 INFO L225 Difference]: With dead ends: 43887 [2022-11-25 17:41:31,642 INFO L226 Difference]: Without dead ends: 32242 [2022-11-25 17:41:31,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1141 GetRequests, 968 SyntacticMatches, 1 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10695 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=2891, Invalid=27211, Unknown=0, NotChecked=0, Total=30102 [2022-11-25 17:41:31,658 INFO L413 NwaCegarLoop]: 691 mSDtfsCounter, 4405 mSDsluCounter, 8643 mSDsCounter, 0 mSdLazyCounter, 10367 mSolverCounterSat, 3149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4411 SdHoareTripleChecker+Valid, 9334 SdHoareTripleChecker+Invalid, 13516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3149 IncrementalHoareTripleChecker+Valid, 10367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:41:31,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4411 Valid, 9334 Invalid, 13516 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3149 Valid, 10367 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2022-11-25 17:41:31,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32242 states. [2022-11-25 17:41:42,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32242 to 16533. [2022-11-25 17:41:42,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16533 states, 12957 states have (on average 1.1628463378868565) internal successors, (15067), 13095 states have internal predecessors, (15067), 2165 states have call successors, (2165), 1410 states have call predecessors, (2165), 1410 states have return successors, (2165), 2027 states have call predecessors, (2165), 2165 states have call successors, (2165) [2022-11-25 17:41:42,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16533 states to 16533 states and 19397 transitions. [2022-11-25 17:41:42,738 INFO L78 Accepts]: Start accepts. Automaton has 16533 states and 19397 transitions. Word has length 427 [2022-11-25 17:41:42,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:41:42,739 INFO L495 AbstractCegarLoop]: Abstraction has 16533 states and 19397 transitions. [2022-11-25 17:41:42,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 10.037037037037036) internal successors, (271), 22 states have internal predecessors, (271), 5 states have call successors, (76), 9 states have call predecessors, (76), 15 states have return successors, (75), 9 states have call predecessors, (75), 5 states have call successors, (75) [2022-11-25 17:41:42,739 INFO L276 IsEmpty]: Start isEmpty. Operand 16533 states and 19397 transitions. [2022-11-25 17:41:42,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2022-11-25 17:41:42,751 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:41:42,751 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 12, 12, 10, 10, 10, 10, 9, 8, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:41:42,757 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-25 17:41:42,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-11-25 17:41:42,952 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:41:42,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:41:42,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1127425218, now seen corresponding path program 1 times [2022-11-25 17:41:42,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:41:42,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112621034] [2022-11-25 17:41:42,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:41:42,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:41:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:41:43,009 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:41:43,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:41:43,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:41:43,254 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:41:43,255 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 17:41:43,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-11-25 17:41:43,261 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:41:43,267 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:41:43,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:41:43 BoogieIcfgContainer [2022-11-25 17:41:43,536 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:41:43,537 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:41:43,537 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:41:43,537 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:41:43,538 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:31:52" (3/4) ... [2022-11-25 17:41:43,540 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 17:41:43,873 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 17:41:43,873 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:41:43,874 INFO L158 Benchmark]: Toolchain (without parser) took 592777.27ms. Allocated memory was 178.3MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 144.0MB in the beginning and 3.3GB in the end (delta: -3.1GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2022-11-25 17:41:43,874 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 134.2MB. Free memory is still 76.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:41:43,874 INFO L158 Benchmark]: CACSL2BoogieTranslator took 418.20ms. Allocated memory is still 178.3MB. Free memory was 144.0MB in the beginning and 127.7MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-25 17:41:43,874 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.54ms. Allocated memory is still 178.3MB. Free memory was 127.7MB in the beginning and 125.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:41:43,875 INFO L158 Benchmark]: Boogie Preprocessor took 51.26ms. Allocated memory is still 178.3MB. Free memory was 125.1MB in the beginning and 122.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:41:43,875 INFO L158 Benchmark]: RCFGBuilder took 1074.39ms. Allocated memory is still 178.3MB. Free memory was 122.5MB in the beginning and 140.3MB in the end (delta: -17.8MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2022-11-25 17:41:43,877 INFO L158 Benchmark]: TraceAbstraction took 590818.42ms. Allocated memory was 178.3MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 139.5MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2022-11-25 17:41:43,877 INFO L158 Benchmark]: Witness Printer took 336.52ms. Allocated memory is still 5.0GB. Free memory was 3.3GB in the beginning and 3.3GB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2022-11-25 17:41:43,886 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.40ms. Allocated memory is still 134.2MB. Free memory is still 76.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 418.20ms. Allocated memory is still 178.3MB. Free memory was 144.0MB in the beginning and 127.7MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.54ms. Allocated memory is still 178.3MB. Free memory was 127.7MB in the beginning and 125.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.26ms. Allocated memory is still 178.3MB. Free memory was 125.1MB in the beginning and 122.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1074.39ms. Allocated memory is still 178.3MB. Free memory was 122.5MB in the beginning and 140.3MB in the end (delta: -17.8MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. * TraceAbstraction took 590818.42ms. Allocated memory was 178.3MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 139.5MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 336.52ms. Allocated memory is still 5.0GB. Free memory was 3.3GB in the beginning and 3.3GB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 537]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] msg_t nomsg = (msg_t )-1; [L24] port_t g1v ; [L25] int8_t g1v_old ; [L26] int8_t g1v_new ; [L27] port_t g2v ; [L28] int8_t g2v_old ; [L29] int8_t g2v_new ; [L30] port_t g3v ; [L31] int8_t g3v_old ; [L32] int8_t g3v_new ; [L39] _Bool gate1Failed ; [L40] _Bool gate2Failed ; [L41] _Bool gate3Failed ; [L42] msg_t VALUE1 ; [L43] msg_t VALUE2 ; [L44] msg_t VALUE3 ; [L46] _Bool gate1Failed_History_0 ; [L47] _Bool gate1Failed_History_1 ; [L48] _Bool gate1Failed_History_2 ; [L49] _Bool gate2Failed_History_0 ; [L50] _Bool gate2Failed_History_1 ; [L51] _Bool gate2Failed_History_2 ; [L52] _Bool gate3Failed_History_0 ; [L53] _Bool gate3Failed_History_1 ; [L54] _Bool gate3Failed_History_2 ; [L55] int8_t votedValue_History_0 ; [L56] int8_t votedValue_History_1 ; [L57] int8_t votedValue_History_2 ; VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=0, votedValue_History_1=0, votedValue_History_2=0] [L479] int c1 ; [L480] int i2 ; [L483] c1 = 0 [L484] gate1Failed = __VERIFIER_nondet_bool() [L485] gate2Failed = __VERIFIER_nondet_bool() [L486] gate3Failed = __VERIFIER_nondet_bool() [L487] VALUE1 = __VERIFIER_nondet_char() [L488] VALUE2 = __VERIFIER_nondet_char() [L489] VALUE3 = __VERIFIER_nondet_char() [L490] gate1Failed_History_0 = __VERIFIER_nondet_bool() [L491] gate1Failed_History_1 = __VERIFIER_nondet_bool() [L492] gate1Failed_History_2 = __VERIFIER_nondet_bool() [L493] gate2Failed_History_0 = __VERIFIER_nondet_bool() [L494] gate2Failed_History_1 = __VERIFIER_nondet_bool() [L495] gate2Failed_History_2 = __VERIFIER_nondet_bool() [L496] gate3Failed_History_0 = __VERIFIER_nondet_bool() [L497] gate3Failed_History_1 = __VERIFIER_nondet_bool() [L498] gate3Failed_History_2 = __VERIFIER_nondet_bool() [L499] votedValue_History_0 = __VERIFIER_nondet_char() [L500] votedValue_History_1 = __VERIFIER_nondet_char() [L501] votedValue_History_2 = __VERIFIER_nondet_char() [L502] CALL, EXPR init() [L206] int tmp ; [L207] int tmp___0 ; [L208] int tmp___1 ; [L209] int tmp___2 ; VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L212] CALL, EXPR add_history_type(0) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] var = 0 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L75] COND TRUE history_id == 0 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L76] CALL, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L130] COND TRUE historyIndex == 0 [L131] return (gate1Failed_History_0); VAL [\old(history_id)=0, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L76] RET, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(0, 0)=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L76] tmp = (int )read_history_bool(0, 0) [L77] COND FALSE !(! (tmp == (int )ini_bool)) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L99] var ++ VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L75] COND TRUE history_id == 0 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L76] CALL, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L130] COND TRUE historyIndex == 0 [L131] return (gate1Failed_History_0); VAL [\old(history_id)=0, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L76] RET, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(0, 0)=0, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L76] tmp = (int )read_history_bool(0, 0) [L77] COND FALSE !(! (tmp == (int )ini_bool)) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L99] var ++ VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L75] COND TRUE history_id == 0 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L76] CALL, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L130] COND TRUE historyIndex == 0 [L131] return (gate1Failed_History_0); VAL [\old(history_id)=0, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L76] RET, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(0, 0)=0, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L76] tmp = (int )read_history_bool(0, 0) [L77] COND FALSE !(! (tmp == (int )ini_bool)) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L99] var ++ VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND FALSE !(var < 3) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L101] return (1); VAL [\old(history_id)=0, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L212] RET, EXPR add_history_type(0) VAL [add_history_type(0)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L212] tmp = add_history_type(0) [L213] COND FALSE !(! tmp) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, tmp=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L216] CALL, EXPR add_history_type(1) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] var = 0 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L81] COND TRUE history_id == 1 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L82] CALL, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L139] COND TRUE history_id == 1 VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L140] COND TRUE historyIndex == 0 [L141] return (gate2Failed_History_0); VAL [\old(history_id)=1, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L82] RET, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(1, 0)=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L82] tmp___0 = (int )read_history_bool(1, 0) [L83] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L99] var ++ VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L81] COND TRUE history_id == 1 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L82] CALL, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L139] COND TRUE history_id == 1 VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L140] COND TRUE historyIndex == 0 [L141] return (gate2Failed_History_0); VAL [\old(history_id)=1, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L82] RET, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(1, 0)=0, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L82] tmp___0 = (int )read_history_bool(1, 0) [L83] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L99] var ++ VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L81] COND TRUE history_id == 1 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L82] CALL, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L139] COND TRUE history_id == 1 VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L140] COND TRUE historyIndex == 0 [L141] return (gate2Failed_History_0); VAL [\old(history_id)=1, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L82] RET, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(1, 0)=0, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L82] tmp___0 = (int )read_history_bool(1, 0) [L83] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L99] var ++ VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND FALSE !(var < 3) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L101] return (1); VAL [\old(history_id)=1, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L216] RET, EXPR add_history_type(1) VAL [add_history_type(1)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, tmp=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L216] tmp___0 = add_history_type(1) [L217] COND FALSE !(! tmp___0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L220] CALL, EXPR add_history_type(2) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] var = 0 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L81] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L87] COND TRUE history_id == 2 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L88] CALL, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L139] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L149] COND TRUE history_id == 2 VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L150] COND TRUE historyIndex == 0 [L151] return (gate3Failed_History_0); VAL [\old(history_id)=2, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L88] RET, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(2, 0)=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L88] tmp___1 = (int )read_history_bool(2, 0) [L89] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L99] var ++ VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L81] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L87] COND TRUE history_id == 2 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L88] CALL, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L139] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L149] COND TRUE history_id == 2 VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L150] COND TRUE historyIndex == 0 [L151] return (gate3Failed_History_0); VAL [\old(history_id)=2, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L88] RET, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(2, 0)=0, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L88] tmp___1 = (int )read_history_bool(2, 0) [L89] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L99] var ++ VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L81] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L87] COND TRUE history_id == 2 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L88] CALL, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L139] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L149] COND TRUE history_id == 2 VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L150] COND TRUE historyIndex == 0 [L151] return (gate3Failed_History_0); VAL [\old(history_id)=2, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L88] RET, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(2, 0)=0, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L88] tmp___1 = (int )read_history_bool(2, 0) [L89] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L99] var ++ VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND FALSE !(var < 3) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L101] return (1); VAL [\old(history_id)=2, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L220] RET, EXPR add_history_type(2) VAL [add_history_type(2)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L220] tmp___1 = add_history_type(2) [L221] COND FALSE !(! tmp___1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L224] CALL, EXPR add_history_type(3) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] var = 0 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L81] COND FALSE !(history_id == 1) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L87] COND FALSE !(history_id == 2) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L93] COND TRUE history_id == 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L94] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L109] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L94] RET, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, read_history_int8(3, 0)=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L94] tmp___2 = (int )read_history_int8(3, 0) [L95] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L99] var ++ VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L81] COND FALSE !(history_id == 1) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L87] COND FALSE !(history_id == 2) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L93] COND TRUE history_id == 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L94] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L109] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L94] RET, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, read_history_int8(3, 0)=-2, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L94] tmp___2 = (int )read_history_int8(3, 0) [L95] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L99] var ++ VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L81] COND FALSE !(history_id == 1) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L87] COND FALSE !(history_id == 2) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L93] COND TRUE history_id == 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L94] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L109] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L94] RET, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, read_history_int8(3, 0)=-2, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L94] tmp___2 = (int )read_history_int8(3, 0) [L95] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L99] var ++ VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND FALSE !(var < 3) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L101] return (1); VAL [\old(history_id)=3, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L224] RET, EXPR add_history_type(3) VAL [add_history_type(3)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L224] tmp___2 = add_history_type(3) [L225] COND FALSE !(! tmp___2) [L228] return (1); VAL [\result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L502] RET, EXPR init() [L502] i2 = init() [L503] CALL assume_abort_if_not(i2) VAL [\old(cond)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L37] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L503] RET assume_abort_if_not(i2) VAL [c1=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, i2=1, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L504] g1v_old = nomsg [L505] g1v_new = nomsg [L506] g2v_old = nomsg [L507] g2v_new = nomsg [L508] g3v_old = nomsg [L509] g3v_new = nomsg [L510] i2 = 0 VAL [c1=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, i2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L511] COND TRUE 1 [L513] CALL gate1_each_pals_period() [L341] int8_t next_state ; [L342] msg_t tmp ; [L343] int tmp___0 ; [L346] gate1Failed = __VERIFIER_nondet_bool() [L347] CALL write_history_bool(0, gate1Failed) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=7, \old(gate1Failed_History_2)=2, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=3, \old(gate2Failed_History_2)=4, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=5, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=7, gate1Failed_History_2=2, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=4, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=5, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L184] COND TRUE history_id == 0 [L185] gate1Failed_History_2 = gate1Failed_History_1 [L186] gate1Failed_History_1 = gate1Failed_History_0 [L187] gate1Failed_History_0 = buf VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=7, \old(gate1Failed_History_2)=2, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=3, \old(gate2Failed_History_2)=4, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=5, \old(history_id)=0, buf=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=4, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=5, history_id=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L347] RET write_history_bool(0, gate1Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=4, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=5, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L348] COND TRUE \read(gate1Failed) [L349] g1v_new = nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=4, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=5, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L513] RET gate1_each_pals_period() [L514] CALL gate2_each_pals_period() [L372] int8_t next_state ; [L373] msg_t tmp ; [L374] int tmp___0 ; [L377] gate2Failed = __VERIFIER_nondet_bool() [L378] CALL write_history_bool(1, gate2Failed) VAL [\old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=3, \old(gate2Failed_History_2)=4, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=5, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=4, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=5, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L184] COND FALSE !(history_id == 0) VAL [\old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=3, \old(gate2Failed_History_2)=4, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=5, \old(history_id)=1, buf=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=4, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=5, history_id=1, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L189] COND TRUE history_id == 1 [L190] gate2Failed_History_2 = gate2Failed_History_1 [L191] gate2Failed_History_1 = gate2Failed_History_0 [L192] gate2Failed_History_0 = buf VAL [\old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=3, \old(gate2Failed_History_2)=4, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=5, \old(history_id)=1, buf=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=5, history_id=1, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L378] RET write_history_bool(1, gate2Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=5, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L379] COND TRUE \read(gate2Failed) [L380] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=5, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L514] RET gate2_each_pals_period() [L515] CALL gate3_each_pals_period() [L403] int8_t next_state ; [L404] msg_t tmp ; [L405] int tmp___0 ; [L408] gate3Failed = __VERIFIER_nondet_bool() [L409] CALL write_history_bool(2, gate3Failed) VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=3, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=5, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=5, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L184] COND FALSE !(history_id == 0) VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=3, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=5, \old(history_id)=2, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=5, history_id=2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L189] COND FALSE !(history_id == 1) VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=3, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=5, \old(history_id)=2, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=5, history_id=2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L194] COND TRUE history_id == 2 [L195] gate3Failed_History_2 = gate3Failed_History_1 [L196] gate3Failed_History_1 = gate3Failed_History_0 [L197] gate3Failed_History_0 = buf VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=3, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=5, \old(history_id)=2, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L409] RET write_history_bool(2, gate3Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L410] COND FALSE !(\read(gate3Failed)) [L414] tmp = __VERIFIER_nondet_char() [L415] next_state = tmp VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, next_state=0, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L416] COND TRUE (int )next_state == 0 [L417] tmp___0 = 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L427] CALL assume_abort_if_not((_Bool )tmp___0) VAL [\old(cond)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L37] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L427] RET assume_abort_if_not((_Bool )tmp___0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L428] g3v_new = next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L515] RET gate3_each_pals_period() [L516] CALL voter() [L434] int8_t voted_value ; [L437] voted_value = nomsg [L438] VALUE1 = g1v_old [L439] g1v_old = nomsg [L440] VALUE2 = g2v_old [L441] g2v_old = nomsg [L442] VALUE3 = g3v_old [L443] g3v_old = nomsg VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, voted_value=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L444] COND TRUE (int )VALUE1 == (int )VALUE2 [L445] voted_value = VALUE1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, voted_value=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L473] CALL write_history_int8(3, voted_value) [L169] COND TRUE history_id == 3 [L170] votedValue_History_2 = votedValue_History_1 [L171] votedValue_History_1 = votedValue_History_0 [L172] votedValue_History_0 = buf VAL [\old(buf)=-1, \old(history_id)=3, buf=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L473] RET write_history_int8(3, voted_value) [L516] RET voter() [L517] g1v_old = g1v_new [L518] g1v_new = nomsg [L519] g2v_old = g2v_new [L520] g2v_new = nomsg [L521] g3v_old = g3v_new [L522] g3v_new = nomsg [L523] CALL, EXPR check() [L233] int tmp ; [L234] int temp_count ; [L235] int8_t tmp___0 ; [L236] int8_t tmp___1 ; [L237] int8_t tmp___2 ; [L238] _Bool tmp___3 ; [L239] _Bool tmp___4 ; [L240] _Bool tmp___5 ; [L241] int8_t tmp___6 ; [L242] _Bool tmp___7 ; [L243] _Bool tmp___8 ; [L244] _Bool tmp___9 ; [L245] int8_t tmp___10 ; [L246] int8_t tmp___11 ; [L247] int8_t tmp___12 ; [L248] int8_t tmp___13 ; [L249] int8_t tmp___14 ; VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L252] COND FALSE !(! gate1Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L255] COND FALSE !(! gate2Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L258] COND TRUE ! gate3Failed [L259] tmp = 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L37] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] RET assume_abort_if_not((_Bool )tmp) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L264] CALL, EXPR read_history_bool(0, 1) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L129] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L130] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L133] COND TRUE historyIndex == 1 [L134] return (gate1Failed_History_1); VAL [\old(history_id)=0, \old(historyIndex)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L264] RET, EXPR read_history_bool(0, 1) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, read_history_bool(0, 1)=0, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L264] tmp___3 = read_history_bool(0, 1) [L265] COND TRUE ! tmp___3 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, tmp=1, tmp___3=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L266] CALL, EXPR read_history_bool(1, 1) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L129] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L139] COND TRUE history_id == 1 VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L140] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L143] COND TRUE historyIndex == 1 [L144] return (gate2Failed_History_1); VAL [\old(history_id)=1, \old(historyIndex)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L266] RET, EXPR read_history_bool(1, 1) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, read_history_bool(1, 1)=0, tmp=1, tmp___3=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L266] tmp___4 = read_history_bool(1, 1) [L267] COND TRUE ! tmp___4 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, tmp=1, tmp___3=0, tmp___4=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] CALL, EXPR read_history_bool(2, 1) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L129] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L139] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L149] COND TRUE history_id == 2 VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L150] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L153] COND TRUE historyIndex == 1 [L154] return (gate3Failed_History_1); VAL [\old(history_id)=2, \old(historyIndex)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] RET, EXPR read_history_bool(2, 1) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, read_history_bool(2, 1)=0, tmp=1, tmp___3=0, tmp___4=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] tmp___5 = read_history_bool(2, 1) [L269] COND TRUE ! tmp___5 [L270] temp_count = 0 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, temp_count=0, tmp=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L271] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L109] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L271] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, read_history_int8(3, 0)=-1, temp_count=0, tmp=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L271] tmp___0 = read_history_int8(3, 0) [L272] COND TRUE (int )VALUE1 == (int )tmp___0 [L273] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, temp_count=1, tmp=1, tmp___0=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L275] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L109] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L275] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, read_history_int8(3, 0)=-1, temp_count=1, tmp=1, tmp___0=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L275] tmp___1 = read_history_int8(3, 0) [L276] COND TRUE (int )VALUE2 == (int )tmp___1 [L277] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, temp_count=2, tmp=1, tmp___0=-1, tmp___1=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L279] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L109] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L279] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, read_history_int8(3, 0)=-1, temp_count=2, tmp=1, tmp___0=-1, tmp___1=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L279] tmp___2 = read_history_int8(3, 0) [L280] COND TRUE (int )VALUE3 == (int )tmp___2 [L281] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L283] COND FALSE !((int )VALUE1 != (int )VALUE2) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L297] COND FALSE !(! (temp_count > 1)) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L303] CALL, EXPR read_history_int8(3, 1) VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L109] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L110] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L113] COND TRUE historyIndex == 1 [L114] return (votedValue_History_1); VAL [\old(history_id)=3, \old(historyIndex)=1, \result=-2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L303] RET, EXPR read_history_int8(3, 1) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, read_history_int8(3, 1)=-2, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L303] tmp___10 = read_history_int8(3, 1) [L304] COND FALSE !((int )tmp___10 > -2) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___10=-2, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L323] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L109] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L323] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, read_history_int8(3, 0)=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___10=-2, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L323] tmp___11 = read_history_int8(3, 0) [L324] COND FALSE !((int )tmp___11 != (int )nomsg) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___10=-2, tmp___11=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L336] return (1); VAL [\result=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___10=-2, tmp___11=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L523] RET, EXPR check() [L523] c1 = check() [L524] CALL assert(c1) VAL [\old(arg)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L535] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L524] RET assert(c1) VAL [c1=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, i2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L511] COND TRUE 1 [L513] CALL gate1_each_pals_period() [L341] int8_t next_state ; [L342] msg_t tmp ; [L343] int tmp___0 ; [L346] gate1Failed = __VERIFIER_nondet_bool() [L347] CALL write_history_bool(0, gate1Failed) VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=3, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=6, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L184] COND TRUE history_id == 0 [L185] gate1Failed_History_2 = gate1Failed_History_1 [L186] gate1Failed_History_1 = gate1Failed_History_0 [L187] gate1Failed_History_0 = buf VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=3, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=6, \old(history_id)=0, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L347] RET write_history_bool(0, gate1Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L348] COND FALSE !(\read(gate1Failed)) [L352] tmp = __VERIFIER_nondet_char() [L353] next_state = tmp VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, next_state=0, nomsg=-1, tmp=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L354] COND TRUE (int )next_state == 0 [L355] tmp___0 = 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L365] CALL assume_abort_if_not((_Bool )tmp___0) VAL [\old(cond)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L37] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L365] RET assume_abort_if_not((_Bool )tmp___0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L366] g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L513] RET gate1_each_pals_period() [L514] CALL gate2_each_pals_period() [L372] int8_t next_state ; [L373] msg_t tmp ; [L374] int tmp___0 ; [L377] gate2Failed = __VERIFIER_nondet_bool() [L378] CALL write_history_bool(1, gate2Failed) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=3, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=6, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L184] COND FALSE !(history_id == 0) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=3, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=6, \old(history_id)=1, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L189] COND TRUE history_id == 1 [L190] gate2Failed_History_2 = gate2Failed_History_1 [L191] gate2Failed_History_1 = gate2Failed_History_0 [L192] gate2Failed_History_0 = buf VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=3, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=6, \old(history_id)=1, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L378] RET write_history_bool(1, gate2Failed) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L379] COND TRUE \read(gate2Failed) [L380] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L514] RET gate2_each_pals_period() [L515] CALL gate3_each_pals_period() [L403] int8_t next_state ; [L404] msg_t tmp ; [L405] int tmp___0 ; [L408] gate3Failed = __VERIFIER_nondet_bool() [L409] CALL write_history_bool(2, gate3Failed) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=6, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L184] COND FALSE !(history_id == 0) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=6, \old(history_id)=2, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=2, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L189] COND FALSE !(history_id == 1) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=6, \old(history_id)=2, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=2, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L194] COND TRUE history_id == 2 [L195] gate3Failed_History_2 = gate3Failed_History_1 [L196] gate3Failed_History_1 = gate3Failed_History_0 [L197] gate3Failed_History_0 = buf VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=6, \old(history_id)=2, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L409] RET write_history_bool(2, gate3Failed) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L410] COND TRUE \read(gate3Failed) [L411] g3v_new = nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L515] RET gate3_each_pals_period() [L516] CALL voter() [L434] int8_t voted_value ; [L437] voted_value = nomsg [L438] VALUE1 = g1v_old [L439] g1v_old = nomsg [L440] VALUE2 = g2v_old [L441] g2v_old = nomsg [L442] VALUE3 = g3v_old [L443] g3v_old = nomsg VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, voted_value=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L444] COND TRUE (int )VALUE1 == (int )VALUE2 [L445] voted_value = VALUE1 VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, voted_value=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L473] CALL write_history_int8(3, voted_value) [L169] COND TRUE history_id == 3 [L170] votedValue_History_2 = votedValue_History_1 [L171] votedValue_History_1 = votedValue_History_0 [L172] votedValue_History_0 = buf VAL [\old(buf)=-1, \old(history_id)=3, buf=-1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L473] RET write_history_int8(3, voted_value) [L516] RET voter() [L517] g1v_old = g1v_new [L518] g1v_new = nomsg [L519] g2v_old = g2v_new [L520] g2v_new = nomsg [L521] g3v_old = g3v_new [L522] g3v_new = nomsg [L523] CALL, EXPR check() [L233] int tmp ; [L234] int temp_count ; [L235] int8_t tmp___0 ; [L236] int8_t tmp___1 ; [L237] int8_t tmp___2 ; [L238] _Bool tmp___3 ; [L239] _Bool tmp___4 ; [L240] _Bool tmp___5 ; [L241] int8_t tmp___6 ; [L242] _Bool tmp___7 ; [L243] _Bool tmp___8 ; [L244] _Bool tmp___9 ; [L245] int8_t tmp___10 ; [L246] int8_t tmp___11 ; [L247] int8_t tmp___12 ; [L248] int8_t tmp___13 ; [L249] int8_t tmp___14 ; VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L252] COND TRUE ! gate1Failed [L253] tmp = 1 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L263] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L37] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L263] RET assume_abort_if_not((_Bool )tmp) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L264] CALL, EXPR read_history_bool(0, 1) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L129] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L133] COND TRUE historyIndex == 1 [L134] return (gate1Failed_History_1); VAL [\old(history_id)=0, \old(historyIndex)=1, \result=-511, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L264] RET, EXPR read_history_bool(0, 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(0, 1)=-511, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L264] tmp___3 = read_history_bool(0, 1) [L265] COND FALSE !(! tmp___3) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___3=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L303] CALL, EXPR read_history_int8(3, 1) VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L109] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L110] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L113] COND TRUE historyIndex == 1 [L114] return (votedValue_History_1); VAL [\old(history_id)=3, \old(historyIndex)=1, \result=-1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L303] RET, EXPR read_history_int8(3, 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_int8(3, 1)=-1, tmp=1, tmp___3=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L303] tmp___10 = read_history_int8(3, 1) [L304] COND TRUE (int )tmp___10 > -2 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L305] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L109] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L305] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_int8(3, 0)=-1, tmp=1, tmp___10=-1, tmp___3=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L305] tmp___6 = read_history_int8(3, 0) [L306] COND TRUE (int )tmp___6 == (int )nomsg VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L307] CALL, EXPR read_history_bool(0, 1) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L129] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L133] COND TRUE historyIndex == 1 [L134] return (gate1Failed_History_1); VAL [\old(history_id)=0, \old(historyIndex)=1, \result=-511, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L307] RET, EXPR read_history_bool(0, 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(0, 1)=-511, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L307] tmp___7 = read_history_bool(0, 1) [L308] COND TRUE \read(tmp___7) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L309] CALL, EXPR read_history_bool(1, 1) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L129] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L139] COND TRUE history_id == 1 VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L140] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L143] COND TRUE historyIndex == 1 [L144] return (gate2Failed_History_1); VAL [\old(history_id)=1, \old(historyIndex)=1, \result=-255, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L309] RET, EXPR read_history_bool(1, 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(1, 1)=-255, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L309] tmp___8 = read_history_bool(1, 1) [L310] COND TRUE \read(tmp___8) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, tmp___8=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L311] CALL, EXPR read_history_bool(2, 1) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L129] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L139] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L149] COND TRUE history_id == 2 VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L150] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L153] COND TRUE historyIndex == 1 [L154] return (gate3Failed_History_1); VAL [\old(history_id)=2, \old(historyIndex)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L311] RET, EXPR read_history_bool(2, 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(2, 1)=0, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, tmp___8=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L311] tmp___9 = read_history_bool(2, 1) [L312] COND TRUE ! tmp___9 [L313] return (0); VAL [\result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, tmp___8=1, tmp___9=0, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L523] RET, EXPR check() [L523] c1 = check() [L524] CALL assert(c1) VAL [\old(arg)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L535] COND TRUE ! arg VAL [\old(arg)=0, arg=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L537] reach_error() VAL [\old(arg)=0, arg=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 178 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 590.5s, OverallIterations: 50, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.4s, AutomataDifference: 465.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39747 SdHoareTripleChecker+Valid, 133.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39150 mSDsluCounter, 165953 SdHoareTripleChecker+Invalid, 115.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 148098 mSDsCounter, 29876 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 172239 IncrementalHoareTripleChecker+Invalid, 202115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29876 mSolverCounterUnsat, 17855 mSDtfsCounter, 172239 mSolverCounterSat, 1.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16835 GetRequests, 14171 SyntacticMatches, 24 SemanticMatches, 2640 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401770 ImplicationChecksByTransitivity, 125.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16533occurred in iteration=49, InterpolantAutomatonStates: 2373, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 71.1s AutomataMinimizationTime, 49 MinimizatonAttempts, 221000 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.5s SsaConstructionTime, 5.0s SatisfiabilityAnalysisTime, 39.2s InterpolantComputationTime, 19265 NumberOfCodeBlocks, 19265 NumberOfCodeBlocksAsserted, 73 NumberOfCheckSat, 23483 ConstructedInterpolants, 0 QuantifiedInterpolants, 53324 SizeOfPredicates, 80 NumberOfNonLiveVariables, 25069 ConjunctsInSsa, 467 ConjunctsInUnsatCore, 86 InterpolantComputations, 37 PerfectInterpolantSequences, 58472/61359 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-25 17:41:43,927 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a69f26ac-3319-44f4-99b3-9a0d7b0e0052/bin/uautomizer-ZsLfNo2U6R/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