./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label12_false-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label12_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7c23175fa4336049a9379aeb3b34f319007ef752 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label12_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7c23175fa4336049a9379aeb3b34f319007ef752 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.1.23-1dbac8b [2018-10-26 22:48:56,704 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 22:48:56,706 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 22:48:56,716 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 22:48:56,716 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 22:48:56,717 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 22:48:56,718 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 22:48:56,719 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 22:48:56,721 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 22:48:56,722 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 22:48:56,722 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 22:48:56,723 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 22:48:56,723 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 22:48:56,724 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 22:48:56,726 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 22:48:56,726 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 22:48:56,727 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 22:48:56,728 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 22:48:56,730 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 22:48:56,731 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 22:48:56,732 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 22:48:56,734 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 22:48:56,735 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 22:48:56,736 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 22:48:56,736 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 22:48:56,737 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 22:48:56,738 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 22:48:56,739 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 22:48:56,739 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 22:48:56,740 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 22:48:56,740 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 22:48:56,742 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 22:48:56,742 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 22:48:56,742 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 22:48:56,743 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 22:48:56,743 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 22:48:56,744 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-26 22:48:56,755 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 22:48:56,755 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 22:48:56,756 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 22:48:56,756 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 22:48:56,757 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 22:48:56,757 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 22:48:56,758 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 22:48:56,758 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 22:48:56,758 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 22:48:56,758 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 22:48:56,758 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 22:48:56,758 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 22:48:56,758 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 22:48:56,759 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 22:48:56,759 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 22:48:56,759 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 22:48:56,759 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 22:48:56,759 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 22:48:56,759 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 22:48:56,760 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 22:48:56,760 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 22:48:56,760 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 22:48:56,760 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 22:48:56,760 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 22:48:56,760 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 22:48:56,760 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 22:48:56,761 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 22:48:56,761 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 22:48:56,763 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 22:48:56,763 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer 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(__VERIFIER_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 -> 7c23175fa4336049a9379aeb3b34f319007ef752 [2018-10-26 22:48:56,791 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 22:48:56,800 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 22:48:56,803 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 22:48:56,804 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 22:48:56,804 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 22:48:56,805 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem10_label12_false-unreach-call.c [2018-10-26 22:48:56,849 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/data/56e0e7315/1b7c228812944f948f835459378fb31d/FLAGd17822ed6 [2018-10-26 22:48:57,277 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 22:48:57,278 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/sv-benchmarks/c/eca-rers2012/Problem10_label12_false-unreach-call.c [2018-10-26 22:48:57,286 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/data/56e0e7315/1b7c228812944f948f835459378fb31d/FLAGd17822ed6 [2018-10-26 22:48:57,298 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/data/56e0e7315/1b7c228812944f948f835459378fb31d [2018-10-26 22:48:57,300 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 22:48:57,302 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 22:48:57,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 22:48:57,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 22:48:57,306 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 22:48:57,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:48:57" (1/1) ... [2018-10-26 22:48:57,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@255b6356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:48:57, skipping insertion in model container [2018-10-26 22:48:57,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:48:57" (1/1) ... [2018-10-26 22:48:57,317 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 22:48:57,358 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 22:48:57,656 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:48:57,664 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 22:48:57,785 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:48:57,797 INFO L193 MainTranslator]: Completed translation [2018-10-26 22:48:57,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:48:57 WrapperNode [2018-10-26 22:48:57,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 22:48:57,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 22:48:57,799 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 22:48:57,799 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 22:48:57,810 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:48:57" (1/1) ... [2018-10-26 22:48:57,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:48:57" (1/1) ... [2018-10-26 22:48:57,822 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:48:57" (1/1) ... [2018-10-26 22:48:57,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:48:57" (1/1) ... [2018-10-26 22:48:57,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:48:57" (1/1) ... [2018-10-26 22:48:57,959 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:48:57" (1/1) ... [2018-10-26 22:48:57,963 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:48:57" (1/1) ... [2018-10-26 22:48:57,968 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 22:48:57,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 22:48:57,976 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 22:48:57,976 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 22:48:57,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:48:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 22:48:58,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 22:48:58,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 22:48:58,030 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-26 22:48:58,030 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 22:48:58,031 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-26 22:48:58,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-10-26 22:48:58,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-10-26 22:48:58,031 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 22:48:58,031 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 22:48:58,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 22:48:58,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 22:49:00,423 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 22:49:00,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:49:00 BoogieIcfgContainer [2018-10-26 22:49:00,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 22:49:00,425 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 22:49:00,425 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 22:49:00,427 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 22:49:00,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:48:57" (1/3) ... [2018-10-26 22:49:00,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f34dbfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:49:00, skipping insertion in model container [2018-10-26 22:49:00,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:48:57" (2/3) ... [2018-10-26 22:49:00,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f34dbfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:49:00, skipping insertion in model container [2018-10-26 22:49:00,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:49:00" (3/3) ... [2018-10-26 22:49:00,430 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label12_false-unreach-call.c [2018-10-26 22:49:00,438 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 22:49:00,446 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 22:49:00,460 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 22:49:00,486 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 22:49:00,487 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 22:49:00,487 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 22:49:00,487 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 22:49:00,487 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 22:49:00,487 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 22:49:00,488 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 22:49:00,488 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 22:49:00,488 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 22:49:00,506 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-10-26 22:49:00,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-26 22:49:00,511 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:49:00,512 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:49:00,514 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:49:00,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:49:00,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1125399135, now seen corresponding path program 1 times [2018-10-26 22:49:00,520 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:49:00,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:49:00,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:49:00,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:49:00,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:49:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:49:00,799 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-26 22:49:00,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:49:00,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:49:00,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 22:49:00,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 22:49:00,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 22:49:00,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:49:00,929 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-10-26 22:49:01,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:49:01,946 INFO L93 Difference]: Finished difference Result 574 states and 992 transitions. [2018-10-26 22:49:01,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 22:49:01,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-26 22:49:01,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:49:01,962 INFO L225 Difference]: With dead ends: 574 [2018-10-26 22:49:01,962 INFO L226 Difference]: Without dead ends: 356 [2018-10-26 22:49:01,967 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:49:01,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-10-26 22:49:02,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-10-26 22:49:02,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-10-26 22:49:02,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 612 transitions. [2018-10-26 22:49:02,020 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 612 transitions. Word has length 19 [2018-10-26 22:49:02,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:49:02,020 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 612 transitions. [2018-10-26 22:49:02,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 22:49:02,021 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 612 transitions. [2018-10-26 22:49:02,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-26 22:49:02,024 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:49:02,024 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:49:02,025 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:49:02,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:49:02,025 INFO L82 PathProgramCache]: Analyzing trace with hash 407451016, now seen corresponding path program 1 times [2018-10-26 22:49:02,025 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:49:02,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:49:02,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:49:02,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:49:02,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:49:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:49:02,302 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 22:49:02,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:49:02,302 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:49:02,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:49:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:49:02,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:49:02,445 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:49:02,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:49:02,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-26 22:49:02,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 22:49:02,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 22:49:02,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:49:02,476 INFO L87 Difference]: Start difference. First operand 356 states and 612 transitions. Second operand 5 states. [2018-10-26 22:49:03,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:49:03,743 INFO L93 Difference]: Finished difference Result 1300 states and 2383 transitions. [2018-10-26 22:49:03,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 22:49:03,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-10-26 22:49:03,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:49:03,758 INFO L225 Difference]: With dead ends: 1300 [2018-10-26 22:49:03,759 INFO L226 Difference]: Without dead ends: 950 [2018-10-26 22:49:03,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 99 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-26 22:49:03,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2018-10-26 22:49:03,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 938. [2018-10-26 22:49:03,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2018-10-26 22:49:03,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1588 transitions. [2018-10-26 22:49:03,819 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1588 transitions. Word has length 97 [2018-10-26 22:49:03,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:49:03,819 INFO L481 AbstractCegarLoop]: Abstraction has 938 states and 1588 transitions. [2018-10-26 22:49:03,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 22:49:03,819 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1588 transitions. [2018-10-26 22:49:03,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-26 22:49:03,827 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:49:03,827 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:49:03,827 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:49:03,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:49:03,827 INFO L82 PathProgramCache]: Analyzing trace with hash 820279484, now seen corresponding path program 1 times [2018-10-26 22:49:03,828 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:49:03,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:49:03,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:49:03,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:49:03,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:49:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:49:04,092 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:49:04,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:49:04,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 22:49:04,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 22:49:04,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 22:49:04,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:49:04,094 INFO L87 Difference]: Start difference. First operand 938 states and 1588 transitions. Second operand 5 states. [2018-10-26 22:49:08,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:49:08,847 INFO L93 Difference]: Finished difference Result 2591 states and 4528 transitions. [2018-10-26 22:49:08,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 22:49:08,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2018-10-26 22:49:08,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:49:08,860 INFO L225 Difference]: With dead ends: 2591 [2018-10-26 22:49:08,860 INFO L226 Difference]: Without dead ends: 1659 [2018-10-26 22:49:08,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-26 22:49:08,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2018-10-26 22:49:08,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1645. [2018-10-26 22:49:08,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1645 states. [2018-10-26 22:49:08,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2781 transitions. [2018-10-26 22:49:08,917 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2781 transitions. Word has length 139 [2018-10-26 22:49:08,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:49:08,917 INFO L481 AbstractCegarLoop]: Abstraction has 1645 states and 2781 transitions. [2018-10-26 22:49:08,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 22:49:08,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2781 transitions. [2018-10-26 22:49:08,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-26 22:49:08,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:49:08,923 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:49:08,923 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:49:08,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:49:08,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1514660174, now seen corresponding path program 1 times [2018-10-26 22:49:08,924 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:49:08,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:49:08,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:49:08,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:49:08,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:49:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:49:09,390 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-26 22:49:09,614 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-26 22:49:09,844 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2018-10-26 22:49:09,960 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 93 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:49:09,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:49:09,960 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:49:09,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:49:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:49:10,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:49:10,256 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 93 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:49:10,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:49:10,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2018-10-26 22:49:10,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-26 22:49:10,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-26 22:49:10,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-10-26 22:49:10,283 INFO L87 Difference]: Start difference. First operand 1645 states and 2781 transitions. Second operand 16 states. [2018-10-26 22:49:10,604 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-26 22:49:12,611 WARN L179 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2018-10-26 22:49:15,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:49:15,971 INFO L93 Difference]: Finished difference Result 5102 states and 10145 transitions. [2018-10-26 22:49:15,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-26 22:49:15,972 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 210 [2018-10-26 22:49:15,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:49:16,003 INFO L225 Difference]: With dead ends: 5102 [2018-10-26 22:49:16,003 INFO L226 Difference]: Without dead ends: 3607 [2018-10-26 22:49:16,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=660, Invalid=2202, Unknown=0, NotChecked=0, Total=2862 [2018-10-26 22:49:16,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3607 states. [2018-10-26 22:49:16,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3607 to 3180. [2018-10-26 22:49:16,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3180 states. [2018-10-26 22:49:16,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3180 states to 3180 states and 4806 transitions. [2018-10-26 22:49:16,139 INFO L78 Accepts]: Start accepts. Automaton has 3180 states and 4806 transitions. Word has length 210 [2018-10-26 22:49:16,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:49:16,140 INFO L481 AbstractCegarLoop]: Abstraction has 3180 states and 4806 transitions. [2018-10-26 22:49:16,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-26 22:49:16,140 INFO L276 IsEmpty]: Start isEmpty. Operand 3180 states and 4806 transitions. [2018-10-26 22:49:16,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-10-26 22:49:16,148 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:49:16,148 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 22:49:16,148 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:49:16,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:49:16,148 INFO L82 PathProgramCache]: Analyzing trace with hash -343372249, now seen corresponding path program 1 times [2018-10-26 22:49:16,148 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:49:16,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:49:16,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:49:16,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:49:16,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:49:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:49:16,370 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 24 proven. 91 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 22:49:16,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:49:16,370 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:49:16,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:49:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:49:16,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:49:16,520 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 22:49:16,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:49:16,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2018-10-26 22:49:16,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 22:49:16,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 22:49:16,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-10-26 22:49:16,537 INFO L87 Difference]: Start difference. First operand 3180 states and 4806 transitions. Second operand 9 states. [2018-10-26 22:49:17,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:49:17,330 INFO L93 Difference]: Finished difference Result 6308 states and 10188 transitions. [2018-10-26 22:49:17,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 22:49:17,334 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 235 [2018-10-26 22:49:17,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:49:17,349 INFO L225 Difference]: With dead ends: 6308 [2018-10-26 22:49:17,349 INFO L226 Difference]: Without dead ends: 3278 [2018-10-26 22:49:17,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-10-26 22:49:17,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3278 states. [2018-10-26 22:49:17,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3278 to 3174. [2018-10-26 22:49:17,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3174 states. [2018-10-26 22:49:17,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3174 states to 3174 states and 4473 transitions. [2018-10-26 22:49:17,432 INFO L78 Accepts]: Start accepts. Automaton has 3174 states and 4473 transitions. Word has length 235 [2018-10-26 22:49:17,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:49:17,433 INFO L481 AbstractCegarLoop]: Abstraction has 3174 states and 4473 transitions. [2018-10-26 22:49:17,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 22:49:17,433 INFO L276 IsEmpty]: Start isEmpty. Operand 3174 states and 4473 transitions. [2018-10-26 22:49:17,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-26 22:49:17,440 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:49:17,440 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 22:49:17,440 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:49:17,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:49:17,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1120346683, now seen corresponding path program 1 times [2018-10-26 22:49:17,440 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:49:17,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:49:17,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:49:17,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:49:17,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:49:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:49:17,666 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 115 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 22:49:17,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:49:17,666 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:49:17,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:49:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:49:17,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:49:17,941 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 22:49:17,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:49:17,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2018-10-26 22:49:17,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 22:49:17,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 22:49:17,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-10-26 22:49:17,971 INFO L87 Difference]: Start difference. First operand 3174 states and 4473 transitions. Second operand 9 states. [2018-10-26 22:49:19,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:49:19,391 INFO L93 Difference]: Finished difference Result 7637 states and 11024 transitions. [2018-10-26 22:49:19,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-26 22:49:19,392 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 261 [2018-10-26 22:49:19,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:49:19,407 INFO L225 Difference]: With dead ends: 7637 [2018-10-26 22:49:19,407 INFO L226 Difference]: Without dead ends: 4613 [2018-10-26 22:49:19,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 270 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2018-10-26 22:49:19,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4613 states. [2018-10-26 22:49:19,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4613 to 4372. [2018-10-26 22:49:19,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4372 states. [2018-10-26 22:49:19,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4372 states to 4372 states and 5650 transitions. [2018-10-26 22:49:19,515 INFO L78 Accepts]: Start accepts. Automaton has 4372 states and 5650 transitions. Word has length 261 [2018-10-26 22:49:19,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:49:19,516 INFO L481 AbstractCegarLoop]: Abstraction has 4372 states and 5650 transitions. [2018-10-26 22:49:19,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 22:49:19,516 INFO L276 IsEmpty]: Start isEmpty. Operand 4372 states and 5650 transitions. [2018-10-26 22:49:19,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-10-26 22:49:19,528 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:49:19,528 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 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] [2018-10-26 22:49:19,528 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:49:19,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:49:19,529 INFO L82 PathProgramCache]: Analyzing trace with hash 581644974, now seen corresponding path program 1 times [2018-10-26 22:49:19,530 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:49:19,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:49:19,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:49:19,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:49:19,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:49:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:49:19,861 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-26 22:49:19,945 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 42 proven. 154 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-10-26 22:49:19,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:49:19,945 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:49:19,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:49:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:49:20,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:49:20,082 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 257 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 22:49:20,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:49:20,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-10-26 22:49:20,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 22:49:20,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 22:49:20,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-10-26 22:49:20,101 INFO L87 Difference]: Start difference. First operand 4372 states and 5650 transitions. Second operand 11 states. [2018-10-26 22:49:22,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:49:22,471 INFO L93 Difference]: Finished difference Result 10105 states and 13209 transitions. [2018-10-26 22:49:22,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-26 22:49:22,472 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 297 [2018-10-26 22:49:22,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:49:22,478 INFO L225 Difference]: With dead ends: 10105 [2018-10-26 22:49:22,479 INFO L226 Difference]: Without dead ends: 2121 [2018-10-26 22:49:22,497 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 307 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2018-10-26 22:49:22,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2018-10-26 22:49:22,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 1576. [2018-10-26 22:49:22,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2018-10-26 22:49:22,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1785 transitions. [2018-10-26 22:49:22,535 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1785 transitions. Word has length 297 [2018-10-26 22:49:22,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:49:22,535 INFO L481 AbstractCegarLoop]: Abstraction has 1576 states and 1785 transitions. [2018-10-26 22:49:22,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 22:49:22,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1785 transitions. [2018-10-26 22:49:22,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-10-26 22:49:22,541 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:49:22,541 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 22:49:22,541 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:49:22,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:49:22,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1230776758, now seen corresponding path program 1 times [2018-10-26 22:49:22,542 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:49:22,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:49:22,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:49:22,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:49:22,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:49:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:49:23,070 WARN L179 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 8 [2018-10-26 22:49:23,445 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-26 22:49:23,678 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 42 proven. 258 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-26 22:49:23,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:49:23,679 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:49:23,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:49:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:49:23,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:49:26,663 WARN L179 SmtUtils]: Spent 2.66 s on a formula simplification. DAG size of input: 90 DAG size of output: 32 [2018-10-26 22:49:26,934 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 293 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 22:49:26,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:49:26,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-10-26 22:49:26,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-26 22:49:26,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-26 22:49:26,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-10-26 22:49:26,962 INFO L87 Difference]: Start difference. First operand 1576 states and 1785 transitions. Second operand 16 states. [2018-10-26 22:49:58,855 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 36 [2018-10-26 22:50:40,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:50:40,362 INFO L93 Difference]: Finished difference Result 4965 states and 6096 transitions. [2018-10-26 22:50:40,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-26 22:50:40,362 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 333 [2018-10-26 22:50:40,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:50:40,375 INFO L225 Difference]: With dead ends: 4965 [2018-10-26 22:50:40,375 INFO L226 Difference]: Without dead ends: 3539 [2018-10-26 22:50:40,381 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 353 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=413, Invalid=1749, Unknown=0, NotChecked=0, Total=2162 [2018-10-26 22:50:40,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3539 states. [2018-10-26 22:50:40,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3539 to 2924. [2018-10-26 22:50:40,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2924 states. [2018-10-26 22:50:40,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2924 states to 2924 states and 3353 transitions. [2018-10-26 22:50:40,479 INFO L78 Accepts]: Start accepts. Automaton has 2924 states and 3353 transitions. Word has length 333 [2018-10-26 22:50:40,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:50:40,480 INFO L481 AbstractCegarLoop]: Abstraction has 2924 states and 3353 transitions. [2018-10-26 22:50:40,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-26 22:50:40,480 INFO L276 IsEmpty]: Start isEmpty. Operand 2924 states and 3353 transitions. [2018-10-26 22:50:40,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-10-26 22:50:40,488 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:50:40,489 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 22:50:40,490 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:50:40,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:50:40,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1230076619, now seen corresponding path program 1 times [2018-10-26 22:50:40,490 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:50:40,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:50:40,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:50:40,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:50:40,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:50:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:50:41,262 WARN L179 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2018-10-26 22:50:41,455 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-26 22:50:41,692 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-10-26 22:50:42,371 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 238 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:50:42,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:50:42,371 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:50:42,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:50:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:50:42,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:50:42,892 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-26 22:51:21,616 WARN L179 SmtUtils]: Spent 36.40 s on a formula simplification. DAG size of input: 271 DAG size of output: 50 [2018-10-26 22:51:24,428 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 42 proven. 199 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-26 22:51:24,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:51:24,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12] total 30 [2018-10-26 22:51:24,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-26 22:51:24,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-26 22:51:24,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=762, Unknown=2, NotChecked=0, Total=870 [2018-10-26 22:51:24,446 INFO L87 Difference]: Start difference. First operand 2924 states and 3353 transitions. Second operand 30 states. [2018-10-26 22:51:24,675 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 21 [2018-10-26 22:51:25,745 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 23 [2018-10-26 22:52:02,059 WARN L179 SmtUtils]: Spent 34.32 s on a formula simplification. DAG size of input: 104 DAG size of output: 70 [2018-10-26 22:52:35,715 WARN L179 SmtUtils]: Spent 33.51 s on a formula simplification. DAG size of input: 95 DAG size of output: 67 [2018-10-26 22:52:54,409 WARN L179 SmtUtils]: Spent 18.58 s on a formula simplification. DAG size of input: 84 DAG size of output: 43 [2018-10-26 22:53:34,947 WARN L179 SmtUtils]: Spent 38.33 s on a formula simplification. DAG size of input: 99 DAG size of output: 69 [2018-10-26 22:53:57,176 WARN L179 SmtUtils]: Spent 22.17 s on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2018-10-26 22:54:47,015 WARN L179 SmtUtils]: Spent 48.27 s on a formula simplification. DAG size of input: 117 DAG size of output: 62 [2018-10-26 22:55:01,140 WARN L179 SmtUtils]: Spent 12.93 s on a formula simplification. DAG size of input: 110 DAG size of output: 50 [2018-10-26 22:55:49,913 WARN L179 SmtUtils]: Spent 44.24 s on a formula simplification. DAG size of input: 116 DAG size of output: 62 [2018-10-26 22:56:52,765 WARN L179 SmtUtils]: Spent 40.26 s on a formula simplification. DAG size of input: 116 DAG size of output: 60 [2018-10-26 22:57:56,215 WARN L179 SmtUtils]: Spent 33.12 s on a formula simplification. DAG size of input: 83 DAG size of output: 41 [2018-10-26 22:58:13,185 WARN L179 SmtUtils]: Spent 14.73 s on a formula simplification. DAG size of input: 109 DAG size of output: 51 [2018-10-26 22:58:34,139 WARN L179 SmtUtils]: Spent 18.39 s on a formula simplification. DAG size of input: 115 DAG size of output: 48 [2018-10-26 22:58:42,256 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:102) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:254) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:269) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:689) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.io.IOException: Stream closed at java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:433) at java.io.OutputStream.write(OutputStream.java:116) at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:82) at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:140) at sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:297) at sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:141) at java.io.OutputStreamWriter.flush(OutputStreamWriter.java:229) at java.io.BufferedWriter.flush(BufferedWriter.java:254) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:120) ... 28 more [2018-10-26 22:58:42,259 INFO L168 Benchmark]: Toolchain (without parser) took 584958.35 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 529.5 MB). Free memory was 957.1 MB in the beginning and 1.2 GB in the end (delta: -223.6 MB). Peak memory consumption was 305.9 MB. Max. memory is 11.5 GB. [2018-10-26 22:58:42,260 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:58:42,260 INFO L168 Benchmark]: CACSL2BoogieTranslator took 495.72 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 922.2 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-10-26 22:58:42,260 INFO L168 Benchmark]: Boogie Preprocessor took 176.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 922.2 MB in the beginning and 1.1 GB in the end (delta: -219.2 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2018-10-26 22:58:42,261 INFO L168 Benchmark]: RCFGBuilder took 2448.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 104.4 MB). Peak memory consumption was 104.4 MB. Max. memory is 11.5 GB. [2018-10-26 22:58:42,261 INFO L168 Benchmark]: TraceAbstraction took 581833.91 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 379.6 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -143.7 MB). Peak memory consumption was 235.9 MB. Max. memory is 11.5 GB. [2018-10-26 22:58:42,263 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 495.72 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 922.2 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 176.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 922.2 MB in the beginning and 1.1 GB in the end (delta: -219.2 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2448.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 104.4 MB). Peak memory consumption was 104.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 581833.91 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 379.6 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -143.7 MB). Peak memory consumption was 235.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-10-26 22:58:43,839 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 22:58:43,840 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 22:58:43,849 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 22:58:43,849 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 22:58:43,850 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 22:58:43,851 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 22:58:43,852 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 22:58:43,854 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 22:58:43,855 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 22:58:43,856 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 22:58:43,856 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 22:58:43,857 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 22:58:43,858 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 22:58:43,859 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 22:58:43,859 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 22:58:43,860 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 22:58:43,862 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 22:58:43,863 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 22:58:43,864 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 22:58:43,865 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 22:58:43,866 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 22:58:43,868 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 22:58:43,868 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 22:58:43,868 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 22:58:43,869 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 22:58:43,870 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 22:58:43,871 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 22:58:43,871 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 22:58:43,872 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 22:58:43,872 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 22:58:43,873 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 22:58:43,874 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 22:58:43,874 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 22:58:43,875 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 22:58:43,875 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 22:58:43,875 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-10-26 22:58:43,887 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 22:58:43,887 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 22:58:43,887 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 22:58:43,888 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 22:58:43,888 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 22:58:43,888 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 22:58:43,889 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 22:58:43,889 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 22:58:43,890 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 22:58:43,890 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 22:58:43,890 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 22:58:43,890 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 22:58:43,890 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 22:58:43,890 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 22:58:43,891 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-10-26 22:58:43,891 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-10-26 22:58:43,891 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 22:58:43,891 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 22:58:43,891 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 22:58:43,891 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 22:58:43,892 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 22:58:43,892 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 22:58:43,892 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 22:58:43,892 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 22:58:43,892 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 22:58:43,892 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 22:58:43,892 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 22:58:43,893 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-10-26 22:58:43,893 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 22:58:43,893 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-10-26 22:58:43,895 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-10-26 22:58:43,895 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer 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(__VERIFIER_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 -> 7c23175fa4336049a9379aeb3b34f319007ef752 [2018-10-26 22:58:43,926 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 22:58:43,935 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 22:58:43,938 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 22:58:43,939 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 22:58:43,940 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 22:58:43,940 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem10_label12_false-unreach-call.c [2018-10-26 22:58:43,986 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/data/ac690e7ee/a208d24da181420eb25fa9f2f8971701/FLAGe1567df8c [2018-10-26 22:58:44,407 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 22:58:44,408 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/sv-benchmarks/c/eca-rers2012/Problem10_label12_false-unreach-call.c [2018-10-26 22:58:44,418 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/data/ac690e7ee/a208d24da181420eb25fa9f2f8971701/FLAGe1567df8c [2018-10-26 22:58:44,429 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/data/ac690e7ee/a208d24da181420eb25fa9f2f8971701 [2018-10-26 22:58:44,432 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 22:58:44,433 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 22:58:44,434 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 22:58:44,434 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 22:58:44,437 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 22:58:44,438 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:58:44" (1/1) ... [2018-10-26 22:58:44,440 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@352adfc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:58:44, skipping insertion in model container [2018-10-26 22:58:44,440 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:58:44" (1/1) ... [2018-10-26 22:58:44,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 22:58:44,489 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 22:58:44,849 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:58:44,853 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 22:58:44,966 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:58:44,979 INFO L193 MainTranslator]: Completed translation [2018-10-26 22:58:44,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:58:44 WrapperNode [2018-10-26 22:58:44,979 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 22:58:44,980 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 22:58:44,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 22:58:44,980 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 22:58:44,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:58:44" (1/1) ... [2018-10-26 22:58:44,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:58:44" (1/1) ... [2018-10-26 22:58:45,008 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:58:44" (1/1) ... [2018-10-26 22:58:45,008 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:58:44" (1/1) ... [2018-10-26 22:58:45,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:58:44" (1/1) ... [2018-10-26 22:58:45,052 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:58:44" (1/1) ... [2018-10-26 22:58:45,056 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:58:44" (1/1) ... [2018-10-26 22:58:45,061 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 22:58:45,062 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 22:58:45,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 22:58:45,062 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 22:58:45,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:58:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 22:58:45,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 22:58:45,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 22:58:45,192 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-26 22:58:45,192 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 22:58:45,192 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-26 22:58:45,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-10-26 22:58:45,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-10-26 22:58:45,192 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 22:58:45,193 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 22:58:45,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 22:58:45,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 22:58:48,144 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 22:58:48,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:58:48 BoogieIcfgContainer [2018-10-26 22:58:48,145 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 22:58:48,146 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 22:58:48,146 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 22:58:48,149 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 22:58:48,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:58:44" (1/3) ... [2018-10-26 22:58:48,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e72f89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:58:48, skipping insertion in model container [2018-10-26 22:58:48,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:58:44" (2/3) ... [2018-10-26 22:58:48,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e72f89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:58:48, skipping insertion in model container [2018-10-26 22:58:48,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:58:48" (3/3) ... [2018-10-26 22:58:48,152 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label12_false-unreach-call.c [2018-10-26 22:58:48,161 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 22:58:48,167 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 22:58:48,181 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 22:58:48,206 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 22:58:48,207 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 22:58:48,207 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 22:58:48,207 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 22:58:48,207 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 22:58:48,209 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 22:58:48,209 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 22:58:48,209 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 22:58:48,210 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 22:58:48,228 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-10-26 22:58:48,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-26 22:58:48,233 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:58:48,234 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:58:48,236 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:58:48,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:58:48,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1125399135, now seen corresponding path program 1 times [2018-10-26 22:58:48,245 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:58:48,245 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 22:58:48,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:58:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:58:48,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:58:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:58:48,427 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 22:58:48,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:58:48,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 22:58:48,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 22:58:48,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 22:58:48,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:58:48,450 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-10-26 22:58:51,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:58:51,605 INFO L93 Difference]: Finished difference Result 574 states and 992 transitions. [2018-10-26 22:58:51,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 22:58:51,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-26 22:58:51,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:58:51,623 INFO L225 Difference]: With dead ends: 574 [2018-10-26 22:58:51,623 INFO L226 Difference]: Without dead ends: 356 [2018-10-26 22:58:51,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:58:51,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-10-26 22:58:51,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-10-26 22:58:51,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-10-26 22:58:51,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 526 transitions. [2018-10-26 22:58:51,681 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 526 transitions. Word has length 19 [2018-10-26 22:58:51,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:58:51,681 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 526 transitions. [2018-10-26 22:58:51,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 22:58:51,682 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 526 transitions. [2018-10-26 22:58:51,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-26 22:58:51,687 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:58:51,688 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:58:51,688 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:58:51,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:58:51,688 INFO L82 PathProgramCache]: Analyzing trace with hash 2146016307, now seen corresponding path program 1 times [2018-10-26 22:58:51,691 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:58:51,691 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 22:58:51,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:58:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:58:51,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:58:51,844 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:58:51,845 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Broken pipe [2018-10-26 22:58:51,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:58:51,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 22:58:51,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 22:58:51,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 22:58:51,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:58:51,860 INFO L87 Difference]: Start difference. First operand 356 states and 526 transitions. Second operand 3 states. [2018-10-26 22:58:54,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:58:54,319 INFO L93 Difference]: Finished difference Result 850 states and 1333 transitions. [2018-10-26 22:58:54,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 22:58:54,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2018-10-26 22:58:54,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:58:54,323 INFO L225 Difference]: With dead ends: 850 [2018-10-26 22:58:54,323 INFO L226 Difference]: Without dead ends: 500 [2018-10-26 22:58:54,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:58:54,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-10-26 22:58:54,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2018-10-26 22:58:54,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2018-10-26 22:58:54,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 695 transitions. [2018-10-26 22:58:54,350 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 695 transitions. Word has length 90 [2018-10-26 22:58:54,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:58:54,351 INFO L481 AbstractCegarLoop]: Abstraction has 500 states and 695 transitions. [2018-10-26 22:58:54,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 22:58:54,351 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 695 transitions. [2018-10-26 22:58:54,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-26 22:58:54,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:58:54,354 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:58:54,354 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:58:54,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:58:54,354 INFO L82 PathProgramCache]: Analyzing trace with hash 407451016, now seen corresponding path program 1 times [2018-10-26 22:58:54,355 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:58:54,355 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 22:58:54,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:58:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:58:54,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:58:54,487 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 22:58:54,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:58:54,630 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 22:58:54,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:58:54,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2018-10-26 22:58:54,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 22:58:54,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 22:58:54,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-26 22:58:54,633 INFO L87 Difference]: Start difference. First operand 500 states and 695 transitions. Second operand 6 states. [2018-10-26 22:58:59,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:58:59,612 INFO L93 Difference]: Finished difference Result 1887 states and 2757 transitions. [2018-10-26 22:58:59,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 22:58:59,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2018-10-26 22:58:59,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:58:59,623 INFO L225 Difference]: With dead ends: 1887 [2018-10-26 22:58:59,624 INFO L226 Difference]: Without dead ends: 1393 [2018-10-26 22:58:59,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-26 22:58:59,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2018-10-26 22:58:59,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1378. [2018-10-26 22:58:59,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1378 states. [2018-10-26 22:58:59,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1859 transitions. [2018-10-26 22:58:59,706 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1859 transitions. Word has length 97 [2018-10-26 22:58:59,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:58:59,706 INFO L481 AbstractCegarLoop]: Abstraction has 1378 states and 1859 transitions. [2018-10-26 22:58:59,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 22:58:59,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1859 transitions. [2018-10-26 22:58:59,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-10-26 22:58:59,722 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:58:59,726 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:58:59,727 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:58:59,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:58:59,727 INFO L82 PathProgramCache]: Analyzing trace with hash -2045620317, now seen corresponding path program 1 times [2018-10-26 22:58:59,729 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:58:59,729 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 22:58:59,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:59:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:59:00,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:59:00,337 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 22:59:00,337 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 22:59:00,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:59:00,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 22:59:00,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 22:59:00,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 22:59:00,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:59:00,340 INFO L87 Difference]: Start difference. First operand 1378 states and 1859 transitions. Second operand 5 states. [2018-10-26 22:59:06,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:59:06,344 INFO L93 Difference]: Finished difference Result 3341 states and 4649 transitions. [2018-10-26 22:59:06,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 22:59:06,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2018-10-26 22:59:06,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:59:06,356 INFO L225 Difference]: With dead ends: 3341 [2018-10-26 22:59:06,356 INFO L226 Difference]: Without dead ends: 1969 [2018-10-26 22:59:06,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-26 22:59:06,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2018-10-26 22:59:06,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1943. [2018-10-26 22:59:06,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1943 states. [2018-10-26 22:59:06,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1943 states to 1943 states and 2499 transitions. [2018-10-26 22:59:06,415 INFO L78 Accepts]: Start accepts. Automaton has 1943 states and 2499 transitions. Word has length 217 [2018-10-26 22:59:06,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:59:06,417 INFO L481 AbstractCegarLoop]: Abstraction has 1943 states and 2499 transitions. [2018-10-26 22:59:06,417 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 22:59:06,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1943 states and 2499 transitions. [2018-10-26 22:59:06,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-26 22:59:06,422 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:59:06,422 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:59:06,422 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:59:06,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:59:06,423 INFO L82 PathProgramCache]: Analyzing trace with hash -595029241, now seen corresponding path program 1 times [2018-10-26 22:59:06,424 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:59:06,424 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 22:59:06,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:59:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:59:06,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:59:06,606 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 102 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:59:06,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:59:06,864 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 102 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:59:06,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:59:06,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-10-26 22:59:06,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 22:59:06,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 22:59:06,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-10-26 22:59:06,866 INFO L87 Difference]: Start difference. First operand 1943 states and 2499 transitions. Second operand 7 states. [2018-10-26 22:59:11,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:59:11,264 INFO L93 Difference]: Finished difference Result 4667 states and 6116 transitions. [2018-10-26 22:59:11,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 22:59:11,265 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 219 [2018-10-26 22:59:11,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:59:11,271 INFO L225 Difference]: With dead ends: 4667 [2018-10-26 22:59:11,271 INFO L226 Difference]: Without dead ends: 1882 [2018-10-26 22:59:11,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 437 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-10-26 22:59:11,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2018-10-26 22:59:11,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1580. [2018-10-26 22:59:11,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2018-10-26 22:59:11,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 1810 transitions. [2018-10-26 22:59:11,315 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 1810 transitions. Word has length 219 [2018-10-26 22:59:11,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:59:11,315 INFO L481 AbstractCegarLoop]: Abstraction has 1580 states and 1810 transitions. [2018-10-26 22:59:11,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 22:59:11,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 1810 transitions. [2018-10-26 22:59:11,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-10-26 22:59:11,319 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:59:11,320 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 22:59:11,320 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:59:11,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:59:11,320 INFO L82 PathProgramCache]: Analyzing trace with hash 2124363791, now seen corresponding path program 1 times [2018-10-26 22:59:11,323 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:59:11,323 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 22:59:11,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:59:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:59:11,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:59:11,838 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 138 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:59:11,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:59:12,100 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 138 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:59:12,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:59:12,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-10-26 22:59:12,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 22:59:12,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 22:59:12,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-10-26 22:59:12,105 INFO L87 Difference]: Start difference. First operand 1580 states and 1810 transitions. Second operand 7 states. [2018-10-26 22:59:15,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:59:15,411 INFO L93 Difference]: Finished difference Result 3722 states and 4471 transitions. [2018-10-26 22:59:15,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 22:59:15,411 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 255 [2018-10-26 22:59:15,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:59:15,422 INFO L225 Difference]: With dead ends: 3722 [2018-10-26 22:59:15,422 INFO L226 Difference]: Without dead ends: 2292 [2018-10-26 22:59:15,427 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-10-26 22:59:15,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2292 states. [2018-10-26 22:59:15,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2292 to 2277. [2018-10-26 22:59:15,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2277 states. [2018-10-26 22:59:15,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 2607 transitions. [2018-10-26 22:59:15,503 INFO L78 Accepts]: Start accepts. Automaton has 2277 states and 2607 transitions. Word has length 255 [2018-10-26 22:59:15,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:59:15,504 INFO L481 AbstractCegarLoop]: Abstraction has 2277 states and 2607 transitions. [2018-10-26 22:59:15,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 22:59:15,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 2607 transitions. [2018-10-26 22:59:15,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-10-26 22:59:15,510 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:59:15,510 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 22:59:15,510 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:59:15,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:59:15,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1230776758, now seen corresponding path program 1 times [2018-10-26 22:59:15,513 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:59:15,513 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 22:59:15,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:59:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:59:16,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:59:16,413 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-26 22:59:16,691 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 289 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 22:59:16,691 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:59:17,193 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-26 22:59:17,317 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-26 22:59:17,452 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-26 22:59:17,589 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-26 22:59:18,350 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-26 22:59:19,270 WARN L179 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-10-26 22:59:20,826 WARN L179 SmtUtils]: Spent 428.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-26 22:59:21,067 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 42 proven. 261 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 22:59:21,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:59:21,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-10-26 22:59:21,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 22:59:21,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 22:59:21,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-10-26 22:59:21,073 INFO L87 Difference]: Start difference. First operand 2277 states and 2607 transitions. Second operand 13 states. [2018-10-26 22:59:22,015 WARN L179 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-10-26 22:59:22,749 WARN L179 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-10-26 22:59:24,229 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-26 22:59:25,731 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-26 22:59:47,126 WARN L179 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-10-26 22:59:57,883 WARN L179 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 18 [2018-10-26 23:00:02,408 WARN L179 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-26 23:00:03,461 WARN L179 SmtUtils]: Spent 377.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-10-26 23:01:15,484 WARN L179 SmtUtils]: Spent 920.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-10-26 23:01:28,520 WARN L179 SmtUtils]: Spent 827.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-10-26 23:01:37,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:01:37,681 INFO L93 Difference]: Finished difference Result 5466 states and 6364 transitions. [2018-10-26 23:01:37,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-26 23:01:37,690 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 333 [2018-10-26 23:01:37,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:01:37,699 INFO L225 Difference]: With dead ends: 5466 [2018-10-26 23:01:37,699 INFO L226 Difference]: Without dead ends: 3339 [2018-10-26 23:01:37,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 666 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2018-10-26 23:01:37,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2018-10-26 23:01:37,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 3329. [2018-10-26 23:01:37,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3329 states. [2018-10-26 23:01:37,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 3802 transitions. [2018-10-26 23:01:37,777 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 3802 transitions. Word has length 333 [2018-10-26 23:01:37,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:01:37,778 INFO L481 AbstractCegarLoop]: Abstraction has 3329 states and 3802 transitions. [2018-10-26 23:01:37,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 23:01:37,778 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 3802 transitions. [2018-10-26 23:01:37,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-10-26 23:01:37,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:01:37,785 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:01:37,785 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:01:37,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:01:37,786 INFO L82 PathProgramCache]: Analyzing trace with hash -679378190, now seen corresponding path program 1 times [2018-10-26 23:01:37,787 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:01:37,787 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 23:01:37,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:01:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:01:37,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:01:38,039 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2018-10-26 23:01:38,039 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:01:38,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:01:38,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:01:38,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:01:38,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:01:38,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:01:38,042 INFO L87 Difference]: Start difference. First operand 3329 states and 3802 transitions. Second operand 3 states. [2018-10-26 23:01:40,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:01:40,753 INFO L93 Difference]: Finished difference Result 7012 states and 8204 transitions. [2018-10-26 23:01:40,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:01:40,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 347 [2018-10-26 23:01:40,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:01:40,764 INFO L225 Difference]: With dead ends: 7012 [2018-10-26 23:01:40,765 INFO L226 Difference]: Without dead ends: 3588 [2018-10-26 23:01:40,771 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:01:40,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3588 states. [2018-10-26 23:01:40,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3588 to 3588. [2018-10-26 23:01:40,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2018-10-26 23:01:40,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 4070 transitions. [2018-10-26 23:01:40,851 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 4070 transitions. Word has length 347 [2018-10-26 23:01:40,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:01:40,851 INFO L481 AbstractCegarLoop]: Abstraction has 3588 states and 4070 transitions. [2018-10-26 23:01:40,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:01:40,851 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 4070 transitions. [2018-10-26 23:01:40,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-10-26 23:01:40,859 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:01:40,859 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 23:01:40,860 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:01:40,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:01:40,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1230076619, now seen corresponding path program 1 times [2018-10-26 23:01:40,861 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:01:40,861 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 23:01:40,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:01:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:01:41,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:01:42,196 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-26 23:01:42,828 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2018-10-26 23:01:43,070 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-10-26 23:01:43,447 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2018-10-26 23:01:43,951 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 293 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:01:43,952 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:01:47,110 WARN L179 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-26 23:01:47,333 WARN L179 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-26 23:01:47,647 WARN L179 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-26 23:01:47,918 WARN L179 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-26 23:01:49,011 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 235 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-10-26 23:01:49,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 23:01:49,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2018-10-26 23:01:49,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-26 23:01:49,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-26 23:01:49,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-10-26 23:01:49,014 INFO L87 Difference]: Start difference. First operand 3588 states and 4070 transitions. Second operand 19 states. [2018-10-26 23:01:52,273 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-10-26 23:02:02,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:02:02,633 INFO L93 Difference]: Finished difference Result 7951 states and 9133 transitions. [2018-10-26 23:02:02,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-26 23:02:02,635 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 352 [2018-10-26 23:02:02,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:02:02,643 INFO L225 Difference]: With dead ends: 7951 [2018-10-26 23:02:02,643 INFO L226 Difference]: Without dead ends: 4808 [2018-10-26 23:02:02,648 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 689 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=224, Invalid=768, Unknown=0, NotChecked=0, Total=992 [2018-10-26 23:02:02,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4808 states. [2018-10-26 23:02:02,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4808 to 4669. [2018-10-26 23:02:02,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4669 states. [2018-10-26 23:02:02,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4669 states to 4669 states and 5271 transitions. [2018-10-26 23:02:02,741 INFO L78 Accepts]: Start accepts. Automaton has 4669 states and 5271 transitions. Word has length 352 [2018-10-26 23:02:02,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:02:02,742 INFO L481 AbstractCegarLoop]: Abstraction has 4669 states and 5271 transitions. [2018-10-26 23:02:02,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-26 23:02:02,742 INFO L276 IsEmpty]: Start isEmpty. Operand 4669 states and 5271 transitions. [2018-10-26 23:02:02,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-10-26 23:02:02,752 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:02:02,752 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:02:02,752 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:02:02,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:02:02,753 INFO L82 PathProgramCache]: Analyzing trace with hash -185157719, now seen corresponding path program 1 times [2018-10-26 23:02:02,755 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:02:02,756 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 23:02:02,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:02:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 23:02:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (11)] Exception during sending of exit command (exit): Broken pipe [2018-10-26 23:02:04,136 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-26 23:02:04,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 11:02:04 BoogieIcfgContainer [2018-10-26 23:02:04,250 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 23:02:04,250 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 23:02:04,250 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 23:02:04,251 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 23:02:04,251 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:58:48" (3/4) ... [2018-10-26 23:02:04,253 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 23:02:04,389 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_468bf840-ea64-4991-b4f5-26159b38b241/bin-2019/uautomizer/witness.graphml [2018-10-26 23:02:04,389 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 23:02:04,390 INFO L168 Benchmark]: Toolchain (without parser) took 199957.35 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 348.7 MB). Free memory was 942.5 MB in the beginning and 1.3 GB in the end (delta: -307.7 MB). Peak memory consumption was 41.0 MB. Max. memory is 11.5 GB. [2018-10-26 23:02:04,390 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 23:02:04,390 INFO L168 Benchmark]: CACSL2BoogieTranslator took 545.19 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 904.9 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2018-10-26 23:02:04,391 INFO L168 Benchmark]: Boogie Preprocessor took 81.58 ms. Allocated memory is still 1.0 GB. Free memory was 904.9 MB in the beginning and 899.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-26 23:02:04,391 INFO L168 Benchmark]: RCFGBuilder took 3083.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.2 MB). Free memory was 899.6 MB in the beginning and 1.1 GB in the end (delta: -177.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2018-10-26 23:02:04,391 INFO L168 Benchmark]: TraceAbstraction took 196104.09 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 160.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -211.7 MB). Peak memory consumption was 401.6 MB. Max. memory is 11.5 GB. [2018-10-26 23:02:04,391 INFO L168 Benchmark]: Witness Printer took 138.82 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 38.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. [2018-10-26 23:02:04,393 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 545.19 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 904.9 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 81.58 ms. Allocated memory is still 1.0 GB. Free memory was 904.9 MB in the beginning and 899.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3083.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.2 MB). Free memory was 899.6 MB in the beginning and 1.1 GB in the end (delta: -177.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 196104.09 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 160.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -211.7 MB). Peak memory consumption was 401.6 MB. Max. memory is 11.5 GB. * Witness Printer took 138.82 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 38.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 40]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; VAL [\old(a1)=0, \old(a10)=0, \old(a12)=0, \old(a19)=0, \old(a4)=0, \old(inputB)=0, \old(inputC)=0, \old(inputD)=0, \old(inputE)=0, \old(inputF)=0, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L579] int output = -1; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=4294967295] [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=4294967295] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] 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 [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L260] 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 [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L277] 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 [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L291] 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 [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] 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 [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] 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 [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] 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 [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] 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 [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] 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 [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L460] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L465] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L471] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L476] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L481] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L487] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L493] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L499] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L504] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L509] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L514] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] 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 [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L523] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L526] COND TRUE ((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0))))) [L527] a1 = (((a1 * 5) + 278443) - -239546) [L528] RET return 26; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, \result=26, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L590] EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, calculate_output(input)=26, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=4294967295] [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=26] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] 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 [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L260] 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 [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L277] 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 [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L291] 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 [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND TRUE ((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14)) [L297] a1 = ((((((a1 * 9)/ 10) % 299993)+ -300005) / 5) + -75819) [L298] a10 = 4 [L300] RET return 26; VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, \result=26, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L590] EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=4294864736, a10=4, a12=0, a19=9, a4=14, calculate_output(input)=26, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=26] [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=26] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] 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 [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L260] 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 [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L277] 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 [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L291] 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 [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] 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 [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] 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 [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] 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 [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] 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 [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] 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 [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND TRUE ((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0))) [L449] a1 = ((((((a1 % 25)- -12) - 0) * 5) % 25)- -13) [L450] a10 = 3 [L451] a19 = 6 [L453] RET return -1; VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, \result=-1, a1=23, a10=3, a12=0, a19=6, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L590] EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=3, a12=0, a19=6, a4=14, calculate_output(input)=-1, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=26] [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=3, a12=0, a19=6, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=4294967295] [L590] CALL calculate_output(input) VAL [\old(a1)=23, \old(a10)=3, \old(a19)=6, \old(input)=6, a1=23, a10=3, a12=0, a19=6, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=3, \old(a19)=6, \old(input)=6, a1=23, a10=3, a12=0, a19=6, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=3, \old(a19)=6, \old(input)=6, a1=23, a10=3, a12=0, a19=6, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=3, \old(a19)=6, \old(input)=6, a1=23, a10=3, a12=0, a19=6, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=3, \old(a19)=6, \old(input)=6, a1=23, a10=3, a12=0, a19=6, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=3, \old(a19)=6, \old(input)=6, a1=23, a10=3, a12=0, a19=6, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=3, \old(a19)=6, \old(input)=6, a1=23, a10=3, a12=0, a19=6, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND TRUE (((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)) VAL [\old(a1)=23, \old(a10)=3, \old(a19)=6, \old(input)=6, a1=23, a10=3, a12=0, a19=6, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] __VERIFIER_error() VAL [\old(a1)=23, \old(a10)=3, \old(a19)=6, \old(input)=6, a1=23, a10=3, a12=0, a19=6, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNSAFE Result, 196.0s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 177.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1235 SDtfs, 7884 SDslu, 1321 SDs, 0 SdLazy, 13892 SolverSat, 2436 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 151.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3245 GetRequests, 3150 SyntacticMatches, 7 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 19.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4669occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 507 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 14.3s InterpolantComputationTime, 2291 NumberOfCodeBlocks, 2291 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 3171 ConstructedInterpolants, 0 QuantifiedInterpolants, 8049115 SizeOfPredicates, 18 NumberOfNonLiveVariables, 2597 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 1886/2190 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...