./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label24.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 57096758 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddee9d1a-a54b-41ca-abec-aff9b9c5dfaa/bin/uautomizer-hJ6jxDFKc3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddee9d1a-a54b-41ca-abec-aff9b9c5dfaa/bin/uautomizer-hJ6jxDFKc3/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddee9d1a-a54b-41ca-abec-aff9b9c5dfaa/bin/uautomizer-hJ6jxDFKc3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddee9d1a-a54b-41ca-abec-aff9b9c5dfaa/bin/uautomizer-hJ6jxDFKc3/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label24.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddee9d1a-a54b-41ca-abec-aff9b9c5dfaa/bin/uautomizer-hJ6jxDFKc3/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddee9d1a-a54b-41ca-abec-aff9b9c5dfaa/bin/uautomizer-hJ6jxDFKc3 --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 1991f97c0e13e11e03c57b4ec7e6a3ced4522e46 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-5709675 [2021-10-15 20:13:54,479 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-15 20:13:54,481 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-15 20:13:54,531 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-15 20:13:54,532 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-15 20:13:54,536 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-15 20:13:54,538 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-15 20:13:54,543 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-15 20:13:54,546 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-15 20:13:54,554 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-15 20:13:54,555 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-15 20:13:54,558 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-15 20:13:54,558 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-15 20:13:54,562 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-15 20:13:54,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-15 20:13:54,566 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-15 20:13:54,567 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-15 20:13:54,568 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-15 20:13:54,570 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-15 20:13:54,572 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-15 20:13:54,574 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-15 20:13:54,576 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-15 20:13:54,578 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-15 20:13:54,579 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-15 20:13:54,582 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-15 20:13:54,583 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-15 20:13:54,583 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-15 20:13:54,584 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-15 20:13:54,585 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-15 20:13:54,586 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-15 20:13:54,587 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-15 20:13:54,588 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-15 20:13:54,589 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-15 20:13:54,589 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-15 20:13:54,591 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-15 20:13:54,591 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-15 20:13:54,592 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-15 20:13:54,592 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-15 20:13:54,593 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-15 20:13:54,594 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-15 20:13:54,595 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-15 20:13:54,596 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddee9d1a-a54b-41ca-abec-aff9b9c5dfaa/bin/uautomizer-hJ6jxDFKc3/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-15 20:13:54,632 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-15 20:13:54,636 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-15 20:13:54,636 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-15 20:13:54,637 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-15 20:13:54,639 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-15 20:13:54,640 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-15 20:13:54,640 INFO L138 SettingsManager]: * Use SBE=true [2021-10-15 20:13:54,640 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-15 20:13:54,641 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-15 20:13:54,641 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-15 20:13:54,642 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-15 20:13:54,642 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-15 20:13:54,643 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-15 20:13:54,643 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-15 20:13:54,643 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-15 20:13:54,643 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-15 20:13:54,644 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-15 20:13:54,644 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-15 20:13:54,644 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-15 20:13:54,644 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-15 20:13:54,645 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-15 20:13:54,645 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-15 20:13:54,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-15 20:13:54,645 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-15 20:13:54,646 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-15 20:13:54,646 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-15 20:13:54,646 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-15 20:13:54,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-15 20:13:54,647 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-15 20:13:54,647 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-15 20:13:54,647 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-15 20:13:54,647 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-15 20:13:54,648 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_ddee9d1a-a54b-41ca-abec-aff9b9c5dfaa/bin/uautomizer-hJ6jxDFKc3/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_ddee9d1a-a54b-41ca-abec-aff9b9c5dfaa/bin/uautomizer-hJ6jxDFKc3 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 -> 1991f97c0e13e11e03c57b4ec7e6a3ced4522e46 [2021-10-15 20:13:54,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-15 20:13:55,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-15 20:13:55,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-15 20:13:55,005 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-15 20:13:55,006 INFO L275 PluginConnector]: CDTParser initialized [2021-10-15 20:13:55,007 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddee9d1a-a54b-41ca-abec-aff9b9c5dfaa/bin/uautomizer-hJ6jxDFKc3/../../sv-benchmarks/c/eca-rers2012/Problem10_label24.c [2021-10-15 20:13:55,107 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddee9d1a-a54b-41ca-abec-aff9b9c5dfaa/bin/uautomizer-hJ6jxDFKc3/data/2407f04eb/de51011ce23b4d92bca027e0e8db410c/FLAG1f2734dfb [2021-10-15 20:13:55,696 INFO L306 CDTParser]: Found 1 translation units. [2021-10-15 20:13:55,697 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddee9d1a-a54b-41ca-abec-aff9b9c5dfaa/sv-benchmarks/c/eca-rers2012/Problem10_label24.c [2021-10-15 20:13:55,713 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddee9d1a-a54b-41ca-abec-aff9b9c5dfaa/bin/uautomizer-hJ6jxDFKc3/data/2407f04eb/de51011ce23b4d92bca027e0e8db410c/FLAG1f2734dfb [2021-10-15 20:13:55,959 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddee9d1a-a54b-41ca-abec-aff9b9c5dfaa/bin/uautomizer-hJ6jxDFKc3/data/2407f04eb/de51011ce23b4d92bca027e0e8db410c [2021-10-15 20:13:55,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-15 20:13:55,964 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-15 20:13:55,970 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-15 20:13:55,970 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-15 20:13:55,975 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-15 20:13:55,976 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 08:13:55" (1/1) ... [2021-10-15 20:13:55,977 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11796bdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:13:55, skipping insertion in model container [2021-10-15 20:13:55,977 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 08:13:55" (1/1) ... [2021-10-15 20:13:55,986 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-15 20:13:56,032 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-15 20:13:56,240 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_ddee9d1a-a54b-41ca-abec-aff9b9c5dfaa/sv-benchmarks/c/eca-rers2012/Problem10_label24.c[1861,1874] [2021-10-15 20:13:56,459 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-15 20:13:56,469 INFO L203 MainTranslator]: Completed pre-run [2021-10-15 20:13:56,500 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_ddee9d1a-a54b-41ca-abec-aff9b9c5dfaa/sv-benchmarks/c/eca-rers2012/Problem10_label24.c[1861,1874] [2021-10-15 20:13:56,672 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-15 20:13:56,701 INFO L208 MainTranslator]: Completed translation [2021-10-15 20:13:56,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:13:56 WrapperNode [2021-10-15 20:13:56,702 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-15 20:13:56,703 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-15 20:13:56,704 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-15 20:13:56,704 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-15 20:13:56,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:13:56" (1/1) ... [2021-10-15 20:13:56,740 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:13:56" (1/1) ... [2021-10-15 20:13:56,839 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-15 20:13:56,840 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-15 20:13:56,840 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-15 20:13:56,841 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-15 20:13:56,850 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:13:56" (1/1) ... [2021-10-15 20:13:56,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:13:56" (1/1) ... [2021-10-15 20:13:56,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:13:56" (1/1) ... [2021-10-15 20:13:56,857 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:13:56" (1/1) ... [2021-10-15 20:13:56,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:13:56" (1/1) ... [2021-10-15 20:13:56,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:13:56" (1/1) ... [2021-10-15 20:13:56,941 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:13:56" (1/1) ... [2021-10-15 20:13:56,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-15 20:13:56,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-15 20:13:56,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-15 20:13:56,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-15 20:13:56,967 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:13:56" (1/1) ... [2021-10-15 20:13:56,995 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-15 20:13:57,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddee9d1a-a54b-41ca-abec-aff9b9c5dfaa/bin/uautomizer-hJ6jxDFKc3/z3 [2021-10-15 20:13:57,057 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddee9d1a-a54b-41ca-abec-aff9b9c5dfaa/bin/uautomizer-hJ6jxDFKc3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-15 20:13:57,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddee9d1a-a54b-41ca-abec-aff9b9c5dfaa/bin/uautomizer-hJ6jxDFKc3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-15 20:13:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-15 20:13:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-15 20:13:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-15 20:13:57,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-15 20:13:58,651 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-15 20:13:58,652 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-10-15 20:13:58,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 08:13:58 BoogieIcfgContainer [2021-10-15 20:13:58,660 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-15 20:13:58,662 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-15 20:13:58,662 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-15 20:13:58,667 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-15 20:13:58,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 08:13:55" (1/3) ... [2021-10-15 20:13:58,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e2f5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 08:13:58, skipping insertion in model container [2021-10-15 20:13:58,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:13:56" (2/3) ... [2021-10-15 20:13:58,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e2f5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 08:13:58, skipping insertion in model container [2021-10-15 20:13:58,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 08:13:58" (3/3) ... [2021-10-15 20:13:58,672 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label24.c [2021-10-15 20:13:58,683 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-15 20:13:58,683 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-15 20:13:58,756 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-15 20:13:58,766 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-15 20:13:58,767 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-15 20:13:58,797 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 206 places, 344 transitions, 688 flow [2021-10-15 20:13:58,898 INFO L129 PetriNetUnfolder]: 139/344 cut-off events. [2021-10-15 20:13:58,898 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-15 20:13:58,900 INFO L84 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 344 events. 139/344 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 210 event pairs, 0 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 0. Up to 76 conditions per place. [2021-10-15 20:13:58,901 INFO L82 GeneralOperation]: Start removeDead. Operand has 206 places, 344 transitions, 688 flow [2021-10-15 20:13:58,912 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 203 places, 339 transitions, 678 flow [2021-10-15 20:13:58,917 INFO L129 PetriNetUnfolder]: 9/31 cut-off events. [2021-10-15 20:13:58,917 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-15 20:13:58,917 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 20:13:58,918 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 20:13:58,918 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 20:13:58,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 20:13:58,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1414013846, now seen corresponding path program 1 times [2021-10-15 20:13:58,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 20:13:58,935 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138842794] [2021-10-15 20:13:58,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:13:58,936 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 20:13:59,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 20:13:59,188 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-15 20:13:59,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 20:13:59,189 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138842794] [2021-10-15 20:13:59,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138842794] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 20:13:59,190 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 20:13:59,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-15 20:13:59,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432897115] [2021-10-15 20:13:59,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 20:13:59,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 20:13:59,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 20:13:59,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 20:13:59,228 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 344 [2021-10-15 20:13:59,246 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 339 transitions, 678 flow. 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-15 20:13:59,246 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 20:13:59,246 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 344 [2021-10-15 20:13:59,248 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 20:14:00,429 INFO L129 PetriNetUnfolder]: 109/450 cut-off events. [2021-10-15 20:14:00,431 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-15 20:14:00,435 INFO L84 FinitePrefix]: Finished finitePrefix Result has 894 conditions, 450 events. 109/450 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 481 event pairs, 0 based on Foata normal form. 61/342 useless extension candidates. Maximal degree in co-relation 1. Up to 261 conditions per place. [2021-10-15 20:14:00,441 INFO L132 encePairwiseOnDemand]: 146/344 looper letters, 339 selfloop transitions, 30 changer transitions 73/447 dead transitions. [2021-10-15 20:14:00,442 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 447 transitions, 1778 flow [2021-10-15 20:14:00,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 20:14:00,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 20:14:00,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 630 transitions. [2021-10-15 20:14:00,469 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6104651162790697 [2021-10-15 20:14:00,470 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 630 transitions. [2021-10-15 20:14:00,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 630 transitions. [2021-10-15 20:14:00,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 20:14:00,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 630 transitions. [2021-10-15 20:14:00,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 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-15 20:14:00,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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-15 20:14:00,501 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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-15 20:14:00,503 INFO L186 Difference]: Start difference. First operand has 203 places, 339 transitions, 678 flow. Second operand 3 states and 630 transitions. [2021-10-15 20:14:00,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 447 transitions, 1778 flow [2021-10-15 20:14:00,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 447 transitions, 1778 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-10-15 20:14:00,552 INFO L242 Difference]: Finished difference. Result has 207 places, 238 transitions, 730 flow [2021-10-15 20:14:00,555 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=207, PETRI_TRANSITIONS=238} [2021-10-15 20:14:00,556 INFO L334 CegarLoopForPetriNet]: 203 programPoint places, 4 predicate places. [2021-10-15 20:14:00,557 INFO L470 AbstractCegarLoop]: Abstraction has has 207 places, 238 transitions, 730 flow [2021-10-15 20:14:00,557 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-15 20:14:00,557 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 20:14:00,558 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2021-10-15 20:14:00,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-15 20:14:00,559 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 20:14:00,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 20:14:00,560 INFO L82 PathProgramCache]: Analyzing trace with hash -795484010, now seen corresponding path program 1 times [2021-10-15 20:14:00,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 20:14:00,560 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574045841] [2021-10-15 20:14:00,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:14:00,561 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 20:14:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 20:14:00,823 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 20:14:00,823 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 20:14:00,824 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574045841] [2021-10-15 20:14:00,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574045841] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 20:14:00,825 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 20:14:00,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 20:14:00,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998454027] [2021-10-15 20:14:00,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 20:14:00,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 20:14:00,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 20:14:00,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 20:14:00,836 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 344 [2021-10-15 20:14:00,837 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 238 transitions, 730 flow. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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-15 20:14:00,837 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 20:14:00,837 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 344 [2021-10-15 20:14:00,838 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 20:14:01,639 INFO L129 PetriNetUnfolder]: 106/526 cut-off events. [2021-10-15 20:14:01,640 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2021-10-15 20:14:01,642 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 526 events. 106/526 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 665 event pairs, 0 based on Foata normal form. 66/592 useless extension candidates. Maximal degree in co-relation 462. Up to 349 conditions per place. [2021-10-15 20:14:01,648 INFO L132 encePairwiseOnDemand]: 268/344 looper letters, 350 selfloop transitions, 29 changer transitions 0/384 dead transitions. [2021-10-15 20:14:01,649 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 384 transitions, 1808 flow [2021-10-15 20:14:01,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 20:14:01,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 20:14:01,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2021-10-15 20:14:01,654 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.43507751937984496 [2021-10-15 20:14:01,654 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2021-10-15 20:14:01,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2021-10-15 20:14:01,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 20:14:01,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2021-10-15 20:14:01,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 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-15 20:14:01,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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-15 20:14:01,667 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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-15 20:14:01,667 INFO L186 Difference]: Start difference. First operand has 207 places, 238 transitions, 730 flow. Second operand 3 states and 449 transitions. [2021-10-15 20:14:01,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 384 transitions, 1808 flow [2021-10-15 20:14:01,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 384 transitions, 1740 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-15 20:14:01,700 INFO L242 Difference]: Finished difference. Result has 149 places, 248 transitions, 952 flow [2021-10-15 20:14:01,701 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=952, PETRI_PLACES=149, PETRI_TRANSITIONS=248} [2021-10-15 20:14:01,709 INFO L334 CegarLoopForPetriNet]: 203 programPoint places, -54 predicate places. [2021-10-15 20:14:01,709 INFO L470 AbstractCegarLoop]: Abstraction has has 149 places, 248 transitions, 952 flow [2021-10-15 20:14:01,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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-15 20:14:01,710 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 20:14:01,710 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2021-10-15 20:14:01,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-15 20:14:01,711 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 20:14:01,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 20:14:01,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1490120663, now seen corresponding path program 1 times [2021-10-15 20:14:01,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 20:14:01,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891041507] [2021-10-15 20:14:01,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:14:01,713 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 20:14:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 20:14:01,954 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 20:14:01,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 20:14:01,954 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891041507] [2021-10-15 20:14:01,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891041507] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 20:14:01,956 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 20:14:01,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-15 20:14:01,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995209497] [2021-10-15 20:14:01,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 20:14:01,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 20:14:01,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 20:14:01,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 20:14:01,961 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 344 [2021-10-15 20:14:01,962 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 248 transitions, 952 flow. 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-15 20:14:01,962 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 20:14:01,962 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 344 [2021-10-15 20:14:01,962 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 20:14:02,722 INFO L129 PetriNetUnfolder]: 116/675 cut-off events. [2021-10-15 20:14:02,722 INFO L130 PetriNetUnfolder]: For 168/168 co-relation queries the response was YES. [2021-10-15 20:14:02,723 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1581 conditions, 675 events. 116/675 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 1264 event pairs, 0 based on Foata normal form. 10/685 useless extension candidates. Maximal degree in co-relation 1127. Up to 525 conditions per place. [2021-10-15 20:14:02,728 INFO L132 encePairwiseOnDemand]: 323/344 looper letters, 378 selfloop transitions, 11 changer transitions 0/394 dead transitions. [2021-10-15 20:14:02,729 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 394 transitions, 2046 flow [2021-10-15 20:14:02,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 20:14:02,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 20:14:02,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2021-10-15 20:14:02,733 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.3808139534883721 [2021-10-15 20:14:02,733 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 393 transitions. [2021-10-15 20:14:02,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 393 transitions. [2021-10-15 20:14:02,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 20:14:02,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 393 transitions. [2021-10-15 20:14:02,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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-15 20:14:02,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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-15 20:14:02,741 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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-15 20:14:02,742 INFO L186 Difference]: Start difference. First operand has 149 places, 248 transitions, 952 flow. Second operand 3 states and 393 transitions. [2021-10-15 20:14:02,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 394 transitions, 2046 flow [2021-10-15 20:14:02,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 394 transitions, 1974 flow, removed 6 selfloop flow, removed 2 redundant places. [2021-10-15 20:14:02,780 INFO L242 Difference]: Finished difference. Result has 150 places, 258 transitions, 997 flow [2021-10-15 20:14:02,781 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=997, PETRI_PLACES=150, PETRI_TRANSITIONS=258} [2021-10-15 20:14:02,782 INFO L334 CegarLoopForPetriNet]: 203 programPoint places, -53 predicate places. [2021-10-15 20:14:02,782 INFO L470 AbstractCegarLoop]: Abstraction has has 150 places, 258 transitions, 997 flow [2021-10-15 20:14:02,782 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-15 20:14:02,783 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 20:14:02,783 INFO L254 CegarLoopForPetriNet]: trace histogram [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] [2021-10-15 20:14:02,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-15 20:14:02,784 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 20:14:02,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 20:14:02,784 INFO L82 PathProgramCache]: Analyzing trace with hash 2122890084, now seen corresponding path program 1 times [2021-10-15 20:14:02,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 20:14:02,785 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243011593] [2021-10-15 20:14:02,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:14:02,786 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 20:14:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 20:14:02,856 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 20:14:02,857 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 20:14:02,857 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243011593] [2021-10-15 20:14:02,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243011593] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 20:14:02,858 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 20:14:02,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 20:14:02,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239102566] [2021-10-15 20:14:02,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 20:14:02,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 20:14:02,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 20:14:02,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 20:14:02,862 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 344 [2021-10-15 20:14:02,863 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 258 transitions, 997 flow. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 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-15 20:14:02,863 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 20:14:02,863 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 344 [2021-10-15 20:14:02,863 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 20:14:03,908 INFO L129 PetriNetUnfolder]: 221/1197 cut-off events. [2021-10-15 20:14:03,908 INFO L130 PetriNetUnfolder]: For 236/236 co-relation queries the response was YES. [2021-10-15 20:14:03,909 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2832 conditions, 1197 events. 221/1197 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2778 event pairs, 0 based on Foata normal form. 1/1198 useless extension candidates. Maximal degree in co-relation 1245. Up to 748 conditions per place. [2021-10-15 20:14:03,917 INFO L132 encePairwiseOnDemand]: 267/344 looper letters, 387 selfloop transitions, 107 changer transitions 0/499 dead transitions. [2021-10-15 20:14:03,918 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 499 transitions, 2887 flow [2021-10-15 20:14:03,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 20:14:03,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 20:14:03,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2021-10-15 20:14:03,921 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.43507751937984496 [2021-10-15 20:14:03,921 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2021-10-15 20:14:03,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2021-10-15 20:14:03,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 20:14:03,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2021-10-15 20:14:03,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 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-15 20:14:03,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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-15 20:14:03,929 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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-15 20:14:03,929 INFO L186 Difference]: Start difference. First operand has 150 places, 258 transitions, 997 flow. Second operand 3 states and 449 transitions. [2021-10-15 20:14:03,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 499 transitions, 2887 flow [2021-10-15 20:14:03,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 499 transitions, 2868 flow, removed 4 selfloop flow, removed 1 redundant places. [2021-10-15 20:14:03,962 INFO L242 Difference]: Finished difference. Result has 153 places, 363 transitions, 2248 flow [2021-10-15 20:14:03,963 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=978, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2248, PETRI_PLACES=153, PETRI_TRANSITIONS=363} [2021-10-15 20:14:03,963 INFO L334 CegarLoopForPetriNet]: 203 programPoint places, -50 predicate places. [2021-10-15 20:14:03,963 INFO L470 AbstractCegarLoop]: Abstraction has has 153 places, 363 transitions, 2248 flow [2021-10-15 20:14:03,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 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-15 20:14:03,964 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 20:14:03,964 INFO L254 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1] [2021-10-15 20:14:03,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-15 20:14:03,964 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 20:14:03,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 20:14:03,965 INFO L82 PathProgramCache]: Analyzing trace with hash 2121280980, now seen corresponding path program 1 times [2021-10-15 20:14:03,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 20:14:03,965 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90049519] [2021-10-15 20:14:03,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:14:03,966 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 20:14:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 20:14:04,181 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 20:14:04,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 20:14:04,187 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90049519] [2021-10-15 20:14:04,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90049519] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 20:14:04,188 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 20:14:04,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 20:14:04,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959327368] [2021-10-15 20:14:04,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-15 20:14:04,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 20:14:04,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-15 20:14:04,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-15 20:14:04,195 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 344 [2021-10-15 20:14:04,196 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 363 transitions, 2248 flow. Second operand has 4 states, 4 states have (on average 38.75) 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-15 20:14:04,196 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 20:14:04,196 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 344 [2021-10-15 20:14:04,196 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 20:14:05,541 INFO L129 PetriNetUnfolder]: 216/1206 cut-off events. [2021-10-15 20:14:05,541 INFO L130 PetriNetUnfolder]: For 973/973 co-relation queries the response was YES. [2021-10-15 20:14:05,543 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3146 conditions, 1206 events. 216/1206 cut-off events. For 973/973 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 2784 event pairs, 0 based on Foata normal form. 5/1211 useless extension candidates. Maximal degree in co-relation 1997. Up to 871 conditions per place. [2021-10-15 20:14:05,553 INFO L132 encePairwiseOnDemand]: 279/344 looper letters, 316 selfloop transitions, 177 changer transitions 0/497 dead transitions. [2021-10-15 20:14:05,553 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 497 transitions, 3484 flow [2021-10-15 20:14:05,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-15 20:14:05,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-10-15 20:14:05,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 398 transitions. [2021-10-15 20:14:05,557 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.2313953488372093 [2021-10-15 20:14:05,557 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 398 transitions. [2021-10-15 20:14:05,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 398 transitions. [2021-10-15 20:14:05,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 20:14:05,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 398 transitions. [2021-10-15 20:14:05,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 79.6) internal successors, (398), 5 states have internal predecessors, (398), 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-15 20:14:05,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 344.0) internal successors, (2064), 6 states have internal predecessors, (2064), 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-15 20:14:05,567 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 344.0) internal successors, (2064), 6 states have internal predecessors, (2064), 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-15 20:14:05,568 INFO L186 Difference]: Start difference. First operand has 153 places, 363 transitions, 2248 flow. Second operand 5 states and 398 transitions. [2021-10-15 20:14:05,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 497 transitions, 3484 flow [2021-10-15 20:14:05,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 497 transitions, 3232 flow, removed 20 selfloop flow, removed 2 redundant places. [2021-10-15 20:14:05,610 INFO L242 Difference]: Finished difference. Result has 158 places, 361 transitions, 2517 flow [2021-10-15 20:14:05,611 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=1968, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2517, PETRI_PLACES=158, PETRI_TRANSITIONS=361} [2021-10-15 20:14:05,611 INFO L334 CegarLoopForPetriNet]: 203 programPoint places, -45 predicate places. [2021-10-15 20:14:05,611 INFO L470 AbstractCegarLoop]: Abstraction has has 158 places, 361 transitions, 2517 flow [2021-10-15 20:14:05,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) 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-15 20:14:05,612 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 20:14:05,614 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 20:14:05,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-15 20:14:05,615 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 20:14:05,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 20:14:05,616 INFO L82 PathProgramCache]: Analyzing trace with hash 622895154, now seen corresponding path program 1 times [2021-10-15 20:14:05,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 20:14:05,616 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310937372] [2021-10-15 20:14:05,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:14:05,617 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 20:14:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 20:14:05,918 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 20:14:05,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 20:14:05,918 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310937372] [2021-10-15 20:14:05,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310937372] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 20:14:05,919 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 20:14:05,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-15 20:14:05,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163653432] [2021-10-15 20:14:05,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-15 20:14:05,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 20:14:05,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-15 20:14:05,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-10-15 20:14:05,924 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 344 [2021-10-15 20:14:05,925 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 361 transitions, 2517 flow. Second operand has 7 states, 7 states have (on average 30.428571428571427) internal successors, (213), 7 states have internal predecessors, (213), 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-15 20:14:05,925 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 20:14:05,925 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 344 [2021-10-15 20:14:05,926 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 20:14:07,254 INFO L129 PetriNetUnfolder]: 215/1260 cut-off events. [2021-10-15 20:14:07,255 INFO L130 PetriNetUnfolder]: For 1781/1781 co-relation queries the response was YES. [2021-10-15 20:14:07,257 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3329 conditions, 1260 events. 215/1260 cut-off events. For 1781/1781 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2642 event pairs, 0 based on Foata normal form. 1/1261 useless extension candidates. Maximal degree in co-relation 2152. Up to 1164 conditions per place. [2021-10-15 20:14:07,266 INFO L132 encePairwiseOnDemand]: 338/344 looper letters, 348 selfloop transitions, 1 changer transitions 56/412 dead transitions. [2021-10-15 20:14:07,267 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 412 transitions, 3429 flow [2021-10-15 20:14:07,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-15 20:14:07,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-10-15 20:14:07,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 321 transitions. [2021-10-15 20:14:07,271 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.13330564784053156 [2021-10-15 20:14:07,271 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 321 transitions. [2021-10-15 20:14:07,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 321 transitions. [2021-10-15 20:14:07,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 20:14:07,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 321 transitions. [2021-10-15 20:14:07,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 45.857142857142854) internal successors, (321), 7 states have internal predecessors, (321), 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-15 20:14:07,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 344.0) internal successors, (2752), 8 states have internal predecessors, (2752), 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-15 20:14:07,283 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 344.0) internal successors, (2752), 8 states have internal predecessors, (2752), 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-15 20:14:07,283 INFO L186 Difference]: Start difference. First operand has 158 places, 361 transitions, 2517 flow. Second operand 7 states and 321 transitions. [2021-10-15 20:14:07,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 412 transitions, 3429 flow [2021-10-15 20:14:07,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 412 transitions, 3423 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-10-15 20:14:07,333 INFO L242 Difference]: Finished difference. Result has 167 places, 356 transitions, 2483 flow [2021-10-15 20:14:07,334 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=2511, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2483, PETRI_PLACES=167, PETRI_TRANSITIONS=356} [2021-10-15 20:14:07,334 INFO L334 CegarLoopForPetriNet]: 203 programPoint places, -36 predicate places. [2021-10-15 20:14:07,334 INFO L470 AbstractCegarLoop]: Abstraction has has 167 places, 356 transitions, 2483 flow [2021-10-15 20:14:07,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.428571428571427) internal successors, (213), 7 states have internal predecessors, (213), 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-15 20:14:07,335 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 20:14:07,337 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-10-15 20:14:07,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-15 20:14:07,338 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 20:14:07,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 20:14:07,338 INFO L82 PathProgramCache]: Analyzing trace with hash 995871704, now seen corresponding path program 1 times [2021-10-15 20:14:07,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 20:14:07,339 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123497508] [2021-10-15 20:14:07,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:14:07,340 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 20:14:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 20:14:07,498 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 20:14:07,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 20:14:07,499 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123497508] [2021-10-15 20:14:07,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123497508] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 20:14:07,500 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 20:14:07,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 20:14:07,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632991578] [2021-10-15 20:14:07,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 20:14:07,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 20:14:07,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 20:14:07,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 20:14:07,509 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 344 [2021-10-15 20:14:07,510 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 356 transitions, 2483 flow. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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-15 20:14:07,510 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 20:14:07,510 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 344 [2021-10-15 20:14:07,510 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 20:14:08,688 INFO L129 PetriNetUnfolder]: 282/1553 cut-off events. [2021-10-15 20:14:08,688 INFO L130 PetriNetUnfolder]: For 3044/3044 co-relation queries the response was YES. [2021-10-15 20:14:08,692 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4210 conditions, 1553 events. 282/1553 cut-off events. For 3044/3044 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 3963 event pairs, 0 based on Foata normal form. 78/1631 useless extension candidates. Maximal degree in co-relation 4189. Up to 1158 conditions per place. [2021-10-15 20:14:08,703 INFO L132 encePairwiseOnDemand]: 269/344 looper letters, 461 selfloop transitions, 95 changer transitions 0/563 dead transitions. [2021-10-15 20:14:08,704 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 563 transitions, 4613 flow [2021-10-15 20:14:08,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 20:14:08,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 20:14:08,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 447 transitions. [2021-10-15 20:14:08,707 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4331395348837209 [2021-10-15 20:14:08,707 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 447 transitions. [2021-10-15 20:14:08,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 447 transitions. [2021-10-15 20:14:08,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 20:14:08,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 447 transitions. [2021-10-15 20:14:08,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 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-15 20:14:08,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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-15 20:14:08,714 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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-15 20:14:08,714 INFO L186 Difference]: Start difference. First operand has 167 places, 356 transitions, 2483 flow. Second operand 3 states and 447 transitions. [2021-10-15 20:14:08,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 563 transitions, 4613 flow [2021-10-15 20:14:08,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 563 transitions, 4596 flow, removed 8 selfloop flow, removed 5 redundant places. [2021-10-15 20:14:08,763 INFO L242 Difference]: Finished difference. Result has 162 places, 427 transitions, 3856 flow [2021-10-15 20:14:08,764 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=2474, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3856, PETRI_PLACES=162, PETRI_TRANSITIONS=427} [2021-10-15 20:14:08,764 INFO L334 CegarLoopForPetriNet]: 203 programPoint places, -41 predicate places. [2021-10-15 20:14:08,764 INFO L470 AbstractCegarLoop]: Abstraction has has 162 places, 427 transitions, 3856 flow [2021-10-15 20:14:08,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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-15 20:14:08,765 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 20:14:08,766 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-10-15 20:14:08,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-15 20:14:08,766 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 20:14:08,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 20:14:08,767 INFO L82 PathProgramCache]: Analyzing trace with hash -682754927, now seen corresponding path program 1 times [2021-10-15 20:14:08,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 20:14:08,767 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024341398] [2021-10-15 20:14:08,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:14:08,768 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 20:14:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 20:14:09,046 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 38 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 20:14:09,046 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 20:14:09,047 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024341398] [2021-10-15 20:14:09,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024341398] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-15 20:14:09,047 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402070571] [2021-10-15 20:14:09,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:14:09,048 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-15 20:14:09,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddee9d1a-a54b-41ca-abec-aff9b9c5dfaa/bin/uautomizer-hJ6jxDFKc3/z3 [2021-10-15 20:14:09,059 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddee9d1a-a54b-41ca-abec-aff9b9c5dfaa/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-15 20:14:09,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddee9d1a-a54b-41ca-abec-aff9b9c5dfaa/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-15 20:14:09,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 20:14:09,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-15 20:14:09,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-15 20:14:10,082 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2021-10-15 20:14:10,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402070571] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 20:14:10,083 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-15 20:14:10,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2021-10-15 20:14:10,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117037187] [2021-10-15 20:14:10,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 20:14:10,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 20:14:10,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 20:14:10,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-15 20:14:10,086 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 344 [2021-10-15 20:14:10,087 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 427 transitions, 3856 flow. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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-15 20:14:10,087 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 20:14:10,087 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 344 [2021-10-15 20:14:10,087 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 20:14:11,383 INFO L129 PetriNetUnfolder]: 226/1781 cut-off events. [2021-10-15 20:14:11,384 INFO L130 PetriNetUnfolder]: For 4732/4732 co-relation queries the response was YES. [2021-10-15 20:14:11,387 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4669 conditions, 1781 events. 226/1781 cut-off events. For 4732/4732 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 4965 event pairs, 0 based on Foata normal form. 110/1891 useless extension candidates. Maximal degree in co-relation 4651. Up to 1420 conditions per place. [2021-10-15 20:14:11,398 INFO L132 encePairwiseOnDemand]: 299/344 looper letters, 436 selfloop transitions, 64 changer transitions 0/507 dead transitions. [2021-10-15 20:14:11,398 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 507 transitions, 4416 flow [2021-10-15 20:14:11,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 20:14:11,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 20:14:11,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2021-10-15 20:14:11,401 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.40310077519379844 [2021-10-15 20:14:11,401 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 416 transitions. [2021-10-15 20:14:11,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 416 transitions. [2021-10-15 20:14:11,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 20:14:11,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 416 transitions. [2021-10-15 20:14:11,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 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-15 20:14:11,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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-15 20:14:11,407 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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-15 20:14:11,407 INFO L186 Difference]: Start difference. First operand has 162 places, 427 transitions, 3856 flow. Second operand 3 states and 416 transitions. [2021-10-15 20:14:11,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 507 transitions, 4416 flow [2021-10-15 20:14:11,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 507 transitions, 4038 flow, removed 113 selfloop flow, removed 2 redundant places. [2021-10-15 20:14:11,500 INFO L242 Difference]: Finished difference. Result has 164 places, 371 transitions, 3080 flow [2021-10-15 20:14:11,501 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=2530, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3080, PETRI_PLACES=164, PETRI_TRANSITIONS=371} [2021-10-15 20:14:11,501 INFO L334 CegarLoopForPetriNet]: 203 programPoint places, -39 predicate places. [2021-10-15 20:14:11,501 INFO L470 AbstractCegarLoop]: Abstraction has has 164 places, 371 transitions, 3080 flow [2021-10-15 20:14:11,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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-15 20:14:11,502 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 20:14:11,502 INFO L254 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:14:11,539 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddee9d1a-a54b-41ca-abec-aff9b9c5dfaa/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-15 20:14:11,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddee9d1a-a54b-41ca-abec-aff9b9c5dfaa/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-10-15 20:14:11,716 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 20:14:11,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 20:14:11,717 INFO L82 PathProgramCache]: Analyzing trace with hash -118434025, now seen corresponding path program 1 times [2021-10-15 20:14:11,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 20:14:11,717 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764986497] [2021-10-15 20:14:11,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:14:11,718 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 20:14:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 20:14:11,918 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-10-15 20:14:11,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 20:14:11,919 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764986497] [2021-10-15 20:14:11,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764986497] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 20:14:11,919 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 20:14:11,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 20:14:11,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366124625] [2021-10-15 20:14:11,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 20:14:11,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 20:14:11,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 20:14:11,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 20:14:11,923 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 344 [2021-10-15 20:14:11,924 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 371 transitions, 3080 flow. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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-15 20:14:11,924 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 20:14:11,924 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 344 [2021-10-15 20:14:11,925 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 20:14:13,415 INFO L129 PetriNetUnfolder]: 256/2092 cut-off events. [2021-10-15 20:14:13,416 INFO L130 PetriNetUnfolder]: For 4453/4453 co-relation queries the response was YES. [2021-10-15 20:14:13,421 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5404 conditions, 2092 events. 256/2092 cut-off events. For 4453/4453 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 6918 event pairs, 0 based on Foata normal form. 69/2161 useless extension candidates. Maximal degree in co-relation 5383. Up to 1722 conditions per place. [2021-10-15 20:14:13,433 INFO L132 encePairwiseOnDemand]: 294/344 looper letters, 480 selfloop transitions, 50 changer transitions 0/537 dead transitions. [2021-10-15 20:14:13,433 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 537 transitions, 4786 flow [2021-10-15 20:14:13,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 20:14:13,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 20:14:13,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2021-10-15 20:14:13,436 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.40891472868217055 [2021-10-15 20:14:13,437 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2021-10-15 20:14:13,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2021-10-15 20:14:13,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 20:14:13,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2021-10-15 20:14:13,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 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-15 20:14:13,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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-15 20:14:13,442 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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-15 20:14:13,443 INFO L186 Difference]: Start difference. First operand has 164 places, 371 transitions, 3080 flow. Second operand 3 states and 422 transitions. [2021-10-15 20:14:13,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 537 transitions, 4786 flow [2021-10-15 20:14:13,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 537 transitions, 4620 flow, removed 19 selfloop flow, removed 2 redundant places. [2021-10-15 20:14:13,498 INFO L242 Difference]: Finished difference. Result has 166 places, 401 transitions, 3668 flow [2021-10-15 20:14:13,499 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=2914, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3668, PETRI_PLACES=166, PETRI_TRANSITIONS=401} [2021-10-15 20:14:13,499 INFO L334 CegarLoopForPetriNet]: 203 programPoint places, -37 predicate places. [2021-10-15 20:14:13,499 INFO L470 AbstractCegarLoop]: Abstraction has has 166 places, 401 transitions, 3668 flow [2021-10-15 20:14:13,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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-15 20:14:13,500 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 20:14:13,500 INFO L254 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:14:13,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-15 20:14:13,501 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 20:14:13,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 20:14:13,501 INFO L82 PathProgramCache]: Analyzing trace with hash 242120446, now seen corresponding path program 1 times [2021-10-15 20:14:13,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 20:14:13,502 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948849344] [2021-10-15 20:14:13,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:14:13,502 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 20:14:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 20:14:13,762 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 115 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 20:14:13,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 20:14:13,768 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948849344] [2021-10-15 20:14:13,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948849344] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-15 20:14:13,770 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573795056] [2021-10-15 20:14:13,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:14:13,770 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-15 20:14:13,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddee9d1a-a54b-41ca-abec-aff9b9c5dfaa/bin/uautomizer-hJ6jxDFKc3/z3 [2021-10-15 20:14:13,771 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddee9d1a-a54b-41ca-abec-aff9b9c5dfaa/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-15 20:14:13,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddee9d1a-a54b-41ca-abec-aff9b9c5dfaa/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-15 20:14:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 20:14:13,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-15 20:14:13,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-15 20:14:15,285 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-10-15 20:14:15,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573795056] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 20:14:15,286 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-15 20:14:15,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2021-10-15 20:14:15,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800806490] [2021-10-15 20:14:15,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-15 20:14:15,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 20:14:15,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-15 20:14:15,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-15 20:14:15,292 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 344 [2021-10-15 20:14:15,293 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 401 transitions, 3668 flow. Second operand has 4 states, 4 states have (on average 74.25) internal successors, (297), 4 states have internal predecessors, (297), 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-15 20:14:15,293 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 20:14:15,293 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 344 [2021-10-15 20:14:15,293 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 20:14:17,801 INFO L129 PetriNetUnfolder]: 444/3977 cut-off events. [2021-10-15 20:14:17,801 INFO L130 PetriNetUnfolder]: For 7339/7339 co-relation queries the response was YES. [2021-10-15 20:14:17,808 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10196 conditions, 3977 events. 444/3977 cut-off events. For 7339/7339 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 19950 event pairs, 0 based on Foata normal form. 45/4022 useless extension candidates. Maximal degree in co-relation 10175. Up to 1848 conditions per place. [2021-10-15 20:14:17,830 INFO L132 encePairwiseOnDemand]: 272/344 looper letters, 624 selfloop transitions, 231 changer transitions 0/862 dead transitions. [2021-10-15 20:14:17,831 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 862 transitions, 8302 flow [2021-10-15 20:14:17,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-15 20:14:17,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-10-15 20:14:17,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 641 transitions. [2021-10-15 20:14:17,835 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.46584302325581395 [2021-10-15 20:14:17,835 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 641 transitions. [2021-10-15 20:14:17,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 641 transitions. [2021-10-15 20:14:17,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 20:14:17,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 641 transitions. [2021-10-15 20:14:17,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 160.25) internal successors, (641), 4 states have internal predecessors, (641), 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-15 20:14:17,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 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-15 20:14:17,842 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 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-15 20:14:17,842 INFO L186 Difference]: Start difference. First operand has 166 places, 401 transitions, 3668 flow. Second operand 4 states and 641 transitions. [2021-10-15 20:14:17,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 862 transitions, 8302 flow [2021-10-15 20:14:17,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 862 transitions, 7882 flow, removed 125 selfloop flow, removed 2 redundant places. [2021-10-15 20:14:17,980 INFO L242 Difference]: Finished difference. Result has 170 places, 577 transitions, 6794 flow [2021-10-15 20:14:17,981 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=3432, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=6794, PETRI_PLACES=170, PETRI_TRANSITIONS=577} [2021-10-15 20:14:17,982 INFO L334 CegarLoopForPetriNet]: 203 programPoint places, -33 predicate places. [2021-10-15 20:14:17,982 INFO L470 AbstractCegarLoop]: Abstraction has has 170 places, 577 transitions, 6794 flow [2021-10-15 20:14:17,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 4 states have internal predecessors, (297), 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-15 20:14:17,982 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 20:14:17,983 INFO L254 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:14:18,017 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddee9d1a-a54b-41ca-abec-aff9b9c5dfaa/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-15 20:14:18,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddee9d1a-a54b-41ca-abec-aff9b9c5dfaa/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-10-15 20:14:18,199 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 20:14:18,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 20:14:18,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1393973778, now seen corresponding path program 1 times [2021-10-15 20:14:18,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 20:14:18,200 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511752786] [2021-10-15 20:14:18,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:14:18,200 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 20:14:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 20:14:18,343 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-10-15 20:14:18,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 20:14:18,344 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511752786] [2021-10-15 20:14:18,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511752786] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 20:14:18,344 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 20:14:18,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 20:14:18,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352214844] [2021-10-15 20:14:18,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 20:14:18,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 20:14:18,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 20:14:18,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 20:14:18,348 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 344 [2021-10-15 20:14:18,348 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 577 transitions, 6794 flow. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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-15 20:14:18,348 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 20:14:18,349 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 344 [2021-10-15 20:14:18,349 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 20:14:21,366 INFO L129 PetriNetUnfolder]: 480/4865 cut-off events. [2021-10-15 20:14:21,366 INFO L130 PetriNetUnfolder]: For 12683/12683 co-relation queries the response was YES. [2021-10-15 20:14:21,374 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12598 conditions, 4865 events. 480/4865 cut-off events. For 12683/12683 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 27706 event pairs, 0 based on Foata normal form. 107/4972 useless extension candidates. Maximal degree in co-relation 12573. Up to 3507 conditions per place. [2021-10-15 20:14:21,395 INFO L132 encePairwiseOnDemand]: 275/344 looper letters, 611 selfloop transitions, 131 changer transitions 0/749 dead transitions. [2021-10-15 20:14:21,395 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 749 transitions, 9000 flow [2021-10-15 20:14:21,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 20:14:21,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 20:14:21,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 447 transitions. [2021-10-15 20:14:21,398 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4331395348837209 [2021-10-15 20:14:21,399 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 447 transitions. [2021-10-15 20:14:21,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 447 transitions. [2021-10-15 20:14:21,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 20:14:21,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 447 transitions. [2021-10-15 20:14:21,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 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-15 20:14:21,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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-15 20:14:21,404 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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-15 20:14:21,404 INFO L186 Difference]: Start difference. First operand has 170 places, 577 transitions, 6794 flow. Second operand 3 states and 447 transitions. [2021-10-15 20:14:21,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 749 transitions, 9000 flow [2021-10-15 20:14:21,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 749 transitions, 8982 flow, removed 9 selfloop flow, removed 0 redundant places. [2021-10-15 20:14:21,549 INFO L242 Difference]: Finished difference. Result has 174 places, 599 transitions, 7774 flow [2021-10-15 20:14:21,550 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=6200, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=7774, PETRI_PLACES=174, PETRI_TRANSITIONS=599} [2021-10-15 20:14:21,551 INFO L334 CegarLoopForPetriNet]: 203 programPoint places, -29 predicate places. [2021-10-15 20:14:21,551 INFO L470 AbstractCegarLoop]: Abstraction has has 174 places, 599 transitions, 7774 flow [2021-10-15 20:14:21,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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-15 20:14:21,551 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 20:14:21,552 INFO L254 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 20:14:21,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-15 20:14:21,552 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 20:14:21,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 20:14:21,553 INFO L82 PathProgramCache]: Analyzing trace with hash 174744783, now seen corresponding path program 1 times [2021-10-15 20:14:21,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 20:14:21,553 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636792094] [2021-10-15 20:14:21,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:14:21,554 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 20:14:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 20:14:21,690 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-10-15 20:14:21,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 20:14:21,690 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636792094] [2021-10-15 20:14:21,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636792094] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 20:14:21,691 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 20:14:21,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 20:14:21,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867228206] [2021-10-15 20:14:21,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 20:14:21,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 20:14:21,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 20:14:21,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 20:14:21,694 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 344 [2021-10-15 20:14:21,695 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 599 transitions, 7774 flow. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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-15 20:14:21,695 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 20:14:21,695 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 344 [2021-10-15 20:14:21,695 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 20:14:24,778 INFO L129 PetriNetUnfolder]: 563/5513 cut-off events. [2021-10-15 20:14:24,778 INFO L130 PetriNetUnfolder]: For 16206/16206 co-relation queries the response was YES. [2021-10-15 20:14:24,789 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14889 conditions, 5513 events. 563/5513 cut-off events. For 16206/16206 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 33614 event pairs, 0 based on Foata normal form. 30/5543 useless extension candidates. Maximal degree in co-relation 14862. Up to 2895 conditions per place. [2021-10-15 20:14:24,807 INFO L132 encePairwiseOnDemand]: 272/344 looper letters, 576 selfloop transitions, 237 changer transitions 0/820 dead transitions. [2021-10-15 20:14:24,808 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 820 transitions, 11186 flow [2021-10-15 20:14:24,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 20:14:24,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 20:14:24,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2021-10-15 20:14:24,811 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4321705426356589 [2021-10-15 20:14:24,811 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2021-10-15 20:14:24,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2021-10-15 20:14:24,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 20:14:24,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2021-10-15 20:14:24,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 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-15 20:14:24,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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-15 20:14:24,818 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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-15 20:14:24,818 INFO L186 Difference]: Start difference. First operand has 174 places, 599 transitions, 7774 flow. Second operand 3 states and 446 transitions. [2021-10-15 20:14:24,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 820 transitions, 11186 flow [2021-10-15 20:14:24,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 820 transitions, 10884 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-15 20:14:24,934 INFO L242 Difference]: Finished difference. Result has 176 places, 680 transitions, 10086 flow [2021-10-15 20:14:24,935 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=7432, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=594, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=10086, PETRI_PLACES=176, PETRI_TRANSITIONS=680} [2021-10-15 20:14:24,936 INFO L334 CegarLoopForPetriNet]: 203 programPoint places, -27 predicate places. [2021-10-15 20:14:24,936 INFO L470 AbstractCegarLoop]: Abstraction has has 176 places, 680 transitions, 10086 flow [2021-10-15 20:14:24,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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-15 20:14:24,936 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 20:14:24,937 INFO L254 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-10-15 20:14:24,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-15 20:14:24,937 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 20:14:24,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 20:14:24,938 INFO L82 PathProgramCache]: Analyzing trace with hash 2099353207, now seen corresponding path program 1 times [2021-10-15 20:14:24,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 20:14:24,939 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943393188] [2021-10-15 20:14:24,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:14:24,939 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 20:14:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 20:14:25,155 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 56 proven. 134 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2021-10-15 20:14:25,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 20:14:25,155 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943393188] [2021-10-15 20:14:25,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943393188] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-15 20:14:25,156 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589247889] [2021-10-15 20:14:25,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:14:25,156 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-15 20:14:25,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddee9d1a-a54b-41ca-abec-aff9b9c5dfaa/bin/uautomizer-hJ6jxDFKc3/z3 [2021-10-15 20:14:25,159 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddee9d1a-a54b-41ca-abec-aff9b9c5dfaa/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-15 20:14:25,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddee9d1a-a54b-41ca-abec-aff9b9c5dfaa/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-15 20:14:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 20:14:25,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-15 20:14:25,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-15 20:14:26,373 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2021-10-15 20:14:26,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589247889] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 20:14:26,373 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-15 20:14:26,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-10-15 20:14:26,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573013850] [2021-10-15 20:14:26,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 20:14:26,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 20:14:26,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 20:14:26,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-15 20:14:26,376 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 344 [2021-10-15 20:14:26,376 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 680 transitions, 10086 flow. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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-15 20:14:26,377 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 20:14:26,377 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 344 [2021-10-15 20:14:26,377 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 20:14:29,921 INFO L129 PetriNetUnfolder]: 458/6109 cut-off events. [2021-10-15 20:14:29,922 INFO L130 PetriNetUnfolder]: For 24276/24276 co-relation queries the response was YES. [2021-10-15 20:14:29,931 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15846 conditions, 6109 events. 458/6109 cut-off events. For 24276/24276 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 40703 event pairs, 0 based on Foata normal form. 232/6341 useless extension candidates. Maximal degree in co-relation 15816. Up to 3917 conditions per place. [2021-10-15 20:14:29,946 INFO L132 encePairwiseOnDemand]: 289/344 looper letters, 629 selfloop transitions, 5 changer transitions 71/712 dead transitions. [2021-10-15 20:14:29,946 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 712 transitions, 10141 flow [2021-10-15 20:14:29,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 20:14:29,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 20:14:29,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2021-10-15 20:14:29,950 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.40794573643410853 [2021-10-15 20:14:29,950 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2021-10-15 20:14:29,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2021-10-15 20:14:29,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 20:14:29,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2021-10-15 20:14:29,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 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-15 20:14:29,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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-15 20:14:29,957 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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-15 20:14:29,957 INFO L186 Difference]: Start difference. First operand has 176 places, 680 transitions, 10086 flow. Second operand 3 states and 421 transitions. [2021-10-15 20:14:29,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 712 transitions, 10141 flow [2021-10-15 20:14:30,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 712 transitions, 9755 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-15 20:14:30,094 INFO L242 Difference]: Finished difference. Result has 177 places, 505 transitions, 7102 flow [2021-10-15 20:14:30,095 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=8071, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=7102, PETRI_PLACES=177, PETRI_TRANSITIONS=505} [2021-10-15 20:14:30,096 INFO L334 CegarLoopForPetriNet]: 203 programPoint places, -26 predicate places. [2021-10-15 20:14:30,096 INFO L470 AbstractCegarLoop]: Abstraction has has 177 places, 505 transitions, 7102 flow [2021-10-15 20:14:30,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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-15 20:14:30,096 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 20:14:30,097 INFO L254 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-10-15 20:14:30,142 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddee9d1a-a54b-41ca-abec-aff9b9c5dfaa/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-15 20:14:30,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddee9d1a-a54b-41ca-abec-aff9b9c5dfaa/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-15 20:14:30,323 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 20:14:30,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 20:14:30,324 INFO L82 PathProgramCache]: Analyzing trace with hash 2053809792, now seen corresponding path program 1 times [2021-10-15 20:14:30,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 20:14:30,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920695364] [2021-10-15 20:14:30,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:14:30,324 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 20:14:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-15 20:14:30,420 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-15 20:14:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-15 20:14:30,649 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-15 20:14:30,650 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-15 20:14:30,651 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-15 20:14:30,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-15 20:14:30,660 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-15 20:14:30,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 08:14:30 BoogieIcfgContainer [2021-10-15 20:14:30,870 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-15 20:14:30,870 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-15 20:14:30,870 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-15 20:14:30,871 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-15 20:14:30,871 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 08:13:58" (3/4) ... [2021-10-15 20:14:30,873 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-15 20:14:31,145 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddee9d1a-a54b-41ca-abec-aff9b9c5dfaa/bin/uautomizer-hJ6jxDFKc3/witness.graphml [2021-10-15 20:14:31,145 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-15 20:14:31,147 INFO L168 Benchmark]: Toolchain (without parser) took 35182.07 ms. Allocated memory was 90.2 MB in the beginning and 765.5 MB in the end (delta: 675.3 MB). Free memory was 68.1 MB in the beginning and 354.7 MB in the end (delta: -286.6 MB). Peak memory consumption was 388.2 MB. Max. memory is 16.1 GB. [2021-10-15 20:14:31,147 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 90.2 MB. Free memory is still 65.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-15 20:14:31,148 INFO L168 Benchmark]: CACSL2BoogieTranslator took 732.80 ms. Allocated memory is still 90.2 MB. Free memory was 67.9 MB in the beginning and 48.6 MB in the end (delta: 19.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-10-15 20:14:31,149 INFO L168 Benchmark]: Boogie Procedure Inliner took 135.70 ms. Allocated memory is still 90.2 MB. Free memory was 48.4 MB in the beginning and 40.6 MB in the end (delta: 7.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-15 20:14:31,149 INFO L168 Benchmark]: Boogie Preprocessor took 110.61 ms. Allocated memory was 90.2 MB in the beginning and 113.2 MB in the end (delta: 23.1 MB). Free memory was 40.6 MB in the beginning and 84.4 MB in the end (delta: -43.8 MB). Peak memory consumption was 12.2 MB. Max. memory is 16.1 GB. [2021-10-15 20:14:31,149 INFO L168 Benchmark]: RCFGBuilder took 1708.58 ms. Allocated memory is still 113.2 MB. Free memory was 84.3 MB in the beginning and 65.0 MB in the end (delta: 19.3 MB). Peak memory consumption was 42.9 MB. Max. memory is 16.1 GB. [2021-10-15 20:14:31,150 INFO L168 Benchmark]: TraceAbstraction took 32207.54 ms. Allocated memory was 113.2 MB in the beginning and 765.5 MB in the end (delta: 652.2 MB). Free memory was 65.0 MB in the beginning and 395.6 MB in the end (delta: -330.6 MB). Peak memory consumption was 322.4 MB. Max. memory is 16.1 GB. [2021-10-15 20:14:31,151 INFO L168 Benchmark]: Witness Printer took 274.82 ms. Allocated memory is still 765.5 MB. Free memory was 395.6 MB in the beginning and 354.7 MB in the end (delta: 40.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 16.1 GB. [2021-10-15 20:14:31,153 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.31 ms. Allocated memory is still 90.2 MB. Free memory is still 65.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 732.80 ms. Allocated memory is still 90.2 MB. Free memory was 67.9 MB in the beginning and 48.6 MB in the end (delta: 19.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 135.70 ms. Allocated memory is still 90.2 MB. Free memory was 48.4 MB in the beginning and 40.6 MB in the end (delta: 7.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 110.61 ms. Allocated memory was 90.2 MB in the beginning and 113.2 MB in the end (delta: 23.1 MB). Free memory was 40.6 MB in the beginning and 84.4 MB in the end (delta: -43.8 MB). Peak memory consumption was 12.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1708.58 ms. Allocated memory is still 113.2 MB. Free memory was 84.3 MB in the beginning and 65.0 MB in the end (delta: 19.3 MB). Peak memory consumption was 42.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 32207.54 ms. Allocated memory was 113.2 MB in the beginning and 765.5 MB in the end (delta: 652.2 MB). Free memory was 65.0 MB in the beginning and 395.6 MB in the end (delta: -330.6 MB). Peak memory consumption was 322.4 MB. Max. memory is 16.1 GB. * Witness Printer took 274.82 ms. Allocated memory is still 765.5 MB. Free memory was 395.6 MB in the beginning and 354.7 MB in the end (delta: 40.9 MB). Peak memory consumption was 41.9 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: 56]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int inputC = 3; [L18] int inputD = 4; [L19] int inputE = 5; [L20] int inputF = 6; [L21] int inputB = 2; [L24] int a1 = 23; [L25] int a19 = 9; [L26] int a10 = 0; [L27] int a12 = 0; [L28] int a4 = 14; VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L589] int output = -1; VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L322] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L336] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L355] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L361] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L364] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L367] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L380] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L385] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L413] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L429] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L435] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L440] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L446] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L452] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L458] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L475] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L481] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L486] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L491] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L497] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L503] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L509] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L514] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L519] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L527] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L533] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L536] COND FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L539] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L544] COND FALSE !(((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0)))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L550] COND TRUE ((a12==0) && (((((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0))) [L551] a1 = (((((a1 + -272193) - -47605) - -570122) % 89)+ 110) [L552] a10 = 1 [L554] return 25; VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] output = calculate_output(input) [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L322] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L336] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L355] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L361] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L364] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L367] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L380] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L385] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L413] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L429] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L435] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L440] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L446] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L452] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L458] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND TRUE ((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0)))) [L471] a1 = (((a1 / 5) + 105416) + 61704) [L472] a10 = 4 [L474] return 24; VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] output = calculate_output(input) [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L281] COND TRUE ((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0)) [L282] a1 = (((((a1 % 25)+ -8) * 5) % 25)+ 13) [L283] a10 = 1 [L284] a19 = 7 [L286] return -1; VAL [a1=13, a10=1, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] output = calculate_output(input) [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=13, a10=1, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=13, a10=1, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=13, a10=1, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=13, a10=1, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=13, a10=1, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=13, a10=1, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=13, a10=1, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=13, a10=1, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND TRUE (((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)) VAL [a1=13, a10=1, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] reach_error() VAL [a1=13, a10=1, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 31909.2ms, OverallIterations: 14, TraceHistogramMax: 4, EmptinessCheckTime: 0.0ms, AutomataDifference: 24087.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 145.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1354 SDtfs, 1256 SDslu, 3 SDs, 0 SdLazy, 5885 SolverSat, 823 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6546.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 914 GetRequests, 884 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 205.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=10086occurred in iteration=12, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 232.3ms SsaConstructionTime, 882.4ms SatisfiabilityAnalysisTime, 4884.9ms InterpolantComputationTime, 3753 NumberOfCodeBlocks, 3753 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3395 ConstructedInterpolants, 0 QuantifiedInterpolants, 15382 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1288 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 2075/2461 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-15 20:14:31,192 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddee9d1a-a54b-41ca-abec-aff9b9c5dfaa/bin/uautomizer-hJ6jxDFKc3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...