./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 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/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_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt --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 b6f3ff50a8225ec4a3561cddab24b29423f49c6e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 01:01:54,449 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 01:01:54,453 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 01:01:54,504 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 01:01:54,505 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 01:01:54,510 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 01:01:54,513 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 01:01:54,517 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 01:01:54,520 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 01:01:54,527 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 01:01:54,528 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 01:01:54,530 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 01:01:54,531 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 01:01:54,534 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 01:01:54,536 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 01:01:54,542 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 01:01:54,544 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 01:01:54,545 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 01:01:54,550 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 01:01:54,557 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 01:01:54,559 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 01:01:54,561 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 01:01:54,564 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 01:01:54,565 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 01:01:54,571 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 01:01:54,572 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 01:01:54,572 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 01:01:54,574 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 01:01:54,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 01:01:54,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 01:01:54,577 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 01:01:54,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 01:01:54,579 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 01:01:54,580 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 01:01:54,582 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 01:01:54,582 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 01:01:54,583 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 01:01:54,583 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 01:01:54,583 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 01:01:54,584 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 01:01:54,585 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 01:01:54,586 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-13 01:01:54,625 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 01:01:54,625 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 01:01:54,626 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 01:01:54,626 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 01:01:54,627 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 01:01:54,627 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 01:01:54,627 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 01:01:54,628 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 01:01:54,628 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 01:01:54,628 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 01:01:54,628 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 01:01:54,629 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 01:01:54,629 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 01:01:54,629 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 01:01:54,629 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 01:01:54,629 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 01:01:54,630 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 01:01:54,630 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 01:01:54,630 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 01:01:54,630 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 01:01:54,631 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 01:01:54,631 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 01:01:54,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 01:01:54,631 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 01:01:54,631 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 01:01:54,632 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 01:01:54,632 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 01:01:54,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 01:01:54,632 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 01:01:54,633 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 01:01:54,633 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/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_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt 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 -> b6f3ff50a8225ec4a3561cddab24b29423f49c6e [2021-10-13 01:01:54,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 01:01:54,927 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 01:01:54,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 01:01:54,931 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 01:01:54,932 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 01:01:54,932 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2021-10-13 01:01:55,006 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/data/a8feacdac/a1c13195bca7404ebef56b7f79192575/FLAG7ec2e1636 [2021-10-13 01:01:55,569 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 01:01:55,570 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2021-10-13 01:01:55,581 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/data/a8feacdac/a1c13195bca7404ebef56b7f79192575/FLAG7ec2e1636 [2021-10-13 01:01:55,930 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/data/a8feacdac/a1c13195bca7404ebef56b7f79192575 [2021-10-13 01:01:55,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 01:01:55,934 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 01:01:55,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 01:01:55,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 01:01:55,950 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 01:01:55,951 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:01:55" (1/1) ... [2021-10-13 01:01:55,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30155d05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:01:55, skipping insertion in model container [2021-10-13 01:01:55,953 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:01:55" (1/1) ... [2021-10-13 01:01:55,960 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 01:01:55,994 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 01:01:56,256 WARN L228 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_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c[12020,12033] [2021-10-13 01:01:56,258 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 01:01:56,267 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 01:01:56,328 WARN L228 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_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c[12020,12033] [2021-10-13 01:01:56,329 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 01:01:56,344 INFO L208 MainTranslator]: Completed translation [2021-10-13 01:01:56,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:01:56 WrapperNode [2021-10-13 01:01:56,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 01:01:56,346 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 01:01:56,346 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 01:01:56,346 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 01:01:56,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:01:56" (1/1) ... [2021-10-13 01:01:56,376 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:01:56" (1/1) ... [2021-10-13 01:01:56,445 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 01:01:56,445 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 01:01:56,446 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 01:01:56,446 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 01:01:56,454 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:01:56" (1/1) ... [2021-10-13 01:01:56,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:01:56" (1/1) ... [2021-10-13 01:01:56,468 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:01:56" (1/1) ... [2021-10-13 01:01:56,468 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:01:56" (1/1) ... [2021-10-13 01:01:56,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:01:56" (1/1) ... [2021-10-13 01:01:56,530 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:01:56" (1/1) ... [2021-10-13 01:01:56,535 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:01:56" (1/1) ... [2021-10-13 01:01:56,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 01:01:56,548 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 01:01:56,549 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 01:01:56,549 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 01:01:56,550 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:01:56" (1/1) ... [2021-10-13 01:01:56,561 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 01:01:56,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:01:56,615 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 01:01:56,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 01:01:56,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 01:01:56,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 01:01:56,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 01:01:56,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 01:01:58,155 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 01:01:58,156 INFO L299 CfgBuilder]: Removed 183 assume(true) statements. [2021-10-13 01:01:58,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:01:58 BoogieIcfgContainer [2021-10-13 01:01:58,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 01:01:58,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 01:01:58,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 01:01:58,166 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 01:01:58,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:01:55" (1/3) ... [2021-10-13 01:01:58,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34179d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:01:58, skipping insertion in model container [2021-10-13 01:01:58,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:01:56" (2/3) ... [2021-10-13 01:01:58,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34179d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:01:58, skipping insertion in model container [2021-10-13 01:01:58,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:01:58" (3/3) ... [2021-10-13 01:01:58,171 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2021-10-13 01:01:58,177 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 01:01:58,177 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2021-10-13 01:01:58,256 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 01:01:58,266 INFO L339 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, mConcurrency=FINITE_AUTOMATA, 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, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 01:01:58,267 INFO L340 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2021-10-13 01:01:58,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 521 states, 483 states have (on average 1.7971014492753623) internal successors, (868), 520 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:58,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-13 01:01:58,310 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:01:58,311 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:01:58,311 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:01:58,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:01:58,317 INFO L82 PathProgramCache]: Analyzing trace with hash 595705480, now seen corresponding path program 1 times [2021-10-13 01:01:58,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:01:58,328 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292084593] [2021-10-13 01:01:58,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:01:58,329 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:01:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:01:58,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:01:58,508 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:01:58,508 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292084593] [2021-10-13 01:01:58,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292084593] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:01:58,509 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:01:58,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:01:58,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656203024] [2021-10-13 01:01:58,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:01:58,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:01:58,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:01:58,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:01:58,532 INFO L87 Difference]: Start difference. First operand has 521 states, 483 states have (on average 1.7971014492753623) internal successors, (868), 520 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:58,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:01:58,729 INFO L93 Difference]: Finished difference Result 1245 states and 2060 transitions. [2021-10-13 01:01:58,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:01:58,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-10-13 01:01:58,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:01:58,749 INFO L225 Difference]: With dead ends: 1245 [2021-10-13 01:01:58,749 INFO L226 Difference]: Without dead ends: 726 [2021-10-13 01:01:58,754 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:01:58,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2021-10-13 01:01:58,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 457. [2021-10-13 01:01:58,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 426 states have (on average 1.6713615023474178) internal successors, (712), 456 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:58,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 712 transitions. [2021-10-13 01:01:58,822 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 712 transitions. Word has length 9 [2021-10-13 01:01:58,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:01:58,822 INFO L470 AbstractCegarLoop]: Abstraction has 457 states and 712 transitions. [2021-10-13 01:01:58,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:58,823 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 712 transitions. [2021-10-13 01:01:58,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-13 01:01:58,824 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:01:58,824 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:01:58,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 01:01:58,825 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:01:58,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:01:58,826 INFO L82 PathProgramCache]: Analyzing trace with hash -503954138, now seen corresponding path program 1 times [2021-10-13 01:01:58,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:01:58,826 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892778385] [2021-10-13 01:01:58,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:01:58,827 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:01:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:01:58,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:01:58,891 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:01:58,892 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892778385] [2021-10-13 01:01:58,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892778385] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:01:58,892 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:01:58,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:01:58,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658285157] [2021-10-13 01:01:58,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:01:58,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:01:58,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:01:58,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:01:58,897 INFO L87 Difference]: Start difference. First operand 457 states and 712 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:58,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:01:58,966 INFO L93 Difference]: Finished difference Result 1131 states and 1746 transitions. [2021-10-13 01:01:58,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:01:58,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-10-13 01:01:58,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:01:58,971 INFO L225 Difference]: With dead ends: 1131 [2021-10-13 01:01:58,972 INFO L226 Difference]: Without dead ends: 676 [2021-10-13 01:01:58,973 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:01:58,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2021-10-13 01:01:59,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 424. [2021-10-13 01:01:59,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 396 states have (on average 1.6515151515151516) internal successors, (654), 423 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:59,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 654 transitions. [2021-10-13 01:01:59,015 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 654 transitions. Word has length 10 [2021-10-13 01:01:59,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:01:59,015 INFO L470 AbstractCegarLoop]: Abstraction has 424 states and 654 transitions. [2021-10-13 01:01:59,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:59,016 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 654 transitions. [2021-10-13 01:01:59,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-13 01:01:59,019 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:01:59,019 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:01:59,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 01:01:59,020 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:01:59,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:01:59,030 INFO L82 PathProgramCache]: Analyzing trace with hash -248055967, now seen corresponding path program 1 times [2021-10-13 01:01:59,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:01:59,031 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874130425] [2021-10-13 01:01:59,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:01:59,032 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:01:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:01:59,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:01:59,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:01:59,111 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874130425] [2021-10-13 01:01:59,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874130425] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:01:59,113 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:01:59,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:01:59,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445320021] [2021-10-13 01:01:59,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:01:59,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:01:59,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:01:59,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:01:59,121 INFO L87 Difference]: Start difference. First operand 424 states and 654 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:59,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:01:59,178 INFO L93 Difference]: Finished difference Result 1250 states and 1933 transitions. [2021-10-13 01:01:59,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:01:59,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-10-13 01:01:59,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:01:59,193 INFO L225 Difference]: With dead ends: 1250 [2021-10-13 01:01:59,193 INFO L226 Difference]: Without dead ends: 836 [2021-10-13 01:01:59,194 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:01:59,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2021-10-13 01:01:59,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 428. [2021-10-13 01:01:59,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 400 states have (on average 1.645) internal successors, (658), 427 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:59,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 658 transitions. [2021-10-13 01:01:59,209 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 658 transitions. Word has length 14 [2021-10-13 01:01:59,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:01:59,210 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 658 transitions. [2021-10-13 01:01:59,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:59,210 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 658 transitions. [2021-10-13 01:01:59,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-13 01:01:59,211 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:01:59,211 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:01:59,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 01:01:59,212 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:01:59,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:01:59,212 INFO L82 PathProgramCache]: Analyzing trace with hash -35486156, now seen corresponding path program 1 times [2021-10-13 01:01:59,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:01:59,213 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37559762] [2021-10-13 01:01:59,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:01:59,213 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:01:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:01:59,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:01:59,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:01:59,283 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37559762] [2021-10-13 01:01:59,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37559762] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:01:59,284 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:01:59,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:01:59,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927301076] [2021-10-13 01:01:59,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:01:59,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:01:59,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:01:59,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:01:59,287 INFO L87 Difference]: Start difference. First operand 428 states and 658 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:59,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:01:59,380 INFO L93 Difference]: Finished difference Result 1579 states and 2407 transitions. [2021-10-13 01:01:59,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 01:01:59,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-10-13 01:01:59,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:01:59,388 INFO L225 Difference]: With dead ends: 1579 [2021-10-13 01:01:59,388 INFO L226 Difference]: Without dead ends: 1165 [2021-10-13 01:01:59,390 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:01:59,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2021-10-13 01:01:59,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 430. [2021-10-13 01:01:59,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 402 states have (on average 1.6417910447761195) internal successors, (660), 429 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:59,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 660 transitions. [2021-10-13 01:01:59,410 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 660 transitions. Word has length 18 [2021-10-13 01:01:59,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:01:59,410 INFO L470 AbstractCegarLoop]: Abstraction has 430 states and 660 transitions. [2021-10-13 01:01:59,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:59,411 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 660 transitions. [2021-10-13 01:01:59,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 01:01:59,413 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:01:59,413 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:01:59,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 01:01:59,414 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:01:59,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:01:59,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1707916525, now seen corresponding path program 1 times [2021-10-13 01:01:59,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:01:59,415 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061022839] [2021-10-13 01:01:59,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:01:59,416 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:01:59,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:01:59,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:01:59,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:01:59,514 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061022839] [2021-10-13 01:01:59,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061022839] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:01:59,514 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:01:59,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:01:59,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691456611] [2021-10-13 01:01:59,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:01:59,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:01:59,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:01:59,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:01:59,516 INFO L87 Difference]: Start difference. First operand 430 states and 660 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:59,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:01:59,558 INFO L93 Difference]: Finished difference Result 673 states and 1026 transitions. [2021-10-13 01:01:59,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:01:59,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-13 01:01:59,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:01:59,561 INFO L225 Difference]: With dead ends: 673 [2021-10-13 01:01:59,561 INFO L226 Difference]: Without dead ends: 428 [2021-10-13 01:01:59,562 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:01:59,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-10-13 01:01:59,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2021-10-13 01:01:59,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 400 states have (on average 1.6325) internal successors, (653), 427 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:59,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 653 transitions. [2021-10-13 01:01:59,574 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 653 transitions. Word has length 19 [2021-10-13 01:01:59,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:01:59,574 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 653 transitions. [2021-10-13 01:01:59,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:59,575 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 653 transitions. [2021-10-13 01:01:59,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 01:01:59,578 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:01:59,578 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:01:59,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 01:01:59,579 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:01:59,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:01:59,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1967275947, now seen corresponding path program 1 times [2021-10-13 01:01:59,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:01:59,580 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025115805] [2021-10-13 01:01:59,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:01:59,580 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:01:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:01:59,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:01:59,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:01:59,638 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025115805] [2021-10-13 01:01:59,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025115805] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:01:59,638 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25804360] [2021-10-13 01:01:59,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:01:59,639 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:01:59,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:01:59,641 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:01:59,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-13 01:01:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:01:59,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-13 01:01:59,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:01:59,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:01:59,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25804360] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:01:59,857 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 01:01:59,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-10-13 01:01:59,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23166479] [2021-10-13 01:01:59,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 01:01:59,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:01:59,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 01:01:59,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:01:59,866 INFO L87 Difference]: Start difference. First operand 428 states and 653 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:59,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:01:59,997 INFO L93 Difference]: Finished difference Result 1667 states and 2557 transitions. [2021-10-13 01:01:59,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:01:59,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-13 01:01:59,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:00,007 INFO L225 Difference]: With dead ends: 1667 [2021-10-13 01:02:00,007 INFO L226 Difference]: Without dead ends: 1250 [2021-10-13 01:02:00,008 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:02:00,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2021-10-13 01:02:00,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 574. [2021-10-13 01:02:00,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 546 states have (on average 1.6538461538461537) internal successors, (903), 573 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:00,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 903 transitions. [2021-10-13 01:02:00,035 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 903 transitions. Word has length 21 [2021-10-13 01:02:00,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:00,035 INFO L470 AbstractCegarLoop]: Abstraction has 574 states and 903 transitions. [2021-10-13 01:02:00,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:00,036 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 903 transitions. [2021-10-13 01:02:00,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-13 01:02:00,037 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:00,039 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:00,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-13 01:02:00,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:02:00,254 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:00,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:00,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1165168607, now seen corresponding path program 2 times [2021-10-13 01:02:00,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:00,255 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524721720] [2021-10-13 01:02:00,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:00,255 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:00,296 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-13 01:02:00,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:00,297 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524721720] [2021-10-13 01:02:00,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524721720] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:00,297 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:00,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:00,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612463701] [2021-10-13 01:02:00,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:02:00,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:00,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:00,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:00,299 INFO L87 Difference]: Start difference. First operand 574 states and 903 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:00,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:00,401 INFO L93 Difference]: Finished difference Result 1297 states and 2010 transitions. [2021-10-13 01:02:00,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:00,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-10-13 01:02:00,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:00,406 INFO L225 Difference]: With dead ends: 1297 [2021-10-13 01:02:00,406 INFO L226 Difference]: Without dead ends: 781 [2021-10-13 01:02:00,408 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:00,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2021-10-13 01:02:00,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 508. [2021-10-13 01:02:00,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 485 states have (on average 1.6041237113402063) internal successors, (778), 507 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:00,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 778 transitions. [2021-10-13 01:02:00,428 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 778 transitions. Word has length 28 [2021-10-13 01:02:00,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:00,429 INFO L470 AbstractCegarLoop]: Abstraction has 508 states and 778 transitions. [2021-10-13 01:02:00,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:00,429 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 778 transitions. [2021-10-13 01:02:00,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-13 01:02:00,430 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:00,430 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:00,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 01:02:00,431 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:00,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:00,431 INFO L82 PathProgramCache]: Analyzing trace with hash 777427029, now seen corresponding path program 1 times [2021-10-13 01:02:00,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:00,432 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100102797] [2021-10-13 01:02:00,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:00,432 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:00,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:00,468 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-13 01:02:00,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:00,468 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100102797] [2021-10-13 01:02:00,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100102797] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:00,468 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:00,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:00,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518104595] [2021-10-13 01:02:00,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:02:00,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:00,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:00,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:00,470 INFO L87 Difference]: Start difference. First operand 508 states and 778 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:00,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:00,525 INFO L93 Difference]: Finished difference Result 1165 states and 1769 transitions. [2021-10-13 01:02:00,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:00,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-10-13 01:02:00,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:00,530 INFO L225 Difference]: With dead ends: 1165 [2021-10-13 01:02:00,530 INFO L226 Difference]: Without dead ends: 688 [2021-10-13 01:02:00,531 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:00,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2021-10-13 01:02:00,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 457. [2021-10-13 01:02:00,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 436 states have (on average 1.5688073394495412) internal successors, (684), 456 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:00,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 684 transitions. [2021-10-13 01:02:00,547 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 684 transitions. Word has length 28 [2021-10-13 01:02:00,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:00,547 INFO L470 AbstractCegarLoop]: Abstraction has 457 states and 684 transitions. [2021-10-13 01:02:00,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:00,548 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 684 transitions. [2021-10-13 01:02:00,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-13 01:02:00,548 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:00,549 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-10-13 01:02:00,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 01:02:00,549 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:00,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:00,549 INFO L82 PathProgramCache]: Analyzing trace with hash 104948594, now seen corresponding path program 1 times [2021-10-13 01:02:00,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:00,550 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607377477] [2021-10-13 01:02:00,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:00,550 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:00,591 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-13 01:02:00,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:00,591 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607377477] [2021-10-13 01:02:00,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607377477] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:00,591 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:00,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:02:00,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355228316] [2021-10-13 01:02:00,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:02:00,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:00,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:02:00,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:02:00,593 INFO L87 Difference]: Start difference. First operand 457 states and 684 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:00,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:00,645 INFO L93 Difference]: Finished difference Result 1099 states and 1650 transitions. [2021-10-13 01:02:00,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:02:00,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-13 01:02:00,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:00,650 INFO L225 Difference]: With dead ends: 1099 [2021-10-13 01:02:00,650 INFO L226 Difference]: Without dead ends: 686 [2021-10-13 01:02:00,651 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:02:00,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2021-10-13 01:02:00,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 457. [2021-10-13 01:02:00,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 436 states have (on average 1.5642201834862386) internal successors, (682), 456 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:00,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 682 transitions. [2021-10-13 01:02:00,677 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 682 transitions. Word has length 38 [2021-10-13 01:02:00,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:00,678 INFO L470 AbstractCegarLoop]: Abstraction has 457 states and 682 transitions. [2021-10-13 01:02:00,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:00,678 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 682 transitions. [2021-10-13 01:02:00,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-13 01:02:00,679 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:00,679 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-10-13 01:02:00,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 01:02:00,679 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:00,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:00,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1338937392, now seen corresponding path program 1 times [2021-10-13 01:02:00,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:00,680 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076083953] [2021-10-13 01:02:00,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:00,681 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:00,722 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-13 01:02:00,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:00,723 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076083953] [2021-10-13 01:02:00,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076083953] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:00,723 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:00,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:00,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428765812] [2021-10-13 01:02:00,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:02:00,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:00,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:00,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:00,725 INFO L87 Difference]: Start difference. First operand 457 states and 682 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:00,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:00,766 INFO L93 Difference]: Finished difference Result 1035 states and 1549 transitions. [2021-10-13 01:02:00,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:00,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-10-13 01:02:00,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:00,770 INFO L225 Difference]: With dead ends: 1035 [2021-10-13 01:02:00,770 INFO L226 Difference]: Without dead ends: 641 [2021-10-13 01:02:00,771 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:00,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2021-10-13 01:02:00,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 413. [2021-10-13 01:02:00,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 393 states have (on average 1.5470737913486006) internal successors, (608), 412 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:00,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 608 transitions. [2021-10-13 01:02:00,786 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 608 transitions. Word has length 50 [2021-10-13 01:02:00,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:00,786 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 608 transitions. [2021-10-13 01:02:00,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:00,786 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 608 transitions. [2021-10-13 01:02:00,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-13 01:02:00,787 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:00,787 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-10-13 01:02:00,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 01:02:00,787 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:00,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:00,788 INFO L82 PathProgramCache]: Analyzing trace with hash 970476669, now seen corresponding path program 1 times [2021-10-13 01:02:00,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:00,788 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247992912] [2021-10-13 01:02:00,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:00,789 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:00,830 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-13 01:02:00,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:00,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247992912] [2021-10-13 01:02:00,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247992912] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:00,830 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:00,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:00,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332569722] [2021-10-13 01:02:00,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:02:00,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:00,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:00,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:00,832 INFO L87 Difference]: Start difference. First operand 413 states and 608 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:00,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:00,890 INFO L93 Difference]: Finished difference Result 869 states and 1278 transitions. [2021-10-13 01:02:00,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:00,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-10-13 01:02:00,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:00,895 INFO L225 Difference]: With dead ends: 869 [2021-10-13 01:02:00,896 INFO L226 Difference]: Without dead ends: 511 [2021-10-13 01:02:00,899 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:00,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2021-10-13 01:02:00,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 369. [2021-10-13 01:02:00,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 353 states have (on average 1.4730878186968839) internal successors, (520), 368 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:00,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 520 transitions. [2021-10-13 01:02:00,913 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 520 transitions. Word has length 51 [2021-10-13 01:02:00,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:00,913 INFO L470 AbstractCegarLoop]: Abstraction has 369 states and 520 transitions. [2021-10-13 01:02:00,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:00,914 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 520 transitions. [2021-10-13 01:02:00,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-10-13 01:02:00,915 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:00,915 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-10-13 01:02:00,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 01:02:00,917 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:00,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:00,917 INFO L82 PathProgramCache]: Analyzing trace with hash 216341264, now seen corresponding path program 1 times [2021-10-13 01:02:00,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:00,918 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224027465] [2021-10-13 01:02:00,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:00,919 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:00,987 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-13 01:02:00,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:00,988 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224027465] [2021-10-13 01:02:00,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224027465] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:00,988 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:00,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:02:00,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797930287] [2021-10-13 01:02:00,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:02:00,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:00,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:02:00,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:02:00,990 INFO L87 Difference]: Start difference. First operand 369 states and 520 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:01,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:01,032 INFO L93 Difference]: Finished difference Result 877 states and 1257 transitions. [2021-10-13 01:02:01,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:02:01,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-10-13 01:02:01,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:01,036 INFO L225 Difference]: With dead ends: 877 [2021-10-13 01:02:01,036 INFO L226 Difference]: Without dead ends: 580 [2021-10-13 01:02:01,037 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:02:01,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2021-10-13 01:02:01,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 369. [2021-10-13 01:02:01,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 353 states have (on average 1.4674220963172804) internal successors, (518), 368 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:01,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 518 transitions. [2021-10-13 01:02:01,050 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 518 transitions. Word has length 62 [2021-10-13 01:02:01,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:01,051 INFO L470 AbstractCegarLoop]: Abstraction has 369 states and 518 transitions. [2021-10-13 01:02:01,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:01,051 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 518 transitions. [2021-10-13 01:02:01,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-10-13 01:02:01,052 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:01,052 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:01,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 01:02:01,053 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:01,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:01,053 INFO L82 PathProgramCache]: Analyzing trace with hash 542276843, now seen corresponding path program 1 times [2021-10-13 01:02:01,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:01,054 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876271319] [2021-10-13 01:02:01,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:01,054 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:01,096 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-10-13 01:02:01,097 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:01,097 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876271319] [2021-10-13 01:02:01,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876271319] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:01,097 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:01,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:01,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836552983] [2021-10-13 01:02:01,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:02:01,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:01,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:01,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:01,099 INFO L87 Difference]: Start difference. First operand 369 states and 518 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:01,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:01,146 INFO L93 Difference]: Finished difference Result 728 states and 1056 transitions. [2021-10-13 01:02:01,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:01,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-10-13 01:02:01,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:01,150 INFO L225 Difference]: With dead ends: 728 [2021-10-13 01:02:01,150 INFO L226 Difference]: Without dead ends: 465 [2021-10-13 01:02:01,151 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:01,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2021-10-13 01:02:01,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 327. [2021-10-13 01:02:01,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 321 states have (on average 1.4454828660436136) internal successors, (464), 326 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:01,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 464 transitions. [2021-10-13 01:02:01,164 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 464 transitions. Word has length 76 [2021-10-13 01:02:01,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:01,164 INFO L470 AbstractCegarLoop]: Abstraction has 327 states and 464 transitions. [2021-10-13 01:02:01,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:01,165 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 464 transitions. [2021-10-13 01:02:01,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-10-13 01:02:01,165 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:01,166 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:01,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 01:02:01,166 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:01,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:01,167 INFO L82 PathProgramCache]: Analyzing trace with hash -532838176, now seen corresponding path program 1 times [2021-10-13 01:02:01,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:01,167 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172810259] [2021-10-13 01:02:01,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:01,167 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:01,225 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-10-13 01:02:01,226 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:01,226 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172810259] [2021-10-13 01:02:01,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172810259] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:01,226 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:01,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:01,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173964070] [2021-10-13 01:02:01,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:02:01,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:01,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:01,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:01,228 INFO L87 Difference]: Start difference. First operand 327 states and 464 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:01,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:01,253 INFO L93 Difference]: Finished difference Result 516 states and 747 transitions. [2021-10-13 01:02:01,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:01,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-10-13 01:02:01,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:01,256 INFO L225 Difference]: With dead ends: 516 [2021-10-13 01:02:01,256 INFO L226 Difference]: Without dead ends: 273 [2021-10-13 01:02:01,257 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:01,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-10-13 01:02:01,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2021-10-13 01:02:01,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 267 states have (on average 1.4269662921348314) internal successors, (381), 272 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:01,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 381 transitions. [2021-10-13 01:02:01,267 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 381 transitions. Word has length 85 [2021-10-13 01:02:01,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:01,267 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 381 transitions. [2021-10-13 01:02:01,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:01,268 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 381 transitions. [2021-10-13 01:02:01,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-10-13 01:02:01,269 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:01,269 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:01,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 01:02:01,269 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:01,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:01,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1722161102, now seen corresponding path program 1 times [2021-10-13 01:02:01,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:01,270 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095584839] [2021-10-13 01:02:01,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:01,271 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:01,333 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-10-13 01:02:01,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:01,334 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095584839] [2021-10-13 01:02:01,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095584839] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:01,334 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:01,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:02:01,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894640963] [2021-10-13 01:02:01,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:02:01,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:01,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:02:01,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:02:01,338 INFO L87 Difference]: Start difference. First operand 273 states and 381 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:01,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:01,368 INFO L93 Difference]: Finished difference Result 448 states and 642 transitions. [2021-10-13 01:02:01,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:02:01,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-10-13 01:02:01,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:01,370 INFO L225 Difference]: With dead ends: 448 [2021-10-13 01:02:01,371 INFO L226 Difference]: Without dead ends: 273 [2021-10-13 01:02:01,373 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:02:01,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-10-13 01:02:01,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2021-10-13 01:02:01,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 267 states have (on average 1.4194756554307115) internal successors, (379), 272 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:01,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 379 transitions. [2021-10-13 01:02:01,383 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 379 transitions. Word has length 88 [2021-10-13 01:02:01,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:01,384 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 379 transitions. [2021-10-13 01:02:01,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:01,384 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 379 transitions. [2021-10-13 01:02:01,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-10-13 01:02:01,385 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:01,385 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-10-13 01:02:01,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 01:02:01,386 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:01,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:01,386 INFO L82 PathProgramCache]: Analyzing trace with hash 621115599, now seen corresponding path program 1 times [2021-10-13 01:02:01,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:01,387 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573744170] [2021-10-13 01:02:01,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:01,387 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:01,451 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-13 01:02:01,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:01,452 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573744170] [2021-10-13 01:02:01,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573744170] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:01,452 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:01,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:01,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088684179] [2021-10-13 01:02:01,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:02:01,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:01,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:01,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:01,460 INFO L87 Difference]: Start difference. First operand 273 states and 379 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:01,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:01,488 INFO L93 Difference]: Finished difference Result 579 states and 841 transitions. [2021-10-13 01:02:01,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:01,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-10-13 01:02:01,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:01,491 INFO L225 Difference]: With dead ends: 579 [2021-10-13 01:02:01,492 INFO L226 Difference]: Without dead ends: 409 [2021-10-13 01:02:01,492 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:01,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2021-10-13 01:02:01,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 268. [2021-10-13 01:02:01,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 263 states have (on average 1.4106463878326996) internal successors, (371), 267 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:01,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 371 transitions. [2021-10-13 01:02:01,504 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 371 transitions. Word has length 101 [2021-10-13 01:02:01,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:01,504 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 371 transitions. [2021-10-13 01:02:01,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:01,505 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 371 transitions. [2021-10-13 01:02:01,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-10-13 01:02:01,506 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:01,506 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-10-13 01:02:01,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-13 01:02:01,507 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:01,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:01,508 INFO L82 PathProgramCache]: Analyzing trace with hash 2032967497, now seen corresponding path program 1 times [2021-10-13 01:02:01,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:01,508 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990323575] [2021-10-13 01:02:01,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:01,509 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:01,575 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-13 01:02:01,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:01,575 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990323575] [2021-10-13 01:02:01,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990323575] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:01,576 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:01,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:01,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130838204] [2021-10-13 01:02:01,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:02:01,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:01,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:01,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:01,578 INFO L87 Difference]: Start difference. First operand 268 states and 371 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:01,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:01,604 INFO L93 Difference]: Finished difference Result 559 states and 811 transitions. [2021-10-13 01:02:01,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:01,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-10-13 01:02:01,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:01,607 INFO L225 Difference]: With dead ends: 559 [2021-10-13 01:02:01,607 INFO L226 Difference]: Without dead ends: 394 [2021-10-13 01:02:01,608 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:01,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-10-13 01:02:01,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 264. [2021-10-13 01:02:01,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 260 states have (on average 1.4) internal successors, (364), 263 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:01,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 364 transitions. [2021-10-13 01:02:01,624 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 364 transitions. Word has length 106 [2021-10-13 01:02:01,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:01,625 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 364 transitions. [2021-10-13 01:02:01,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:01,625 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 364 transitions. [2021-10-13 01:02:01,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-10-13 01:02:01,629 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:01,629 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-10-13 01:02:01,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-13 01:02:01,630 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:01,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:01,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1082553381, now seen corresponding path program 1 times [2021-10-13 01:02:01,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:01,631 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311160938] [2021-10-13 01:02:01,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:01,631 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:01,687 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-13 01:02:01,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:01,688 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311160938] [2021-10-13 01:02:01,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311160938] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:01,688 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:01,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:01,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394519516] [2021-10-13 01:02:01,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:02:01,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:01,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:01,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:01,691 INFO L87 Difference]: Start difference. First operand 264 states and 364 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:01,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:01,711 INFO L93 Difference]: Finished difference Result 423 states and 603 transitions. [2021-10-13 01:02:01,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:01,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2021-10-13 01:02:01,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:01,714 INFO L225 Difference]: With dead ends: 423 [2021-10-13 01:02:01,714 INFO L226 Difference]: Without dead ends: 262 [2021-10-13 01:02:01,715 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:01,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-10-13 01:02:01,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2021-10-13 01:02:01,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 258 states have (on average 1.3875968992248062) internal successors, (358), 260 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:01,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 358 transitions. [2021-10-13 01:02:01,726 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 358 transitions. Word has length 112 [2021-10-13 01:02:01,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:01,726 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 358 transitions. [2021-10-13 01:02:01,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:01,727 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 358 transitions. [2021-10-13 01:02:01,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-10-13 01:02:01,728 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:01,728 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-10-13 01:02:01,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-13 01:02:01,729 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:01,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:01,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1802895144, now seen corresponding path program 1 times [2021-10-13 01:02:01,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:01,730 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901893140] [2021-10-13 01:02:01,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:01,730 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:01,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:01,812 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-13 01:02:01,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:01,813 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901893140] [2021-10-13 01:02:01,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901893140] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:01,813 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:01,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:01,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556027020] [2021-10-13 01:02:01,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:02:01,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:01,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:01,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:01,816 INFO L87 Difference]: Start difference. First operand 261 states and 358 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:01,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:01,828 INFO L93 Difference]: Finished difference Result 468 states and 665 transitions. [2021-10-13 01:02:01,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:01,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-10-13 01:02:01,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:01,830 INFO L225 Difference]: With dead ends: 468 [2021-10-13 01:02:01,831 INFO L226 Difference]: Without dead ends: 310 [2021-10-13 01:02:01,831 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:01,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-10-13 01:02:01,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 258. [2021-10-13 01:02:01,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 256 states have (on average 1.3828125) internal successors, (354), 257 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:01,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 354 transitions. [2021-10-13 01:02:01,847 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 354 transitions. Word has length 119 [2021-10-13 01:02:01,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:01,848 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 354 transitions. [2021-10-13 01:02:01,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:01,848 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 354 transitions. [2021-10-13 01:02:01,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-10-13 01:02:01,850 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:01,850 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-10-13 01:02:01,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-13 01:02:01,850 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:01,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:01,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1684200321, now seen corresponding path program 1 times [2021-10-13 01:02:01,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:01,851 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607782822] [2021-10-13 01:02:01,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:01,852 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:01,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:01,920 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-10-13 01:02:01,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:01,920 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607782822] [2021-10-13 01:02:01,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607782822] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:02:01,920 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854878783] [2021-10-13 01:02:01,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:01,921 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:02:01,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:02:01,926 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:02:01,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-13 01:02:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:02,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-13 01:02:02,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:02:02,396 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-10-13 01:02:02,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854878783] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:02:02,397 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 01:02:02,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-10-13 01:02:02,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20371409] [2021-10-13 01:02:02,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 01:02:02,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:02,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 01:02:02,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-13 01:02:02,402 INFO L87 Difference]: Start difference. First operand 258 states and 354 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:02,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:02,470 INFO L93 Difference]: Finished difference Result 538 states and 737 transitions. [2021-10-13 01:02:02,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 01:02:02,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2021-10-13 01:02:02,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:02,472 INFO L225 Difference]: With dead ends: 538 [2021-10-13 01:02:02,473 INFO L226 Difference]: Without dead ends: 299 [2021-10-13 01:02:02,473 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 11.1ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-13 01:02:02,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-10-13 01:02:02,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2021-10-13 01:02:02,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 297 states have (on average 1.3569023569023568) internal successors, (403), 298 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:02,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 403 transitions. [2021-10-13 01:02:02,486 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 403 transitions. Word has length 122 [2021-10-13 01:02:02,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:02,486 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 403 transitions. [2021-10-13 01:02:02,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:02,487 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 403 transitions. [2021-10-13 01:02:02,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-10-13 01:02:02,489 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:02,489 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2021-10-13 01:02:02,528 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-13 01:02:02,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:02:02,702 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:02,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:02,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1291870858, now seen corresponding path program 2 times [2021-10-13 01:02:02,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:02,703 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367026003] [2021-10-13 01:02:02,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:02,703 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:02,807 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:02:02,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:02,808 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367026003] [2021-10-13 01:02:02,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367026003] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:02,808 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:02,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:02:02,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990110239] [2021-10-13 01:02:02,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:02:02,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:02,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:02:02,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:02:02,810 INFO L87 Difference]: Start difference. First operand 299 states and 403 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:02,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:02,897 INFO L93 Difference]: Finished difference Result 636 states and 897 transitions. [2021-10-13 01:02:02,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 01:02:02,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2021-10-13 01:02:02,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:02,901 INFO L225 Difference]: With dead ends: 636 [2021-10-13 01:02:02,901 INFO L226 Difference]: Without dead ends: 481 [2021-10-13 01:02:02,902 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:02:02,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2021-10-13 01:02:02,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 385. [2021-10-13 01:02:02,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 383 states have (on average 1.370757180156658) internal successors, (525), 384 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:02,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 525 transitions. [2021-10-13 01:02:02,938 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 525 transitions. Word has length 159 [2021-10-13 01:02:02,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:02,939 INFO L470 AbstractCegarLoop]: Abstraction has 385 states and 525 transitions. [2021-10-13 01:02:02,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:02,939 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 525 transitions. [2021-10-13 01:02:02,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2021-10-13 01:02:02,941 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:02,942 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:02,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-13 01:02:02,942 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:02,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:02,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1937549472, now seen corresponding path program 1 times [2021-10-13 01:02:02,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:02,943 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339544331] [2021-10-13 01:02:02,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:02,943 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:03,023 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:02:03,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:03,024 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339544331] [2021-10-13 01:02:03,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339544331] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:03,024 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:03,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:03,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590931997] [2021-10-13 01:02:03,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:02:03,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:03,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:03,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:03,026 INFO L87 Difference]: Start difference. First operand 385 states and 525 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:03,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:03,070 INFO L93 Difference]: Finished difference Result 799 states and 1134 transitions. [2021-10-13 01:02:03,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:03,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 177 [2021-10-13 01:02:03,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:03,075 INFO L225 Difference]: With dead ends: 799 [2021-10-13 01:02:03,075 INFO L226 Difference]: Without dead ends: 599 [2021-10-13 01:02:03,075 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:03,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2021-10-13 01:02:03,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 459. [2021-10-13 01:02:03,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 457 states have (on average 1.37417943107221) internal successors, (628), 458 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:03,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 628 transitions. [2021-10-13 01:02:03,106 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 628 transitions. Word has length 177 [2021-10-13 01:02:03,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:03,107 INFO L470 AbstractCegarLoop]: Abstraction has 459 states and 628 transitions. [2021-10-13 01:02:03,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:03,107 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 628 transitions. [2021-10-13 01:02:03,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-10-13 01:02:03,109 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:03,110 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:03,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-13 01:02:03,110 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:03,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:03,111 INFO L82 PathProgramCache]: Analyzing trace with hash -251982915, now seen corresponding path program 1 times [2021-10-13 01:02:03,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:03,111 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636395972] [2021-10-13 01:02:03,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:03,112 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:03,181 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:02:03,181 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:03,181 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636395972] [2021-10-13 01:02:03,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636395972] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:03,182 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:03,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:03,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444373519] [2021-10-13 01:02:03,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:02:03,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:03,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:03,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:03,183 INFO L87 Difference]: Start difference. First operand 459 states and 628 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:03,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:03,228 INFO L93 Difference]: Finished difference Result 955 states and 1354 transitions. [2021-10-13 01:02:03,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:03,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 178 [2021-10-13 01:02:03,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:03,233 INFO L225 Difference]: With dead ends: 955 [2021-10-13 01:02:03,233 INFO L226 Difference]: Without dead ends: 710 [2021-10-13 01:02:03,234 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:03,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2021-10-13 01:02:03,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 557. [2021-10-13 01:02:03,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 555 states have (on average 1.38018018018018) internal successors, (766), 556 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:03,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 766 transitions. [2021-10-13 01:02:03,267 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 766 transitions. Word has length 178 [2021-10-13 01:02:03,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:03,267 INFO L470 AbstractCegarLoop]: Abstraction has 557 states and 766 transitions. [2021-10-13 01:02:03,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:03,268 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 766 transitions. [2021-10-13 01:02:03,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-10-13 01:02:03,270 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:03,270 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:03,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-13 01:02:03,271 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:03,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:03,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1139374053, now seen corresponding path program 1 times [2021-10-13 01:02:03,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:03,271 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984208677] [2021-10-13 01:02:03,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:03,272 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:03,337 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:02:03,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:03,338 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984208677] [2021-10-13 01:02:03,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984208677] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:03,338 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:03,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:03,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975409223] [2021-10-13 01:02:03,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:02:03,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:03,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:03,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:03,340 INFO L87 Difference]: Start difference. First operand 557 states and 766 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:03,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:03,391 INFO L93 Difference]: Finished difference Result 1135 states and 1616 transitions. [2021-10-13 01:02:03,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:03,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 179 [2021-10-13 01:02:03,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:03,397 INFO L225 Difference]: With dead ends: 1135 [2021-10-13 01:02:03,397 INFO L226 Difference]: Without dead ends: 824 [2021-10-13 01:02:03,398 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:03,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2021-10-13 01:02:03,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 643. [2021-10-13 01:02:03,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 641 states have (on average 1.3946957878315132) internal successors, (894), 642 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:03,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 894 transitions. [2021-10-13 01:02:03,454 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 894 transitions. Word has length 179 [2021-10-13 01:02:03,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:03,454 INFO L470 AbstractCegarLoop]: Abstraction has 643 states and 894 transitions. [2021-10-13 01:02:03,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:03,454 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 894 transitions. [2021-10-13 01:02:03,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-10-13 01:02:03,456 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:03,457 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:03,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-13 01:02:03,457 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:03,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:03,458 INFO L82 PathProgramCache]: Analyzing trace with hash -920519335, now seen corresponding path program 1 times [2021-10-13 01:02:03,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:03,458 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501676178] [2021-10-13 01:02:03,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:03,458 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:03,543 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:02:03,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:03,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501676178] [2021-10-13 01:02:03,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501676178] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:03,543 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:03,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 01:02:03,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628227249] [2021-10-13 01:02:03,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 01:02:03,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:03,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 01:02:03,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:02:03,545 INFO L87 Difference]: Start difference. First operand 643 states and 894 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:03,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:03,690 INFO L93 Difference]: Finished difference Result 1287 states and 1778 transitions. [2021-10-13 01:02:03,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 01:02:03,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 179 [2021-10-13 01:02:03,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:03,695 INFO L225 Difference]: With dead ends: 1287 [2021-10-13 01:02:03,695 INFO L226 Difference]: Without dead ends: 898 [2021-10-13 01:02:03,696 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 29.7ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-13 01:02:03,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2021-10-13 01:02:03,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 643. [2021-10-13 01:02:03,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 641 states have (on average 1.3806552262090483) internal successors, (885), 642 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:03,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 885 transitions. [2021-10-13 01:02:03,737 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 885 transitions. Word has length 179 [2021-10-13 01:02:03,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:03,738 INFO L470 AbstractCegarLoop]: Abstraction has 643 states and 885 transitions. [2021-10-13 01:02:03,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:03,738 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 885 transitions. [2021-10-13 01:02:03,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-10-13 01:02:03,740 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:03,740 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:03,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-13 01:02:03,741 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:03,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:03,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1340858399, now seen corresponding path program 1 times [2021-10-13 01:02:03,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:03,741 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374185355] [2021-10-13 01:02:03,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:03,742 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:03,817 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:02:03,818 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:03,818 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374185355] [2021-10-13 01:02:03,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374185355] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:03,818 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:03,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 01:02:03,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118447759] [2021-10-13 01:02:03,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 01:02:03,819 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:03,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 01:02:03,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:02:03,820 INFO L87 Difference]: Start difference. First operand 643 states and 885 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:03,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:03,969 INFO L93 Difference]: Finished difference Result 1519 states and 2130 transitions. [2021-10-13 01:02:03,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 01:02:03,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 180 [2021-10-13 01:02:03,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:03,976 INFO L225 Difference]: With dead ends: 1519 [2021-10-13 01:02:03,976 INFO L226 Difference]: Without dead ends: 1130 [2021-10-13 01:02:03,977 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 21.0ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-13 01:02:03,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2021-10-13 01:02:04,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 643. [2021-10-13 01:02:04,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 641 states have (on average 1.3790951638065523) internal successors, (884), 642 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:04,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 884 transitions. [2021-10-13 01:02:04,022 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 884 transitions. Word has length 180 [2021-10-13 01:02:04,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:04,023 INFO L470 AbstractCegarLoop]: Abstraction has 643 states and 884 transitions. [2021-10-13 01:02:04,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:04,023 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 884 transitions. [2021-10-13 01:02:04,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2021-10-13 01:02:04,025 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:04,025 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:04,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-13 01:02:04,026 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:04,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:04,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1177602269, now seen corresponding path program 1 times [2021-10-13 01:02:04,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:04,026 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192410107] [2021-10-13 01:02:04,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:04,027 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:04,163 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:02:04,163 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:04,163 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192410107] [2021-10-13 01:02:04,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192410107] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:04,163 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:04,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 01:02:04,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81316878] [2021-10-13 01:02:04,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 01:02:04,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:04,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 01:02:04,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 01:02:04,165 INFO L87 Difference]: Start difference. First operand 643 states and 884 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:04,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:04,318 INFO L93 Difference]: Finished difference Result 1058 states and 1477 transitions. [2021-10-13 01:02:04,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 01:02:04,318 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 181 [2021-10-13 01:02:04,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:04,324 INFO L225 Difference]: With dead ends: 1058 [2021-10-13 01:02:04,324 INFO L226 Difference]: Without dead ends: 1056 [2021-10-13 01:02:04,325 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 50.3ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-10-13 01:02:04,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2021-10-13 01:02:04,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 645. [2021-10-13 01:02:04,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 643 states have (on average 1.3779160186625194) internal successors, (886), 644 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:04,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 886 transitions. [2021-10-13 01:02:04,379 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 886 transitions. Word has length 181 [2021-10-13 01:02:04,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:04,380 INFO L470 AbstractCegarLoop]: Abstraction has 645 states and 886 transitions. [2021-10-13 01:02:04,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:04,380 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 886 transitions. [2021-10-13 01:02:04,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-10-13 01:02:04,382 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:04,383 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:04,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-13 01:02:04,383 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:04,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:04,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1249235817, now seen corresponding path program 1 times [2021-10-13 01:02:04,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:04,385 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173552757] [2021-10-13 01:02:04,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:04,385 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:04,553 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-10-13 01:02:04,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:04,553 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173552757] [2021-10-13 01:02:04,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173552757] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:02:04,554 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782791716] [2021-10-13 01:02:04,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:04,554 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:02:04,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:02:04,555 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:02:04,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-13 01:02:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:04,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-13 01:02:04,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:02:05,372 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-10-13 01:02:05,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782791716] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:02:05,372 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 01:02:05,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-10-13 01:02:05,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61641977] [2021-10-13 01:02:05,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-13 01:02:05,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:05,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-13 01:02:05,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-13 01:02:05,375 INFO L87 Difference]: Start difference. First operand 645 states and 886 transitions. Second operand has 11 states, 11 states have (on average 11.090909090909092) internal successors, (122), 11 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:06,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:06,157 INFO L93 Difference]: Finished difference Result 3897 states and 5558 transitions. [2021-10-13 01:02:06,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-13 01:02:06,158 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.090909090909092) internal successors, (122), 11 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-10-13 01:02:06,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:06,178 INFO L225 Difference]: With dead ends: 3897 [2021-10-13 01:02:06,178 INFO L226 Difference]: Without dead ends: 3506 [2021-10-13 01:02:06,180 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 222.2ms TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2021-10-13 01:02:06,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2021-10-13 01:02:06,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 871. [2021-10-13 01:02:06,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 869 states have (on average 1.3532796317606444) internal successors, (1176), 870 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:06,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1176 transitions. [2021-10-13 01:02:06,292 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1176 transitions. Word has length 184 [2021-10-13 01:02:06,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:06,293 INFO L470 AbstractCegarLoop]: Abstraction has 871 states and 1176 transitions. [2021-10-13 01:02:06,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.090909090909092) internal successors, (122), 11 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:06,293 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1176 transitions. [2021-10-13 01:02:06,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-10-13 01:02:06,297 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:06,297 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:06,335 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-13 01:02:06,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-10-13 01:02:06,520 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:06,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:06,520 INFO L82 PathProgramCache]: Analyzing trace with hash -30627861, now seen corresponding path program 1 times [2021-10-13 01:02:06,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:06,520 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408934816] [2021-10-13 01:02:06,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:06,521 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:06,597 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:02:06,598 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:06,598 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408934816] [2021-10-13 01:02:06,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408934816] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:06,598 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:06,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:06,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199303012] [2021-10-13 01:02:06,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:02:06,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:06,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:06,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:06,600 INFO L87 Difference]: Start difference. First operand 871 states and 1176 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:06,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:06,761 INFO L93 Difference]: Finished difference Result 1949 states and 2675 transitions. [2021-10-13 01:02:06,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:06,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-10-13 01:02:06,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:06,770 INFO L225 Difference]: With dead ends: 1949 [2021-10-13 01:02:06,771 INFO L226 Difference]: Without dead ends: 1558 [2021-10-13 01:02:06,773 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:06,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2021-10-13 01:02:06,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 871. [2021-10-13 01:02:06,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 869 states have (on average 1.3509781357882624) internal successors, (1174), 870 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:06,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1174 transitions. [2021-10-13 01:02:06,849 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1174 transitions. Word has length 184 [2021-10-13 01:02:06,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:06,850 INFO L470 AbstractCegarLoop]: Abstraction has 871 states and 1174 transitions. [2021-10-13 01:02:06,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:06,850 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1174 transitions. [2021-10-13 01:02:06,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-10-13 01:02:06,853 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:06,853 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:06,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-13 01:02:06,854 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:06,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:06,855 INFO L82 PathProgramCache]: Analyzing trace with hash -489339443, now seen corresponding path program 1 times [2021-10-13 01:02:06,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:06,855 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227216694] [2021-10-13 01:02:06,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:06,856 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:06,906 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2021-10-13 01:02:06,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:06,906 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227216694] [2021-10-13 01:02:06,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227216694] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:06,907 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:06,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:06,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998715361] [2021-10-13 01:02:06,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:02:06,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:06,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:06,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:06,935 INFO L87 Difference]: Start difference. First operand 871 states and 1174 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:07,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:07,024 INFO L93 Difference]: Finished difference Result 1463 states and 1989 transitions. [2021-10-13 01:02:07,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:07,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 187 [2021-10-13 01:02:07,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:07,030 INFO L225 Difference]: With dead ends: 1463 [2021-10-13 01:02:07,030 INFO L226 Difference]: Without dead ends: 713 [2021-10-13 01:02:07,032 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:07,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2021-10-13 01:02:07,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 712. [2021-10-13 01:02:07,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 710 states have (on average 1.3253521126760563) internal successors, (941), 711 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:07,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 941 transitions. [2021-10-13 01:02:07,096 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 941 transitions. Word has length 187 [2021-10-13 01:02:07,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:07,097 INFO L470 AbstractCegarLoop]: Abstraction has 712 states and 941 transitions. [2021-10-13 01:02:07,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:07,098 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 941 transitions. [2021-10-13 01:02:07,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-10-13 01:02:07,100 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:07,101 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:07,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-13 01:02:07,101 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:07,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:07,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1612175983, now seen corresponding path program 1 times [2021-10-13 01:02:07,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:07,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776871970] [2021-10-13 01:02:07,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:07,102 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:07,262 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:02:07,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:07,263 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776871970] [2021-10-13 01:02:07,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776871970] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:07,263 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:07,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 01:02:07,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707591738] [2021-10-13 01:02:07,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 01:02:07,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:07,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 01:02:07,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 01:02:07,265 INFO L87 Difference]: Start difference. First operand 712 states and 941 transitions. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:07,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:07,581 INFO L93 Difference]: Finished difference Result 1529 states and 2049 transitions. [2021-10-13 01:02:07,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 01:02:07,582 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 192 [2021-10-13 01:02:07,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:07,589 INFO L225 Difference]: With dead ends: 1529 [2021-10-13 01:02:07,589 INFO L226 Difference]: Without dead ends: 1149 [2021-10-13 01:02:07,590 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 92.2ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-13 01:02:07,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2021-10-13 01:02:07,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 827. [2021-10-13 01:02:07,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 825 states have (on average 1.3163636363636364) internal successors, (1086), 826 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:07,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1086 transitions. [2021-10-13 01:02:07,682 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1086 transitions. Word has length 192 [2021-10-13 01:02:07,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:07,683 INFO L470 AbstractCegarLoop]: Abstraction has 827 states and 1086 transitions. [2021-10-13 01:02:07,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:07,683 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1086 transitions. [2021-10-13 01:02:07,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2021-10-13 01:02:07,686 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:07,686 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:07,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-13 01:02:07,687 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:07,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:07,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1609314537, now seen corresponding path program 1 times [2021-10-13 01:02:07,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:07,688 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987624488] [2021-10-13 01:02:07,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:07,689 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:07,797 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:02:07,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:07,797 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987624488] [2021-10-13 01:02:07,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987624488] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:07,798 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:07,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 01:02:07,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460948880] [2021-10-13 01:02:07,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 01:02:07,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:07,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 01:02:07,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-13 01:02:07,801 INFO L87 Difference]: Start difference. First operand 827 states and 1086 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:08,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:08,049 INFO L93 Difference]: Finished difference Result 2702 states and 3678 transitions. [2021-10-13 01:02:08,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 01:02:08,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 198 [2021-10-13 01:02:08,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:08,075 INFO L225 Difference]: With dead ends: 2702 [2021-10-13 01:02:08,082 INFO L226 Difference]: Without dead ends: 2201 [2021-10-13 01:02:08,084 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-13 01:02:08,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2201 states. [2021-10-13 01:02:08,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2201 to 904. [2021-10-13 01:02:08,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 902 states have (on average 1.312638580931264) internal successors, (1184), 903 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:08,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1184 transitions. [2021-10-13 01:02:08,187 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1184 transitions. Word has length 198 [2021-10-13 01:02:08,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:08,188 INFO L470 AbstractCegarLoop]: Abstraction has 904 states and 1184 transitions. [2021-10-13 01:02:08,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:08,189 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1184 transitions. [2021-10-13 01:02:08,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2021-10-13 01:02:08,191 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:08,192 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:08,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-13 01:02:08,192 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:08,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:08,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1927329879, now seen corresponding path program 1 times [2021-10-13 01:02:08,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:08,193 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719009994] [2021-10-13 01:02:08,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:08,193 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:08,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:08,351 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:02:08,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:08,351 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719009994] [2021-10-13 01:02:08,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719009994] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:08,352 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:08,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 01:02:08,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409358865] [2021-10-13 01:02:08,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 01:02:08,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:08,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 01:02:08,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 01:02:08,355 INFO L87 Difference]: Start difference. First operand 904 states and 1184 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:08,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:08,873 INFO L93 Difference]: Finished difference Result 2175 states and 2872 transitions. [2021-10-13 01:02:08,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 01:02:08,873 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 198 [2021-10-13 01:02:08,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:08,878 INFO L225 Difference]: With dead ends: 2175 [2021-10-13 01:02:08,878 INFO L226 Difference]: Without dead ends: 1600 [2021-10-13 01:02:08,880 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 114.4ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-10-13 01:02:08,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2021-10-13 01:02:08,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 966. [2021-10-13 01:02:08,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 964 states have (on average 1.3008298755186722) internal successors, (1254), 965 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:08,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1254 transitions. [2021-10-13 01:02:08,988 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1254 transitions. Word has length 198 [2021-10-13 01:02:08,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:08,989 INFO L470 AbstractCegarLoop]: Abstraction has 966 states and 1254 transitions. [2021-10-13 01:02:08,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:08,989 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1254 transitions. [2021-10-13 01:02:08,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2021-10-13 01:02:08,992 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:08,992 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:08,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-13 01:02:09,018 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:09,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:09,019 INFO L82 PathProgramCache]: Analyzing trace with hash 645504485, now seen corresponding path program 1 times [2021-10-13 01:02:09,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:09,019 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655777525] [2021-10-13 01:02:09,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:09,019 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:09,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:09,204 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:02:09,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:09,204 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655777525] [2021-10-13 01:02:09,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655777525] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:09,205 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:09,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 01:02:09,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693802008] [2021-10-13 01:02:09,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 01:02:09,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:09,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 01:02:09,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 01:02:09,207 INFO L87 Difference]: Start difference. First operand 966 states and 1254 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:09,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:09,661 INFO L93 Difference]: Finished difference Result 2008 states and 2642 transitions. [2021-10-13 01:02:09,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 01:02:09,662 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 198 [2021-10-13 01:02:09,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:09,665 INFO L225 Difference]: With dead ends: 2008 [2021-10-13 01:02:09,665 INFO L226 Difference]: Without dead ends: 1366 [2021-10-13 01:02:09,667 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 102.5ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-10-13 01:02:09,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2021-10-13 01:02:09,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 933. [2021-10-13 01:02:09,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 931 states have (on average 1.3029001074113855) internal successors, (1213), 932 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:09,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1213 transitions. [2021-10-13 01:02:09,763 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1213 transitions. Word has length 198 [2021-10-13 01:02:09,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:09,764 INFO L470 AbstractCegarLoop]: Abstraction has 933 states and 1213 transitions. [2021-10-13 01:02:09,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:09,764 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1213 transitions. [2021-10-13 01:02:09,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2021-10-13 01:02:09,767 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:09,768 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:09,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-13 01:02:09,768 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:09,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:09,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1197921535, now seen corresponding path program 1 times [2021-10-13 01:02:09,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:09,769 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998531793] [2021-10-13 01:02:09,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:09,770 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:09,839 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2021-10-13 01:02:09,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:09,839 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998531793] [2021-10-13 01:02:09,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998531793] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:09,840 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:09,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:02:09,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269045846] [2021-10-13 01:02:09,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:02:09,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:09,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:02:09,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:02:09,842 INFO L87 Difference]: Start difference. First operand 933 states and 1213 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:10,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:10,077 INFO L93 Difference]: Finished difference Result 1691 states and 2224 transitions. [2021-10-13 01:02:10,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 01:02:10,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 207 [2021-10-13 01:02:10,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:10,081 INFO L225 Difference]: With dead ends: 1691 [2021-10-13 01:02:10,081 INFO L226 Difference]: Without dead ends: 1090 [2021-10-13 01:02:10,082 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:02:10,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2021-10-13 01:02:10,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 833. [2021-10-13 01:02:10,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 832 states have (on average 1.28125) internal successors, (1066), 832 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:10,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1066 transitions. [2021-10-13 01:02:10,167 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1066 transitions. Word has length 207 [2021-10-13 01:02:10,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:10,167 INFO L470 AbstractCegarLoop]: Abstraction has 833 states and 1066 transitions. [2021-10-13 01:02:10,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:10,168 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1066 transitions. [2021-10-13 01:02:10,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2021-10-13 01:02:10,172 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:10,172 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:10,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-13 01:02:10,173 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:10,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:10,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1187317822, now seen corresponding path program 1 times [2021-10-13 01:02:10,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:10,174 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382751848] [2021-10-13 01:02:10,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:10,174 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:10,415 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 42 proven. 9 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2021-10-13 01:02:10,415 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:10,415 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382751848] [2021-10-13 01:02:10,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382751848] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:02:10,416 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74506059] [2021-10-13 01:02:10,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:10,416 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:02:10,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:02:10,417 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:02:10,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-13 01:02:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:10,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 954 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-13 01:02:10,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:02:11,446 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2021-10-13 01:02:11,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74506059] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:11,447 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-13 01:02:11,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2021-10-13 01:02:11,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631703214] [2021-10-13 01:02:11,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 01:02:11,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:11,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 01:02:11,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-10-13 01:02:11,449 INFO L87 Difference]: Start difference. First operand 833 states and 1066 transitions. Second operand has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:11,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:11,914 INFO L93 Difference]: Finished difference Result 2343 states and 3029 transitions. [2021-10-13 01:02:11,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-13 01:02:11,915 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232 [2021-10-13 01:02:11,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:11,919 INFO L225 Difference]: With dead ends: 2343 [2021-10-13 01:02:11,919 INFO L226 Difference]: Without dead ends: 1842 [2021-10-13 01:02:11,921 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 193.5ms TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2021-10-13 01:02:11,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2021-10-13 01:02:12,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 869. [2021-10-13 01:02:12,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 1.2799539170506913) internal successors, (1111), 868 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:12,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1111 transitions. [2021-10-13 01:02:12,025 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1111 transitions. Word has length 232 [2021-10-13 01:02:12,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:12,026 INFO L470 AbstractCegarLoop]: Abstraction has 869 states and 1111 transitions. [2021-10-13 01:02:12,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:12,026 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1111 transitions. [2021-10-13 01:02:12,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2021-10-13 01:02:12,029 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:12,029 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:12,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-13 01:02:12,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-10-13 01:02:12,254 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:12,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:12,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1244576124, now seen corresponding path program 1 times [2021-10-13 01:02:12,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:12,254 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094141648] [2021-10-13 01:02:12,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:12,255 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:12,330 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2021-10-13 01:02:12,330 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:12,330 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094141648] [2021-10-13 01:02:12,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094141648] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:12,331 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:12,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:12,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065767921] [2021-10-13 01:02:12,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:02:12,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:12,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:12,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:12,333 INFO L87 Difference]: Start difference. First operand 869 states and 1111 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:12,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:12,478 INFO L93 Difference]: Finished difference Result 1689 states and 2151 transitions. [2021-10-13 01:02:12,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:12,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232 [2021-10-13 01:02:12,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:12,481 INFO L225 Difference]: With dead ends: 1689 [2021-10-13 01:02:12,481 INFO L226 Difference]: Without dead ends: 1115 [2021-10-13 01:02:12,482 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:12,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2021-10-13 01:02:12,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 863. [2021-10-13 01:02:12,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 862 states have (on average 1.2552204176334107) internal successors, (1082), 862 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:12,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1082 transitions. [2021-10-13 01:02:12,567 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1082 transitions. Word has length 232 [2021-10-13 01:02:12,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:12,567 INFO L470 AbstractCegarLoop]: Abstraction has 863 states and 1082 transitions. [2021-10-13 01:02:12,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:12,568 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1082 transitions. [2021-10-13 01:02:12,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2021-10-13 01:02:12,570 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:12,571 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-10-13 01:02:12,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-13 01:02:12,571 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:12,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:12,572 INFO L82 PathProgramCache]: Analyzing trace with hash -836297208, now seen corresponding path program 1 times [2021-10-13 01:02:12,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:12,572 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114895838] [2021-10-13 01:02:12,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:12,572 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:12,749 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:02:12,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:12,749 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114895838] [2021-10-13 01:02:12,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114895838] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:02:12,749 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051657746] [2021-10-13 01:02:12,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:12,750 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:02:12,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:02:12,751 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:02:12,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-13 01:02:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:13,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-13 01:02:13,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:02:13,731 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:02:13,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051657746] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:02:13,732 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 01:02:13,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2021-10-13 01:02:13,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016066712] [2021-10-13 01:02:13,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 01:02:13,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:13,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 01:02:13,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-13 01:02:13,734 INFO L87 Difference]: Start difference. First operand 863 states and 1082 transitions. Second operand has 9 states, 9 states have (on average 20.666666666666668) internal successors, (186), 9 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:14,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:14,766 INFO L93 Difference]: Finished difference Result 3434 states and 4393 transitions. [2021-10-13 01:02:14,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-10-13 01:02:14,767 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 20.666666666666668) internal successors, (186), 9 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 238 [2021-10-13 01:02:14,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:14,773 INFO L225 Difference]: With dead ends: 3434 [2021-10-13 01:02:14,774 INFO L226 Difference]: Without dead ends: 2903 [2021-10-13 01:02:14,776 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 237 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 433.0ms TimeCoverageRelationStatistics Valid=384, Invalid=1338, Unknown=0, NotChecked=0, Total=1722 [2021-10-13 01:02:14,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2021-10-13 01:02:14,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 1429. [2021-10-13 01:02:14,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1429 states, 1428 states have (on average 1.2584033613445378) internal successors, (1797), 1428 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:14,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 1797 transitions. [2021-10-13 01:02:14,989 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 1797 transitions. Word has length 238 [2021-10-13 01:02:14,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:14,989 INFO L470 AbstractCegarLoop]: Abstraction has 1429 states and 1797 transitions. [2021-10-13 01:02:14,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.666666666666668) internal successors, (186), 9 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:14,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 1797 transitions. [2021-10-13 01:02:14,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2021-10-13 01:02:14,993 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:14,994 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:15,033 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-13 01:02:15,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:02:15,210 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:15,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:15,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1012261644, now seen corresponding path program 1 times [2021-10-13 01:02:15,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:15,211 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559669064] [2021-10-13 01:02:15,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:15,211 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:15,420 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 8 proven. 34 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:02:15,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:15,421 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559669064] [2021-10-13 01:02:15,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559669064] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:02:15,422 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446189257] [2021-10-13 01:02:15,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:15,423 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:02:15,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:02:15,426 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:02:15,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-10-13 01:02:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:15,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-13 01:02:15,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:02:16,605 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 8 proven. 34 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:02:16,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446189257] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:02:16,606 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 01:02:16,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2021-10-13 01:02:16,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294947221] [2021-10-13 01:02:16,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 01:02:16,608 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:16,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 01:02:16,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-13 01:02:16,609 INFO L87 Difference]: Start difference. First operand 1429 states and 1797 transitions. Second operand has 9 states, 9 states have (on average 20.11111111111111) internal successors, (181), 9 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:17,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:17,843 INFO L93 Difference]: Finished difference Result 7331 states and 9345 transitions. [2021-10-13 01:02:17,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-10-13 01:02:17,844 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 20.11111111111111) internal successors, (181), 9 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 238 [2021-10-13 01:02:17,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:17,857 INFO L225 Difference]: With dead ends: 7331 [2021-10-13 01:02:17,858 INFO L226 Difference]: Without dead ends: 6277 [2021-10-13 01:02:17,861 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 245 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 390.2ms TimeCoverageRelationStatistics Valid=340, Invalid=1382, Unknown=0, NotChecked=0, Total=1722 [2021-10-13 01:02:17,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6277 states. [2021-10-13 01:02:18,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6277 to 3475. [2021-10-13 01:02:18,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3475 states, 3474 states have (on average 1.2377662636729994) internal successors, (4300), 3474 states have internal predecessors, (4300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:18,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3475 states to 3475 states and 4300 transitions. [2021-10-13 01:02:18,308 INFO L78 Accepts]: Start accepts. Automaton has 3475 states and 4300 transitions. Word has length 238 [2021-10-13 01:02:18,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:18,309 INFO L470 AbstractCegarLoop]: Abstraction has 3475 states and 4300 transitions. [2021-10-13 01:02:18,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.11111111111111) internal successors, (181), 9 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:18,310 INFO L276 IsEmpty]: Start isEmpty. Operand 3475 states and 4300 transitions. [2021-10-13 01:02:18,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-10-13 01:02:18,317 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:18,317 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:18,357 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-10-13 01:02:18,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-10-13 01:02:18,538 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:18,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:18,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1132569626, now seen corresponding path program 1 times [2021-10-13 01:02:18,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:18,539 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310744703] [2021-10-13 01:02:18,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:18,539 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:18,885 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:02:18,885 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:18,886 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310744703] [2021-10-13 01:02:18,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310744703] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:02:18,886 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420746092] [2021-10-13 01:02:18,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:18,886 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:02:18,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:02:18,890 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:02:18,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-10-13 01:02:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:19,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 992 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-13 01:02:19,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:02:19,861 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-10-13 01:02:19,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420746092] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:19,861 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-13 01:02:19,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [20] total 23 [2021-10-13 01:02:19,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600370094] [2021-10-13 01:02:19,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:02:19,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:19,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:02:19,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2021-10-13 01:02:19,864 INFO L87 Difference]: Start difference. First operand 3475 states and 4300 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:20,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:20,321 INFO L93 Difference]: Finished difference Result 6552 states and 8126 transitions. [2021-10-13 01:02:20,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:02:20,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 239 [2021-10-13 01:02:20,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:20,329 INFO L225 Difference]: With dead ends: 6552 [2021-10-13 01:02:20,329 INFO L226 Difference]: Without dead ends: 3365 [2021-10-13 01:02:20,333 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 196.1ms TimeCoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2021-10-13 01:02:20,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3365 states. [2021-10-13 01:02:20,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3365 to 3365. [2021-10-13 01:02:20,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3365 states, 3364 states have (on average 1.2271105826397146) internal successors, (4128), 3364 states have internal predecessors, (4128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:20,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3365 states to 3365 states and 4128 transitions. [2021-10-13 01:02:20,719 INFO L78 Accepts]: Start accepts. Automaton has 3365 states and 4128 transitions. Word has length 239 [2021-10-13 01:02:20,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:20,720 INFO L470 AbstractCegarLoop]: Abstraction has 3365 states and 4128 transitions. [2021-10-13 01:02:20,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:20,720 INFO L276 IsEmpty]: Start isEmpty. Operand 3365 states and 4128 transitions. [2021-10-13 01:02:20,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2021-10-13 01:02:20,727 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:20,727 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:20,774 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-10-13 01:02:20,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-10-13 01:02:20,954 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:20,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:20,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1180183742, now seen corresponding path program 1 times [2021-10-13 01:02:20,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:20,954 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671667417] [2021-10-13 01:02:20,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:20,955 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:21,299 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 2 proven. 41 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:02:21,299 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:21,299 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671667417] [2021-10-13 01:02:21,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671667417] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:02:21,300 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443513563] [2021-10-13 01:02:21,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:21,300 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:02:21,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:02:21,301 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:02:21,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-10-13 01:02:21,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:21,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 1010 conjuncts, 24 conjunts are in the unsatisfiable core [2021-10-13 01:02:21,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:02:22,776 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 35 proven. 13 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2021-10-13 01:02:22,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443513563] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:02:22,777 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 01:02:22,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 28 [2021-10-13 01:02:22,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310468252] [2021-10-13 01:02:22,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-10-13 01:02:22,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:22,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-10-13 01:02:22,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2021-10-13 01:02:22,779 INFO L87 Difference]: Start difference. First operand 3365 states and 4128 transitions. Second operand has 28 states, 28 states have (on average 11.571428571428571) internal successors, (324), 28 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:30,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:30,682 INFO L93 Difference]: Finished difference Result 23508 states and 29620 transitions. [2021-10-13 01:02:30,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2021-10-13 01:02:30,683 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 11.571428571428571) internal successors, (324), 28 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 240 [2021-10-13 01:02:30,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:30,726 INFO L225 Difference]: With dead ends: 23508 [2021-10-13 01:02:30,726 INFO L226 Difference]: Without dead ends: 20570 [2021-10-13 01:02:30,740 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8441 ImplicationChecksByTransitivity, 3290.1ms TimeCoverageRelationStatistics Valid=2584, Invalid=23498, Unknown=0, NotChecked=0, Total=26082 [2021-10-13 01:02:30,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20570 states. [2021-10-13 01:02:31,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20570 to 5159. [2021-10-13 01:02:31,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5159 states, 5158 states have (on average 1.2194649088794107) internal successors, (6290), 5158 states have internal predecessors, (6290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:31,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5159 states to 5159 states and 6290 transitions. [2021-10-13 01:02:31,583 INFO L78 Accepts]: Start accepts. Automaton has 5159 states and 6290 transitions. Word has length 240 [2021-10-13 01:02:31,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:31,583 INFO L470 AbstractCegarLoop]: Abstraction has 5159 states and 6290 transitions. [2021-10-13 01:02:31,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.571428571428571) internal successors, (324), 28 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:31,584 INFO L276 IsEmpty]: Start isEmpty. Operand 5159 states and 6290 transitions. [2021-10-13 01:02:31,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2021-10-13 01:02:31,593 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:31,594 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-10-13 01:02:31,629 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-10-13 01:02:31,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2021-10-13 01:02:31,822 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:31,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:31,822 INFO L82 PathProgramCache]: Analyzing trace with hash -365509161, now seen corresponding path program 1 times [2021-10-13 01:02:31,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:31,822 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606354371] [2021-10-13 01:02:31,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:31,823 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:31,873 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2021-10-13 01:02:31,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:31,874 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606354371] [2021-10-13 01:02:31,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606354371] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:31,874 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:31,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:31,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560945066] [2021-10-13 01:02:31,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:02:31,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:31,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:31,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:31,876 INFO L87 Difference]: Start difference. First operand 5159 states and 6290 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:32,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:32,394 INFO L93 Difference]: Finished difference Result 9887 states and 12052 transitions. [2021-10-13 01:02:32,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:32,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 243 [2021-10-13 01:02:32,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:32,403 INFO L225 Difference]: With dead ends: 9887 [2021-10-13 01:02:32,404 INFO L226 Difference]: Without dead ends: 4741 [2021-10-13 01:02:32,409 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:32,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4741 states. [2021-10-13 01:02:33,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4741 to 4741. [2021-10-13 01:02:33,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4741 states, 4740 states have (on average 1.2168776371308017) internal successors, (5768), 4740 states have internal predecessors, (5768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:33,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4741 states to 4741 states and 5768 transitions. [2021-10-13 01:02:33,101 INFO L78 Accepts]: Start accepts. Automaton has 4741 states and 5768 transitions. Word has length 243 [2021-10-13 01:02:33,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:33,102 INFO L470 AbstractCegarLoop]: Abstraction has 4741 states and 5768 transitions. [2021-10-13 01:02:33,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:33,102 INFO L276 IsEmpty]: Start isEmpty. Operand 4741 states and 5768 transitions. [2021-10-13 01:02:33,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2021-10-13 01:02:33,111 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:33,112 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-10-13 01:02:33,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-10-13 01:02:33,112 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:33,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:33,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1487829042, now seen corresponding path program 1 times [2021-10-13 01:02:33,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:33,113 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597584546] [2021-10-13 01:02:33,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:33,114 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:33,203 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2021-10-13 01:02:33,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:33,204 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597584546] [2021-10-13 01:02:33,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597584546] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:33,204 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:33,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:02:33,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844445513] [2021-10-13 01:02:33,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 01:02:33,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:33,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 01:02:33,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:02:33,206 INFO L87 Difference]: Start difference. First operand 4741 states and 5768 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:33,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:33,730 INFO L93 Difference]: Finished difference Result 8885 states and 10825 transitions. [2021-10-13 01:02:33,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 01:02:33,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 246 [2021-10-13 01:02:33,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:33,739 INFO L225 Difference]: With dead ends: 8885 [2021-10-13 01:02:33,739 INFO L226 Difference]: Without dead ends: 4769 [2021-10-13 01:02:33,744 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 14.6ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-13 01:02:33,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4769 states. [2021-10-13 01:02:34,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4769 to 4762. [2021-10-13 01:02:34,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4762 states, 4761 states have (on average 1.2157109850871666) internal successors, (5788), 4761 states have internal predecessors, (5788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:34,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4762 states to 4762 states and 5788 transitions. [2021-10-13 01:02:34,295 INFO L78 Accepts]: Start accepts. Automaton has 4762 states and 5788 transitions. Word has length 246 [2021-10-13 01:02:34,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:34,295 INFO L470 AbstractCegarLoop]: Abstraction has 4762 states and 5788 transitions. [2021-10-13 01:02:34,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:34,296 INFO L276 IsEmpty]: Start isEmpty. Operand 4762 states and 5788 transitions. [2021-10-13 01:02:34,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2021-10-13 01:02:34,305 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:34,305 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:34,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-10-13 01:02:34,306 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:34,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:34,306 INFO L82 PathProgramCache]: Analyzing trace with hash -923801151, now seen corresponding path program 1 times [2021-10-13 01:02:34,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:34,307 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192127446] [2021-10-13 01:02:34,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:34,307 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:34,598 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:02:34,598 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:34,598 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192127446] [2021-10-13 01:02:34,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192127446] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:02:34,599 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904370156] [2021-10-13 01:02:34,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:34,599 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:02:34,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:02:34,600 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:02:34,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-10-13 01:02:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:35,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 30 conjunts are in the unsatisfiable core [2021-10-13 01:02:35,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:02:36,691 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 28 proven. 30 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2021-10-13 01:02:36,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904370156] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:02:36,691 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 01:02:36,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 30 [2021-10-13 01:02:36,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114635810] [2021-10-13 01:02:36,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-10-13 01:02:36,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:36,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-10-13 01:02:36,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2021-10-13 01:02:36,694 INFO L87 Difference]: Start difference. First operand 4762 states and 5788 transitions. Second operand has 30 states, 30 states have (on average 11.333333333333334) internal successors, (340), 30 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:53,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:53,333 INFO L93 Difference]: Finished difference Result 40803 states and 50962 transitions. [2021-10-13 01:02:53,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 208 states. [2021-10-13 01:02:53,334 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 11.333333333333334) internal successors, (340), 30 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 247 [2021-10-13 01:02:53,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:53,373 INFO L225 Difference]: With dead ends: 40803 [2021-10-13 01:02:53,373 INFO L226 Difference]: Without dead ends: 36683 [2021-10-13 01:02:53,398 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21753 ImplicationChecksByTransitivity, 7270.9ms TimeCoverageRelationStatistics Valid=6041, Invalid=49419, Unknown=0, NotChecked=0, Total=55460 [2021-10-13 01:02:53,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36683 states. [2021-10-13 01:02:54,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36683 to 5155. [2021-10-13 01:02:54,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5155 states, 5154 states have (on average 1.2180830422972448) internal successors, (6278), 5154 states have internal predecessors, (6278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:54,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5155 states to 5155 states and 6278 transitions. [2021-10-13 01:02:54,331 INFO L78 Accepts]: Start accepts. Automaton has 5155 states and 6278 transitions. Word has length 247 [2021-10-13 01:02:54,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:54,331 INFO L470 AbstractCegarLoop]: Abstraction has 5155 states and 6278 transitions. [2021-10-13 01:02:54,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 11.333333333333334) internal successors, (340), 30 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:54,332 INFO L276 IsEmpty]: Start isEmpty. Operand 5155 states and 6278 transitions. [2021-10-13 01:02:54,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2021-10-13 01:02:54,342 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:54,342 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:54,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-10-13 01:02:54,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2021-10-13 01:02:54,558 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:54,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:54,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1336287465, now seen corresponding path program 1 times [2021-10-13 01:02:54,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:54,559 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621131176] [2021-10-13 01:02:54,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:54,559 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:54,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:54,706 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-10-13 01:02:54,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:54,706 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621131176] [2021-10-13 01:02:54,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621131176] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:54,706 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:54,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:02:54,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913722980] [2021-10-13 01:02:54,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 01:02:54,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:54,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 01:02:54,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:02:54,709 INFO L87 Difference]: Start difference. First operand 5155 states and 6278 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:55,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:55,664 INFO L93 Difference]: Finished difference Result 9682 states and 11849 transitions. [2021-10-13 01:02:55,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 01:02:55,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 254 [2021-10-13 01:02:55,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:55,671 INFO L225 Difference]: With dead ends: 9682 [2021-10-13 01:02:55,671 INFO L226 Difference]: Without dead ends: 5155 [2021-10-13 01:02:55,675 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:02:55,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5155 states. [2021-10-13 01:02:56,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5155 to 5155. [2021-10-13 01:02:56,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5155 states, 5154 states have (on average 1.214396585176562) internal successors, (6259), 5154 states have internal predecessors, (6259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:56,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5155 states to 5155 states and 6259 transitions. [2021-10-13 01:02:56,415 INFO L78 Accepts]: Start accepts. Automaton has 5155 states and 6259 transitions. Word has length 254 [2021-10-13 01:02:56,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:56,416 INFO L470 AbstractCegarLoop]: Abstraction has 5155 states and 6259 transitions. [2021-10-13 01:02:56,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:02:56,416 INFO L276 IsEmpty]: Start isEmpty. Operand 5155 states and 6259 transitions. [2021-10-13 01:02:56,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2021-10-13 01:02:56,427 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:56,427 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:02:56,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-10-13 01:02:56,428 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:02:56,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:56,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1666210174, now seen corresponding path program 1 times [2021-10-13 01:02:56,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:56,429 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576187782] [2021-10-13 01:02:56,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:56,429 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:56,746 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 2 proven. 47 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:02:56,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:56,746 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576187782] [2021-10-13 01:02:56,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576187782] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:02:56,746 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599903112] [2021-10-13 01:02:56,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:56,747 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:02:56,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:02:56,750 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:02:56,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-10-13 01:02:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:57,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 1052 conjuncts, 32 conjunts are in the unsatisfiable core [2021-10-13 01:02:57,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:02:59,254 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 41 proven. 38 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2021-10-13 01:02:59,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599903112] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:02:59,255 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 01:02:59,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 36 [2021-10-13 01:02:59,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442474014] [2021-10-13 01:02:59,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-10-13 01:02:59,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:59,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-10-13 01:02:59,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1174, Unknown=0, NotChecked=0, Total=1260 [2021-10-13 01:02:59,258 INFO L87 Difference]: Start difference. First operand 5155 states and 6259 transitions. Second operand has 36 states, 36 states have (on average 10.11111111111111) internal successors, (364), 36 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:03:10,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:03:10,663 INFO L93 Difference]: Finished difference Result 34391 states and 43026 transitions. [2021-10-13 01:03:10,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2021-10-13 01:03:10,663 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 10.11111111111111) internal successors, (364), 36 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 254 [2021-10-13 01:03:10,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:03:10,693 INFO L225 Difference]: With dead ends: 34391 [2021-10-13 01:03:10,693 INFO L226 Difference]: Without dead ends: 30122 [2021-10-13 01:03:10,704 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10072 ImplicationChecksByTransitivity, 4125.1ms TimeCoverageRelationStatistics Valid=2832, Invalid=28320, Unknown=0, NotChecked=0, Total=31152 [2021-10-13 01:03:10,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30122 states. [2021-10-13 01:03:11,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30122 to 5155. [2021-10-13 01:03:11,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5155 states, 5154 states have (on average 1.2120682964687621) internal successors, (6247), 5154 states have internal predecessors, (6247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:03:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5155 states to 5155 states and 6247 transitions. [2021-10-13 01:03:11,458 INFO L78 Accepts]: Start accepts. Automaton has 5155 states and 6247 transitions. Word has length 254 [2021-10-13 01:03:11,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:03:11,458 INFO L470 AbstractCegarLoop]: Abstraction has 5155 states and 6247 transitions. [2021-10-13 01:03:11,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 10.11111111111111) internal successors, (364), 36 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:03:11,459 INFO L276 IsEmpty]: Start isEmpty. Operand 5155 states and 6247 transitions. [2021-10-13 01:03:11,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2021-10-13 01:03:11,468 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:03:11,468 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:03:11,498 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-10-13 01:03:11,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-10-13 01:03:11,686 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:03:11,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:03:11,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1107246419, now seen corresponding path program 1 times [2021-10-13 01:03:11,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:03:11,687 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334590926] [2021-10-13 01:03:11,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:03:11,687 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:03:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:03:12,109 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:03:12,109 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:03:12,110 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334590926] [2021-10-13 01:03:12,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334590926] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:03:12,110 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285608670] [2021-10-13 01:03:12,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:03:12,110 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:03:12,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:03:12,111 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:03:12,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-10-13 01:03:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:03:12,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 1124 conjuncts, 36 conjunts are in the unsatisfiable core [2021-10-13 01:03:12,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:03:14,315 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 9 proven. 27 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:03:14,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285608670] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:03:14,316 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 01:03:14,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 33 [2021-10-13 01:03:14,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676385110] [2021-10-13 01:03:14,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-10-13 01:03:14,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:03:14,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-10-13 01:03:14,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1020, Unknown=0, NotChecked=0, Total=1122 [2021-10-13 01:03:14,319 INFO L87 Difference]: Start difference. First operand 5155 states and 6247 transitions. Second operand has 34 states, 34 states have (on average 11.176470588235293) internal successors, (380), 33 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:03:49,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:03:49,039 INFO L93 Difference]: Finished difference Result 60340 states and 75705 transitions. [2021-10-13 01:03:49,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 512 states. [2021-10-13 01:03:49,044 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 11.176470588235293) internal successors, (380), 33 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 271 [2021-10-13 01:03:49,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:03:49,103 INFO L225 Difference]: With dead ends: 60340 [2021-10-13 01:03:49,103 INFO L226 Difference]: Without dead ends: 56573 [2021-10-13 01:03:49,125 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 797 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 538 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124344 ImplicationChecksByTransitivity, 19916.3ms TimeCoverageRelationStatistics Valid=24889, Invalid=266171, Unknown=0, NotChecked=0, Total=291060 [2021-10-13 01:03:49,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56573 states. [2021-10-13 01:03:50,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56573 to 7732. [2021-10-13 01:03:50,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7732 states, 7731 states have (on average 1.2392963394127539) internal successors, (9581), 7731 states have internal predecessors, (9581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:03:50,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7732 states to 7732 states and 9581 transitions. [2021-10-13 01:03:50,747 INFO L78 Accepts]: Start accepts. Automaton has 7732 states and 9581 transitions. Word has length 271 [2021-10-13 01:03:50,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:03:50,748 INFO L470 AbstractCegarLoop]: Abstraction has 7732 states and 9581 transitions. [2021-10-13 01:03:50,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 11.176470588235293) internal successors, (380), 33 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:03:50,748 INFO L276 IsEmpty]: Start isEmpty. Operand 7732 states and 9581 transitions. [2021-10-13 01:03:50,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2021-10-13 01:03:50,761 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:03:50,761 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:03:50,792 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-10-13 01:03:50,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2021-10-13 01:03:50,978 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:03:50,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:03:50,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1536904725, now seen corresponding path program 1 times [2021-10-13 01:03:50,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:03:50,978 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097395190] [2021-10-13 01:03:50,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:03:50,979 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:03:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:03:51,103 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-10-13 01:03:51,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:03:51,104 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097395190] [2021-10-13 01:03:51,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097395190] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:03:51,104 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:03:51,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:03:51,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987639585] [2021-10-13 01:03:51,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 01:03:51,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:03:51,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 01:03:51,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:03:51,106 INFO L87 Difference]: Start difference. First operand 7732 states and 9581 transitions. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:03:52,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:03:52,688 INFO L93 Difference]: Finished difference Result 14190 states and 17630 transitions. [2021-10-13 01:03:52,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 01:03:52,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 271 [2021-10-13 01:03:52,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:03:52,696 INFO L225 Difference]: With dead ends: 14190 [2021-10-13 01:03:52,696 INFO L226 Difference]: Without dead ends: 7732 [2021-10-13 01:03:52,702 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:03:52,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7732 states. [2021-10-13 01:03:53,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7732 to 7732. [2021-10-13 01:03:53,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7732 states, 7731 states have (on average 1.2358039063510542) internal successors, (9554), 7731 states have internal predecessors, (9554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:03:53,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7732 states to 7732 states and 9554 transitions. [2021-10-13 01:03:53,778 INFO L78 Accepts]: Start accepts. Automaton has 7732 states and 9554 transitions. Word has length 271 [2021-10-13 01:03:53,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:03:53,778 INFO L470 AbstractCegarLoop]: Abstraction has 7732 states and 9554 transitions. [2021-10-13 01:03:53,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:03:53,778 INFO L276 IsEmpty]: Start isEmpty. Operand 7732 states and 9554 transitions. [2021-10-13 01:03:53,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2021-10-13 01:03:53,788 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:03:53,788 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:03:53,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-10-13 01:03:53,789 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:03:53,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:03:53,790 INFO L82 PathProgramCache]: Analyzing trace with hash -240703937, now seen corresponding path program 1 times [2021-10-13 01:03:53,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:03:53,790 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746035096] [2021-10-13 01:03:53,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:03:53,790 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:03:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:03:54,122 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 2 proven. 47 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:03:54,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:03:54,122 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746035096] [2021-10-13 01:03:54,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746035096] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:03:54,122 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070432104] [2021-10-13 01:03:54,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:03:54,123 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:03:54,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:03:54,124 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:03:54,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-10-13 01:03:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:03:55,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 1125 conjuncts, 26 conjunts are in the unsatisfiable core [2021-10-13 01:03:55,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:03:56,395 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 6 proven. 43 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:03:56,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070432104] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:03:56,396 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 01:03:56,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12] total 31 [2021-10-13 01:03:56,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705373214] [2021-10-13 01:03:56,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-10-13 01:03:56,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:03:56,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-10-13 01:03:56,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=901, Unknown=0, NotChecked=0, Total=992 [2021-10-13 01:03:56,397 INFO L87 Difference]: Start difference. First operand 7732 states and 9554 transitions. Second operand has 32 states, 32 states have (on average 12.0625) internal successors, (386), 31 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:04:35,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:04:35,879 INFO L93 Difference]: Finished difference Result 122734 states and 155659 transitions. [2021-10-13 01:04:35,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 405 states. [2021-10-13 01:04:35,879 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 12.0625) internal successors, (386), 31 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 271 [2021-10-13 01:04:35,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:04:36,039 INFO L225 Difference]: With dead ends: 122734 [2021-10-13 01:04:36,040 INFO L226 Difference]: Without dead ends: 117248 [2021-10-13 01:04:36,066 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 429 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76865 ImplicationChecksByTransitivity, 12443.5ms TimeCoverageRelationStatistics Valid=15860, Invalid=169470, Unknown=0, NotChecked=0, Total=185330 [2021-10-13 01:04:36,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117248 states. [2021-10-13 01:04:39,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117248 to 10897. [2021-10-13 01:04:39,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10897 states, 10896 states have (on average 1.2372430249632893) internal successors, (13481), 10896 states have internal predecessors, (13481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:04:39,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10897 states to 10897 states and 13481 transitions. [2021-10-13 01:04:39,130 INFO L78 Accepts]: Start accepts. Automaton has 10897 states and 13481 transitions. Word has length 271 [2021-10-13 01:04:39,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:04:39,131 INFO L470 AbstractCegarLoop]: Abstraction has 10897 states and 13481 transitions. [2021-10-13 01:04:39,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 12.0625) internal successors, (386), 31 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:04:39,131 INFO L276 IsEmpty]: Start isEmpty. Operand 10897 states and 13481 transitions. [2021-10-13 01:04:39,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2021-10-13 01:04:39,143 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:04:39,144 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:04:39,170 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-10-13 01:04:39,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2021-10-13 01:04:39,345 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:04:39,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:04:39,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1858144387, now seen corresponding path program 1 times [2021-10-13 01:04:39,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:04:39,346 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985283109] [2021-10-13 01:04:39,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:04:39,346 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:04:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:04:39,820 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 2 proven. 47 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:04:39,821 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:04:39,821 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985283109] [2021-10-13 01:04:39,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985283109] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:04:39,821 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644501029] [2021-10-13 01:04:39,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:04:39,821 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:04:39,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:04:39,822 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:04:39,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-10-13 01:04:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:04:41,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 1124 conjuncts, 22 conjunts are in the unsatisfiable core [2021-10-13 01:04:41,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:04:41,773 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2021-10-13 01:04:41,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644501029] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:04:41,773 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 01:04:41,773 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 8] total 27 [2021-10-13 01:04:41,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755207961] [2021-10-13 01:04:41,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-10-13 01:04:41,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:04:41,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-10-13 01:04:41,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=646, Unknown=0, NotChecked=0, Total=702 [2021-10-13 01:04:41,775 INFO L87 Difference]: Start difference. First operand 10897 states and 13481 transitions. Second operand has 27 states, 27 states have (on average 13.11111111111111) internal successors, (354), 27 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:04:55,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:04:55,451 INFO L93 Difference]: Finished difference Result 55046 states and 69950 transitions. [2021-10-13 01:04:55,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-10-13 01:04:55,452 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 13.11111111111111) internal successors, (354), 27 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 271 [2021-10-13 01:04:55,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:04:55,498 INFO L225 Difference]: With dead ends: 55046 [2021-10-13 01:04:55,498 INFO L226 Difference]: Without dead ends: 45210 [2021-10-13 01:04:55,510 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1946 ImplicationChecksByTransitivity, 1897.7ms TimeCoverageRelationStatistics Valid=937, Invalid=7073, Unknown=0, NotChecked=0, Total=8010 [2021-10-13 01:04:55,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45210 states. [2021-10-13 01:04:57,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45210 to 10073. [2021-10-13 01:04:57,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10073 states, 10072 states have (on average 1.2478157267672756) internal successors, (12568), 10072 states have internal predecessors, (12568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:04:57,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10073 states to 10073 states and 12568 transitions. [2021-10-13 01:04:57,692 INFO L78 Accepts]: Start accepts. Automaton has 10073 states and 12568 transitions. Word has length 271 [2021-10-13 01:04:57,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:04:57,692 INFO L470 AbstractCegarLoop]: Abstraction has 10073 states and 12568 transitions. [2021-10-13 01:04:57,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 13.11111111111111) internal successors, (354), 27 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:04:57,693 INFO L276 IsEmpty]: Start isEmpty. Operand 10073 states and 12568 transitions. [2021-10-13 01:04:57,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2021-10-13 01:04:57,699 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:04:57,699 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:04:57,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-10-13 01:04:57,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2021-10-13 01:04:57,900 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:04:57,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:04:57,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1031243988, now seen corresponding path program 1 times [2021-10-13 01:04:57,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:04:57,901 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551071343] [2021-10-13 01:04:57,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:04:57,901 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:04:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:04:58,323 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:04:58,323 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:04:58,323 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551071343] [2021-10-13 01:04:58,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551071343] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:04:58,323 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927602234] [2021-10-13 01:04:58,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:04:58,324 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:04:58,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:04:58,326 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:04:58,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-10-13 01:04:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:04:59,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 1125 conjuncts, 28 conjunts are in the unsatisfiable core [2021-10-13 01:04:59,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:05:00,606 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 9 proven. 27 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:05:00,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927602234] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:05:00,606 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 01:05:00,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12] total 31 [2021-10-13 01:05:00,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107051802] [2021-10-13 01:05:00,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-10-13 01:05:00,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:05:00,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-10-13 01:05:00,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2021-10-13 01:05:00,608 INFO L87 Difference]: Start difference. First operand 10073 states and 12568 transitions. Second operand has 32 states, 32 states have (on average 11.9375) internal successors, (382), 31 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:05:58,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:05:58,732 INFO L93 Difference]: Finished difference Result 136667 states and 174665 transitions. [2021-10-13 01:05:58,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 450 states. [2021-10-13 01:05:58,732 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 11.9375) internal successors, (382), 31 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 272 [2021-10-13 01:05:58,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:05:58,912 INFO L225 Difference]: With dead ends: 136667 [2021-10-13 01:05:58,912 INFO L226 Difference]: Without dead ends: 127314 [2021-10-13 01:05:59,159 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 474 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92597 ImplicationChecksByTransitivity, 17541.0ms TimeCoverageRelationStatistics Valid=20838, Invalid=205262, Unknown=0, NotChecked=0, Total=226100 [2021-10-13 01:05:59,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127314 states. [2021-10-13 01:06:02,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127314 to 10187. [2021-10-13 01:06:02,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10187 states, 10186 states have (on average 1.2487728254466914) internal successors, (12720), 10186 states have internal predecessors, (12720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:06:02,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10187 states to 10187 states and 12720 transitions. [2021-10-13 01:06:02,566 INFO L78 Accepts]: Start accepts. Automaton has 10187 states and 12720 transitions. Word has length 272 [2021-10-13 01:06:02,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:06:02,567 INFO L470 AbstractCegarLoop]: Abstraction has 10187 states and 12720 transitions. [2021-10-13 01:06:02,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 11.9375) internal successors, (382), 31 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:06:02,567 INFO L276 IsEmpty]: Start isEmpty. Operand 10187 states and 12720 transitions. [2021-10-13 01:06:02,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2021-10-13 01:06:02,574 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:06:02,575 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:06:02,601 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-10-13 01:06:02,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2021-10-13 01:06:02,775 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:06:02,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:06:02,776 INFO L82 PathProgramCache]: Analyzing trace with hash 601585682, now seen corresponding path program 1 times [2021-10-13 01:06:02,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:06:02,776 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892437264] [2021-10-13 01:06:02,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:06:02,777 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:06:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:06:02,917 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-10-13 01:06:02,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:06:02,918 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892437264] [2021-10-13 01:06:02,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892437264] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:06:02,918 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:06:02,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:06:02,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682220564] [2021-10-13 01:06:02,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 01:06:02,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:06:02,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 01:06:02,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:06:02,920 INFO L87 Difference]: Start difference. First operand 10187 states and 12720 transitions. Second operand has 5 states, 5 states have (on average 34.6) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:06:05,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:06:05,796 INFO L93 Difference]: Finished difference Result 19918 states and 24931 transitions. [2021-10-13 01:06:05,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 01:06:05,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 272 [2021-10-13 01:06:05,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:06:05,805 INFO L225 Difference]: With dead ends: 19918 [2021-10-13 01:06:05,805 INFO L226 Difference]: Without dead ends: 10225 [2021-10-13 01:06:05,810 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.3ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:06:05,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10225 states. [2021-10-13 01:06:08,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10225 to 10073. [2021-10-13 01:06:08,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10073 states, 10072 states have (on average 1.2478157267672756) internal successors, (12568), 10072 states have internal predecessors, (12568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:06:08,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10073 states to 10073 states and 12568 transitions. [2021-10-13 01:06:08,342 INFO L78 Accepts]: Start accepts. Automaton has 10073 states and 12568 transitions. Word has length 272 [2021-10-13 01:06:08,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:06:08,343 INFO L470 AbstractCegarLoop]: Abstraction has 10073 states and 12568 transitions. [2021-10-13 01:06:08,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:06:08,343 INFO L276 IsEmpty]: Start isEmpty. Operand 10073 states and 12568 transitions. [2021-10-13 01:06:08,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2021-10-13 01:06:08,349 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:06:08,350 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:06:08,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-10-13 01:06:08,350 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:06:08,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:06:08,350 INFO L82 PathProgramCache]: Analyzing trace with hash 83192022, now seen corresponding path program 1 times [2021-10-13 01:06:08,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:06:08,351 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561272933] [2021-10-13 01:06:08,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:06:08,351 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:06:08,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:06:08,469 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-10-13 01:06:08,469 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:06:08,470 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561272933] [2021-10-13 01:06:08,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561272933] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:06:08,470 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:06:08,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:06:08,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386535434] [2021-10-13 01:06:08,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:06:08,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:06:08,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:06:08,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:06:08,472 INFO L87 Difference]: Start difference. First operand 10073 states and 12568 transitions. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:06:10,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:06:10,680 INFO L93 Difference]: Finished difference Result 16616 states and 20833 transitions. [2021-10-13 01:06:10,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:06:10,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 272 [2021-10-13 01:06:10,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:06:10,687 INFO L225 Difference]: With dead ends: 16616 [2021-10-13 01:06:10,687 INFO L226 Difference]: Without dead ends: 6965 [2021-10-13 01:06:10,692 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:06:10,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6965 states. [2021-10-13 01:06:12,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6965 to 6965. [2021-10-13 01:06:12,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6965 states, 6964 states have (on average 1.2498564043653073) internal successors, (8704), 6964 states have internal predecessors, (8704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:06:12,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6965 states to 6965 states and 8704 transitions. [2021-10-13 01:06:12,605 INFO L78 Accepts]: Start accepts. Automaton has 6965 states and 8704 transitions. Word has length 272 [2021-10-13 01:06:12,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:06:12,606 INFO L470 AbstractCegarLoop]: Abstraction has 6965 states and 8704 transitions. [2021-10-13 01:06:12,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:06:12,606 INFO L276 IsEmpty]: Start isEmpty. Operand 6965 states and 8704 transitions. [2021-10-13 01:06:12,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2021-10-13 01:06:12,611 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:06:12,611 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:06:12,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-10-13 01:06:12,611 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:06:12,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:06:12,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1004446436, now seen corresponding path program 1 times [2021-10-13 01:06:12,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:06:12,612 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376854459] [2021-10-13 01:06:12,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:06:12,612 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:06:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:06:12,724 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2021-10-13 01:06:12,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:06:12,725 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376854459] [2021-10-13 01:06:12,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376854459] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:06:12,725 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:06:12,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 01:06:12,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472133303] [2021-10-13 01:06:12,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 01:06:12,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:06:12,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 01:06:12,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 01:06:12,727 INFO L87 Difference]: Start difference. First operand 6965 states and 8704 transitions. Second operand has 7 states, 7 states have (on average 26.714285714285715) internal successors, (187), 7 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:06:17,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:06:17,253 INFO L93 Difference]: Finished difference Result 17973 states and 22586 transitions. [2021-10-13 01:06:17,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 01:06:17,254 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.714285714285715) internal successors, (187), 7 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 274 [2021-10-13 01:06:17,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:06:17,267 INFO L225 Difference]: With dead ends: 17973 [2021-10-13 01:06:17,267 INFO L226 Difference]: Without dead ends: 11650 [2021-10-13 01:06:17,272 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.7ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-13 01:06:17,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11650 states. [2021-10-13 01:06:19,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11650 to 6925. [2021-10-13 01:06:19,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6925 states, 6924 states have (on average 1.2484113229347198) internal successors, (8644), 6924 states have internal predecessors, (8644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:06:19,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6925 states to 6925 states and 8644 transitions. [2021-10-13 01:06:19,280 INFO L78 Accepts]: Start accepts. Automaton has 6925 states and 8644 transitions. Word has length 274 [2021-10-13 01:06:19,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:06:19,281 INFO L470 AbstractCegarLoop]: Abstraction has 6925 states and 8644 transitions. [2021-10-13 01:06:19,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.714285714285715) internal successors, (187), 7 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:06:19,281 INFO L276 IsEmpty]: Start isEmpty. Operand 6925 states and 8644 transitions. [2021-10-13 01:06:19,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2021-10-13 01:06:19,288 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:06:19,289 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:06:19,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-10-13 01:06:19,289 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:06:19,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:06:19,290 INFO L82 PathProgramCache]: Analyzing trace with hash 11587278, now seen corresponding path program 1 times [2021-10-13 01:06:19,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:06:19,290 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702260431] [2021-10-13 01:06:19,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:06:19,291 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:06:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:06:19,362 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 01:06:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:06:19,590 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 01:06:19,590 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-13 01:06:19,591 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,593 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,593 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,593 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,594 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,594 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,594 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,594 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,594 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,595 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,595 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,595 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,595 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,595 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,596 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,596 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,596 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,596 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,596 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,597 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,597 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,597 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,597 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,597 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,598 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,598 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,598 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,598 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,598 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,599 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,599 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,599 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,599 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,599 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,600 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,600 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,600 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:06:19,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-10-13 01:06:19,609 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 01:06:19,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:06:19 BoogieIcfgContainer [2021-10-13 01:06:19,951 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 01:06:19,952 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 01:06:19,952 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 01:06:19,952 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 01:06:19,953 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:01:58" (3/4) ... [2021-10-13 01:06:19,955 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-13 01:06:20,321 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-13 01:06:20,322 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 01:06:20,324 INFO L168 Benchmark]: Toolchain (without parser) took 264388.43 ms. Allocated memory was 98.6 MB in the beginning and 6.2 GB in the end (delta: 6.1 GB). Free memory was 56.9 MB in the beginning and 5.0 GB in the end (delta: -4.9 GB). Peak memory consumption was 1.3 GB. Max. memory is 16.1 GB. [2021-10-13 01:06:20,325 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 98.6 MB. Free memory is still 73.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 01:06:20,326 INFO L168 Benchmark]: CACSL2BoogieTranslator took 398.89 ms. Allocated memory is still 98.6 MB. Free memory was 56.7 MB in the beginning and 68.3 MB in the end (delta: -11.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-13 01:06:20,326 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.77 ms. Allocated memory is still 98.6 MB. Free memory was 68.3 MB in the beginning and 62.1 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-13 01:06:20,326 INFO L168 Benchmark]: Boogie Preprocessor took 102.14 ms. Allocated memory is still 98.6 MB. Free memory was 62.1 MB in the beginning and 56.8 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 01:06:20,327 INFO L168 Benchmark]: RCFGBuilder took 1611.40 ms. Allocated memory was 98.6 MB in the beginning and 132.1 MB in the end (delta: 33.6 MB). Free memory was 56.8 MB in the beginning and 69.4 MB in the end (delta: -12.5 MB). Peak memory consumption was 37.1 MB. Max. memory is 16.1 GB. [2021-10-13 01:06:20,327 INFO L168 Benchmark]: TraceAbstraction took 261789.19 ms. Allocated memory was 132.1 MB in the beginning and 6.2 GB in the end (delta: 6.1 GB). Free memory was 68.6 MB in the beginning and 5.0 GB in the end (delta: -5.0 GB). Peak memory consumption was 1.2 GB. Max. memory is 16.1 GB. [2021-10-13 01:06:20,328 INFO L168 Benchmark]: Witness Printer took 370.07 ms. Allocated memory is still 6.2 GB. Free memory was 5.0 GB in the beginning and 5.0 GB in the end (delta: 67.4 MB). Peak memory consumption was 69.2 MB. Max. memory is 16.1 GB. [2021-10-13 01:06:20,330 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.28 ms. Allocated memory is still 98.6 MB. Free memory is still 73.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 398.89 ms. Allocated memory is still 98.6 MB. Free memory was 56.7 MB in the beginning and 68.3 MB in the end (delta: -11.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 98.77 ms. Allocated memory is still 98.6 MB. Free memory was 68.3 MB in the beginning and 62.1 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 102.14 ms. Allocated memory is still 98.6 MB. Free memory was 62.1 MB in the beginning and 56.8 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1611.40 ms. Allocated memory was 98.6 MB in the beginning and 132.1 MB in the end (delta: 33.6 MB). Free memory was 56.8 MB in the beginning and 69.4 MB in the end (delta: -12.5 MB). Peak memory consumption was 37.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 261789.19 ms. Allocated memory was 132.1 MB in the beginning and 6.2 GB in the end (delta: 6.1 GB). Free memory was 68.6 MB in the beginning and 5.0 GB in the end (delta: -5.0 GB). Peak memory consumption was 1.2 GB. Max. memory is 16.1 GB. * Witness Printer took 370.07 ms. Allocated memory is still 6.2 GB. Free memory was 5.0 GB in the beginning and 5.0 GB in the end (delta: 67.4 MB). Peak memory consumption was 69.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms 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() [L206] int tmp ; [L207] int tmp___0 ; [L208] int tmp___1 ; [L209] int tmp___2 ; [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 [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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND TRUE history_id == 0 [L129] COND TRUE history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L130] COND TRUE historyIndex == 0 [L131] return (gate1Failed_History_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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L76] tmp = (int )read_history_bool(0, 0) [L77] COND FALSE !(! (tmp == (int )ini_bool)) 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND TRUE history_id == 0 [L129] COND TRUE history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L130] COND TRUE historyIndex == 0 [L131] return (gate1Failed_History_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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L76] tmp = (int )read_history_bool(0, 0) [L77] COND FALSE !(! (tmp == (int )ini_bool)) 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND TRUE history_id == 0 [L129] COND TRUE history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L130] COND TRUE historyIndex == 0 [L131] return (gate1Failed_History_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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L76] tmp = (int )read_history_bool(0, 0) [L77] COND FALSE !(! (tmp == (int )ini_bool)) 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND FALSE !(var < 3) 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L101] return (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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L212] tmp = add_history_type(0) [L213] COND FALSE !(! tmp) [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 [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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND TRUE history_id == 1 [L129] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L139] COND TRUE history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L140] COND TRUE historyIndex == 0 [L141] return (gate2Failed_History_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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L82] tmp___0 = (int )read_history_bool(1, 0) [L83] COND FALSE !(! (tmp___0 == (int )ini_bool)) 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND TRUE history_id == 1 [L129] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L139] COND TRUE history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L140] COND TRUE historyIndex == 0 [L141] return (gate2Failed_History_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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L82] tmp___0 = (int )read_history_bool(1, 0) [L83] COND FALSE !(! (tmp___0 == (int )ini_bool)) 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND TRUE history_id == 1 [L129] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L139] COND TRUE history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L140] COND TRUE historyIndex == 0 [L141] return (gate2Failed_History_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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L82] tmp___0 = (int )read_history_bool(1, 0) [L83] COND FALSE !(! (tmp___0 == (int )ini_bool)) 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND FALSE !(var < 3) 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L101] return (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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L216] tmp___0 = add_history_type(1) [L217] COND FALSE !(! tmp___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 [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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L87] COND TRUE history_id == 2 [L129] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L139] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L149] COND TRUE history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L150] COND TRUE historyIndex == 0 [L151] return (gate3Failed_History_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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L88] tmp___1 = (int )read_history_bool(2, 0) [L89] COND FALSE !(! (tmp___1 == (int )ini_bool)) 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L87] COND TRUE history_id == 2 [L129] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L139] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L149] COND TRUE history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L150] COND TRUE historyIndex == 0 [L151] return (gate3Failed_History_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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L88] tmp___1 = (int )read_history_bool(2, 0) [L89] COND FALSE !(! (tmp___1 == (int )ini_bool)) 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L87] COND TRUE history_id == 2 [L129] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L139] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L149] COND TRUE history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L150] COND TRUE historyIndex == 0 [L151] return (gate3Failed_History_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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L88] tmp___1 = (int )read_history_bool(2, 0) [L89] COND FALSE !(! (tmp___1 == (int )ini_bool)) 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND FALSE !(var < 3) 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L101] return (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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L220] tmp___1 = add_history_type(2) [L221] COND FALSE !(! tmp___1) [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 [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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L87] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L93] COND TRUE history_id == 3 [L109] COND TRUE history_id == 3 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L94] tmp___2 = (int )read_history_int8(3, 0) [L95] COND FALSE !(! (tmp___2 == (int )ini_int)) 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L87] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L93] COND TRUE history_id == 3 [L109] COND TRUE history_id == 3 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L94] tmp___2 = (int )read_history_int8(3, 0) [L95] COND FALSE !(! (tmp___2 == (int )ini_int)) 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L87] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L93] COND TRUE history_id == 3 [L109] COND TRUE history_id == 3 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L94] tmp___2 = (int )read_history_int8(3, 0) [L95] COND FALSE !(! (tmp___2 == (int )ini_int)) 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND FALSE !(var < 3) 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L101] return (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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L224] tmp___2 = add_history_type(3) [L225] COND FALSE !(! tmp___2) [L228] return (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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L502] i2 = init() [L37] COND FALSE !(!cond) 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, 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 [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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L511] COND TRUE 1 [L341] int8_t next_state ; [L342] msg_t tmp ; [L343] int tmp___0 ; [L346] gate1Failed = __VERIFIER_nondet_bool() [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 [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=6, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L348] COND TRUE \read(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=6, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L349] EXPR 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=6, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L349] g1v_new = nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new [L372] int8_t next_state ; [L373] msg_t tmp ; [L374] int tmp___0 ; [L377] gate2Failed = __VERIFIER_nondet_bool() [L184] COND FALSE !(history_id == 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=6, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, 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 [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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L379] COND TRUE \read(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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L380] EXPR 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L380] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L403] int8_t next_state ; [L404] msg_t tmp ; [L405] int tmp___0 ; [L408] gate3Failed = __VERIFIER_nondet_bool() [L184] COND FALSE !(history_id == 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L189] COND FALSE !(history_id == 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, 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 [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=6, 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=8, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, 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=6, 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=8, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, 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=6, 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=8, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L37] COND FALSE !(!cond) 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=6, 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=8, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L428] EXPR 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=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, 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=8, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L428] g3v_new = next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new [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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-2, votedValue_History_1=-4, 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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [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 [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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [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 [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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L37] COND FALSE !(!cond) 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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L129] COND TRUE history_id == 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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L130] COND FALSE !(historyIndex == 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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L133] COND TRUE historyIndex == 1 [L134] return (gate1Failed_History_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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L264] tmp___3 = read_history_bool(0, 1) [L265] COND TRUE ! tmp___3 [L129] COND FALSE !(history_id == 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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L139] COND TRUE history_id == 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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L140] COND FALSE !(historyIndex == 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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L143] COND TRUE historyIndex == 1 [L144] return (gate2Failed_History_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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L266] tmp___4 = read_history_bool(1, 1) [L267] COND TRUE ! tmp___4 [L129] COND FALSE !(history_id == 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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L139] COND FALSE !(history_id == 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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L149] COND TRUE history_id == 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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L150] COND FALSE !(historyIndex == 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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L153] COND TRUE historyIndex == 1 [L154] return (gate3Failed_History_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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L268] tmp___5 = read_history_bool(2, 1) [L269] COND TRUE ! tmp___5 [L270] temp_count = 0 [L109] COND TRUE history_id == 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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L109] COND TRUE history_id == 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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L109] COND TRUE history_id == 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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L109] COND TRUE history_id == 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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L110] COND FALSE !(historyIndex == 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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L113] COND TRUE historyIndex == 1 [L114] return (votedValue_History_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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L109] COND TRUE history_id == 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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L336] return (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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L523] c1 = check() [L535] COND FALSE !(! arg) 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=6, 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L511] COND TRUE 1 [L341] int8_t next_state ; [L342] msg_t tmp ; [L343] int tmp___0 ; [L346] gate1Failed = __VERIFIER_nondet_bool() [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 [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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L37] COND FALSE !(!cond) 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L366] EXPR next_state != nomsg && g1v_new == nomsg ? next_state : 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=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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L366] g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new [L372] int8_t next_state ; [L373] msg_t tmp ; [L374] int tmp___0 ; [L377] gate2Failed = __VERIFIER_nondet_bool() [L184] COND FALSE !(history_id == 0) 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [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 [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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L379] COND TRUE \read(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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L380] EXPR 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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L380] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L403] int8_t next_state ; [L404] msg_t tmp ; [L405] int tmp___0 ; [L408] gate3Failed = __VERIFIER_nondet_bool() [L184] COND FALSE !(history_id == 0) 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=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L189] COND FALSE !(history_id == 1) 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=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [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 [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=-4] [L410] COND TRUE \read(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=-4] [L411] EXPR 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=-4] [L411] g3v_new = nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new [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, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [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, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [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 [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, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [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 [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, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L37] COND FALSE !(!cond) 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] [L129] COND TRUE history_id == 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, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] COND FALSE !(historyIndex == 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, 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 [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] [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, 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 [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] [L110] COND FALSE !(historyIndex == 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, 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 [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] [L303] tmp___10 = read_history_int8(3, 1) [L304] COND TRUE (int )tmp___10 > -2 [L109] COND TRUE history_id == 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, 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 [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] [L305] tmp___6 = read_history_int8(3, 0) [L306] COND TRUE (int )tmp___6 == (int )nomsg [L129] COND TRUE history_id == 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, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] COND FALSE !(historyIndex == 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, 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 [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] [L307] tmp___7 = read_history_bool(0, 1) [L308] COND TRUE \read(tmp___7) [L129] COND FALSE !(history_id == 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, 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 [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] [L140] COND FALSE !(historyIndex == 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, 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 [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] [L309] tmp___8 = read_history_bool(1, 1) [L310] COND TRUE \read(tmp___8) [L129] COND FALSE !(history_id == 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, 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 [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] [L149] COND TRUE history_id == 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, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L150] COND FALSE !(historyIndex == 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, 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 [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] [L311] tmp___9 = read_history_bool(2, 1) [L312] COND TRUE ! tmp___9 [L313] return (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, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L523] c1 = check() [L535] COND TRUE ! arg 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] [L537] reach_error() 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] - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 521 locations, 37 error locations. Started 1 CEGAR loops. OverallTime: 261351.5ms, OverallIterations: 55, TraceHistogramMax: 3, EmptinessCheckTime: 227.5ms, AutomataDifference: 204552.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 29.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 29876 SDtfs, 56295 SDslu, 207330 SDs, 0 SdLazy, 67680 SolverSat, 1605 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24856.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5510 GetRequests, 3134 SyntacticMatches, 4 SemanticMatches, 2372 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337292 ImplicationChecksByTransitivity, 68569.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=10897occurred in iteration=49, InterpolantAutomatonStates: 2223, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 24943.7ms AutomataMinimizationTime, 54 MinimizatonAttempts, 401852 StatesRemovedByMinimization, 45 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 818.3ms SsaConstructionTime, 2924.2ms SatisfiabilityAnalysisTime, 17183.7ms InterpolantComputationTime, 12153 NumberOfCodeBlocks, 12153 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 11807 ConstructedInterpolants, 0 QuantifiedInterpolants, 38129 SizeOfPredicates, 93 NumberOfNonLiveVariables, 12992 ConjunctsInSsa, 273 ConjunctsInUnsatCore, 68 InterpolantComputations, 42 PerfectInterpolantSequences, 6669/7385 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! [2021-10-13 01:06:20,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af0aeb5e-441a-4c7a-a22a-6acc7ef8a278/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...