./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label24_false-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6aca4f46-dfb7-4e32-b33d-cc0c3dd6ae01/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6aca4f46-dfb7-4e32-b33d-cc0c3dd6ae01/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6aca4f46-dfb7-4e32-b33d-cc0c3dd6ae01/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6aca4f46-dfb7-4e32-b33d-cc0c3dd6ae01/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label24_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_6aca4f46-dfb7-4e32-b33d-cc0c3dd6ae01/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6aca4f46-dfb7-4e32-b33d-cc0c3dd6ae01/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 a91a998212d77a3e9dd6829139b4c40272a542d6 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-635dfa2 [2018-12-02 01:06:08,795 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 01:06:08,796 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 01:06:08,802 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 01:06:08,802 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 01:06:08,802 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 01:06:08,803 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 01:06:08,804 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 01:06:08,805 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 01:06:08,805 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 01:06:08,805 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 01:06:08,806 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 01:06:08,806 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 01:06:08,806 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 01:06:08,807 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 01:06:08,807 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 01:06:08,808 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 01:06:08,809 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 01:06:08,810 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 01:06:08,810 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 01:06:08,811 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 01:06:08,811 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 01:06:08,812 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 01:06:08,813 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 01:06:08,813 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 01:06:08,813 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 01:06:08,814 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 01:06:08,814 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 01:06:08,815 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 01:06:08,815 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 01:06:08,815 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 01:06:08,816 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 01:06:08,816 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 01:06:08,816 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 01:06:08,816 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 01:06:08,817 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 01:06:08,817 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6aca4f46-dfb7-4e32-b33d-cc0c3dd6ae01/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 01:06:08,824 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 01:06:08,824 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 01:06:08,824 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 01:06:08,825 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 01:06:08,825 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 01:06:08,825 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 01:06:08,825 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 01:06:08,825 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 01:06:08,825 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 01:06:08,825 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 01:06:08,825 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 01:06:08,826 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 01:06:08,826 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 01:06:08,826 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 01:06:08,826 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 01:06:08,826 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 01:06:08,826 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 01:06:08,826 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 01:06:08,826 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 01:06:08,826 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 01:06:08,826 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 01:06:08,826 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 01:06:08,827 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 01:06:08,827 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 01:06:08,827 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 01:06:08,827 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 01:06:08,827 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 01:06:08,827 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 01:06:08,827 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 01:06:08,827 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 01:06:08,827 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_6aca4f46-dfb7-4e32-b33d-cc0c3dd6ae01/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 -> a91a998212d77a3e9dd6829139b4c40272a542d6 [2018-12-02 01:06:08,844 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 01:06:08,851 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 01:06:08,853 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 01:06:08,854 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 01:06:08,854 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 01:06:08,855 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6aca4f46-dfb7-4e32-b33d-cc0c3dd6ae01/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem10_label24_false-unreach-call.c [2018-12-02 01:06:08,887 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6aca4f46-dfb7-4e32-b33d-cc0c3dd6ae01/bin-2019/uautomizer/data/62eb36d08/0feaef38ea334947980cbe3132fa7a30/FLAG6ee46ea29 [2018-12-02 01:06:09,299 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 01:06:09,299 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6aca4f46-dfb7-4e32-b33d-cc0c3dd6ae01/sv-benchmarks/c/eca-rers2012/Problem10_label24_false-unreach-call.c [2018-12-02 01:06:09,306 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6aca4f46-dfb7-4e32-b33d-cc0c3dd6ae01/bin-2019/uautomizer/data/62eb36d08/0feaef38ea334947980cbe3132fa7a30/FLAG6ee46ea29 [2018-12-02 01:06:09,314 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6aca4f46-dfb7-4e32-b33d-cc0c3dd6ae01/bin-2019/uautomizer/data/62eb36d08/0feaef38ea334947980cbe3132fa7a30 [2018-12-02 01:06:09,316 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 01:06:09,317 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 01:06:09,317 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 01:06:09,318 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 01:06:09,320 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 01:06:09,320 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:06:09" (1/1) ... [2018-12-02 01:06:09,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fdfc843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:06:09, skipping insertion in model container [2018-12-02 01:06:09,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:06:09" (1/1) ... [2018-12-02 01:06:09,326 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 01:06:09,350 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 01:06:09,539 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 01:06:09,542 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 01:06:09,639 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 01:06:09,650 INFO L195 MainTranslator]: Completed translation [2018-12-02 01:06:09,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:06:09 WrapperNode [2018-12-02 01:06:09,651 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 01:06:09,651 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 01:06:09,651 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 01:06:09,651 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 01:06:09,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:06:09" (1/1) ... [2018-12-02 01:06:09,670 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:06:09" (1/1) ... [2018-12-02 01:06:09,677 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 01:06:09,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 01:06:09,677 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 01:06:09,677 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 01:06:09,686 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:06:09" (1/1) ... [2018-12-02 01:06:09,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:06:09" (1/1) ... [2018-12-02 01:06:09,690 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:06:09" (1/1) ... [2018-12-02 01:06:09,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:06:09" (1/1) ... [2018-12-02 01:06:09,712 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:06:09" (1/1) ... [2018-12-02 01:06:09,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:06:09" (1/1) ... [2018-12-02 01:06:09,725 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:06:09" (1/1) ... [2018-12-02 01:06:09,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 01:06:09,731 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 01:06:09,731 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 01:06:09,731 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 01:06:09,732 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:06:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6aca4f46-dfb7-4e32-b33d-cc0c3dd6ae01/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-12-02 01:06:09,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 01:06:09,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 01:06:09,768 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-12-02 01:06:09,768 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-12-02 01:06:09,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 01:06:09,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 01:06:09,768 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 01:06:09,768 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 01:06:10,365 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 01:06:10,365 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 01:06:10,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:06:10 BoogieIcfgContainer [2018-12-02 01:06:10,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 01:06:10,367 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 01:06:10,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 01:06:10,369 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 01:06:10,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:06:09" (1/3) ... [2018-12-02 01:06:10,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c0c0d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:06:10, skipping insertion in model container [2018-12-02 01:06:10,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:06:09" (2/3) ... [2018-12-02 01:06:10,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c0c0d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:06:10, skipping insertion in model container [2018-12-02 01:06:10,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:06:10" (3/3) ... [2018-12-02 01:06:10,372 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label24_false-unreach-call.c [2018-12-02 01:06:10,381 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 01:06:10,388 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 01:06:10,401 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 01:06:10,427 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 01:06:10,427 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 01:06:10,427 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 01:06:10,427 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 01:06:10,428 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 01:06:10,428 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 01:06:10,428 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 01:06:10,428 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 01:06:10,428 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 01:06:10,442 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2018-12-02 01:06:10,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 01:06:10,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:06:10,446 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:06:10,448 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:06:10,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:06:10,451 INFO L82 PathProgramCache]: Analyzing trace with hash 894573055, now seen corresponding path program 1 times [2018-12-02 01:06:10,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:06:10,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:06:10,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:06:10,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:06:10,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:06:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:06:10,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:06:10,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:06:10,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:06:10,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:06:10,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:06:10,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:06:10,607 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 3 states. [2018-12-02 01:06:11,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:06:11,070 INFO L93 Difference]: Finished difference Result 571 states and 989 transitions. [2018-12-02 01:06:11,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:06:11,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-02 01:06:11,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:06:11,079 INFO L225 Difference]: With dead ends: 571 [2018-12-02 01:06:11,079 INFO L226 Difference]: Without dead ends: 294 [2018-12-02 01:06:11,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:06:11,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-12-02 01:06:11,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2018-12-02 01:06:11,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-02 01:06:11,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 421 transitions. [2018-12-02 01:06:11,119 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 421 transitions. Word has length 20 [2018-12-02 01:06:11,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:06:11,119 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 421 transitions. [2018-12-02 01:06:11,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:06:11,119 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 421 transitions. [2018-12-02 01:06:11,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-02 01:06:11,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:06:11,121 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:06:11,121 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:06:11,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:06:11,122 INFO L82 PathProgramCache]: Analyzing trace with hash 892965265, now seen corresponding path program 1 times [2018-12-02 01:06:11,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:06:11,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:06:11,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:06:11,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:06:11,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:06:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:06:11,248 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:06:11,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:06:11,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 01:06:11,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:06:11,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:06:11,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:06:11,251 INFO L87 Difference]: Start difference. First operand 294 states and 421 transitions. Second operand 6 states. [2018-12-02 01:06:11,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:06:11,780 INFO L93 Difference]: Finished difference Result 741 states and 1061 transitions. [2018-12-02 01:06:11,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 01:06:11,780 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-12-02 01:06:11,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:06:11,783 INFO L225 Difference]: With dead ends: 741 [2018-12-02 01:06:11,783 INFO L226 Difference]: Without dead ends: 453 [2018-12-02 01:06:11,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 01:06:11,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-12-02 01:06:11,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 445. [2018-12-02 01:06:11,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-12-02 01:06:11,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 606 transitions. [2018-12-02 01:06:11,801 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 606 transitions. Word has length 89 [2018-12-02 01:06:11,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:06:11,802 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 606 transitions. [2018-12-02 01:06:11,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:06:11,802 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 606 transitions. [2018-12-02 01:06:11,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 01:06:11,803 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:06:11,803 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:06:11,803 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:06:11,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:06:11,804 INFO L82 PathProgramCache]: Analyzing trace with hash 712402589, now seen corresponding path program 1 times [2018-12-02 01:06:11,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:06:11,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:06:11,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:06:11,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:06:11,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:06:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:06:11,875 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:06:11,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:06:11,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:06:11,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:06:11,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:06:11,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:06:11,877 INFO L87 Difference]: Start difference. First operand 445 states and 606 transitions. Second operand 4 states. [2018-12-02 01:06:12,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:06:12,360 INFO L93 Difference]: Finished difference Result 1609 states and 2232 transitions. [2018-12-02 01:06:12,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:06:12,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2018-12-02 01:06:12,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:06:12,363 INFO L225 Difference]: With dead ends: 1609 [2018-12-02 01:06:12,363 INFO L226 Difference]: Without dead ends: 735 [2018-12-02 01:06:12,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:06:12,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2018-12-02 01:06:12,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 592. [2018-12-02 01:06:12,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-12-02 01:06:12,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 801 transitions. [2018-12-02 01:06:12,379 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 801 transitions. Word has length 99 [2018-12-02 01:06:12,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:06:12,380 INFO L480 AbstractCegarLoop]: Abstraction has 592 states and 801 transitions. [2018-12-02 01:06:12,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:06:12,380 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 801 transitions. [2018-12-02 01:06:12,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-02 01:06:12,382 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:06:12,382 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:06:12,382 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:06:12,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:06:12,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1290039418, now seen corresponding path program 1 times [2018-12-02 01:06:12,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:06:12,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:06:12,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:06:12,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:06:12,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:06:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:06:12,497 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:06:12,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:06:12,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 01:06:12,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:06:12,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:06:12,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:06:12,498 INFO L87 Difference]: Start difference. First operand 592 states and 801 transitions. Second operand 6 states. [2018-12-02 01:06:12,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:06:12,901 INFO L93 Difference]: Finished difference Result 1492 states and 2064 transitions. [2018-12-02 01:06:12,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 01:06:12,902 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2018-12-02 01:06:12,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:06:12,906 INFO L225 Difference]: With dead ends: 1492 [2018-12-02 01:06:12,906 INFO L226 Difference]: Without dead ends: 906 [2018-12-02 01:06:12,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 01:06:12,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2018-12-02 01:06:12,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 890. [2018-12-02 01:06:12,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2018-12-02 01:06:12,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1141 transitions. [2018-12-02 01:06:12,933 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1141 transitions. Word has length 142 [2018-12-02 01:06:12,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:06:12,934 INFO L480 AbstractCegarLoop]: Abstraction has 890 states and 1141 transitions. [2018-12-02 01:06:12,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:06:12,934 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1141 transitions. [2018-12-02 01:06:12,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-02 01:06:12,937 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:06:12,937 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:06:12,938 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:06:12,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:06:12,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1377962712, now seen corresponding path program 1 times [2018-12-02 01:06:12,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:06:12,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:06:12,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:06:12,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:06:12,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:06:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:06:13,079 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 26 proven. 78 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 01:06:13,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:06:13,079 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6aca4f46-dfb7-4e32-b33d-cc0c3dd6ae01/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-12-02 01:06:13,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:06:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:06:13,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:06:13,203 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-02 01:06:13,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 01:06:13,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-12-02 01:06:13,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:06:13,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:06:13,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:06:13,219 INFO L87 Difference]: Start difference. First operand 890 states and 1141 transitions. Second operand 6 states. [2018-12-02 01:06:13,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:06:13,821 INFO L93 Difference]: Finished difference Result 1951 states and 2506 transitions. [2018-12-02 01:06:13,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 01:06:13,821 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 189 [2018-12-02 01:06:13,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:06:13,824 INFO L225 Difference]: With dead ends: 1951 [2018-12-02 01:06:13,824 INFO L226 Difference]: Without dead ends: 1067 [2018-12-02 01:06:13,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 191 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 01:06:13,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2018-12-02 01:06:13,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1049. [2018-12-02 01:06:13,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1049 states. [2018-12-02 01:06:13,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1327 transitions. [2018-12-02 01:06:13,847 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1327 transitions. Word has length 189 [2018-12-02 01:06:13,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:06:13,848 INFO L480 AbstractCegarLoop]: Abstraction has 1049 states and 1327 transitions. [2018-12-02 01:06:13,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:06:13,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1327 transitions. [2018-12-02 01:06:13,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-12-02 01:06:13,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:06:13,851 INFO L402 BasicCegarLoop]: trace histogram [4, 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, 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] [2018-12-02 01:06:13,851 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:06:13,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:06:13,852 INFO L82 PathProgramCache]: Analyzing trace with hash -608870379, now seen corresponding path program 1 times [2018-12-02 01:06:13,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:06:13,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:06:13,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:06:13,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:06:13,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:06:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:06:14,302 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 111 proven. 82 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-12-02 01:06:14,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:06:14,302 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6aca4f46-dfb7-4e32-b33d-cc0c3dd6ae01/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-12-02 01:06:14,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:06:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:06:14,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:06:14,415 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 245 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-02 01:06:14,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:06:14,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5] total 17 [2018-12-02 01:06:14,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 01:06:14,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 01:06:14,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-12-02 01:06:14,430 INFO L87 Difference]: Start difference. First operand 1049 states and 1327 transitions. Second operand 17 states. [2018-12-02 01:06:17,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:06:17,226 INFO L93 Difference]: Finished difference Result 2687 states and 4063 transitions. [2018-12-02 01:06:17,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-02 01:06:17,226 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 259 [2018-12-02 01:06:17,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:06:17,232 INFO L225 Difference]: With dead ends: 2687 [2018-12-02 01:06:17,232 INFO L226 Difference]: Without dead ends: 1787 [2018-12-02 01:06:17,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=649, Invalid=2107, Unknown=0, NotChecked=0, Total=2756 [2018-12-02 01:06:17,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2018-12-02 01:06:17,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1649. [2018-12-02 01:06:17,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1649 states. [2018-12-02 01:06:17,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2052 transitions. [2018-12-02 01:06:17,272 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2052 transitions. Word has length 259 [2018-12-02 01:06:17,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:06:17,273 INFO L480 AbstractCegarLoop]: Abstraction has 1649 states and 2052 transitions. [2018-12-02 01:06:17,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 01:06:17,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2052 transitions. [2018-12-02 01:06:17,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-12-02 01:06:17,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:06:17,276 INFO L402 BasicCegarLoop]: trace histogram [4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:06:17,276 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:06:17,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:06:17,276 INFO L82 PathProgramCache]: Analyzing trace with hash 2133869405, now seen corresponding path program 1 times [2018-12-02 01:06:17,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:06:17,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:06:17,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:06:17,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:06:17,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:06:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:06:17,408 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 39 proven. 140 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-12-02 01:06:17,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:06:17,409 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6aca4f46-dfb7-4e32-b33d-cc0c3dd6ae01/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-12-02 01:06:17,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:06:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:06:17,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:06:17,494 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-12-02 01:06:17,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 01:06:17,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2018-12-02 01:06:17,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 01:06:17,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 01:06:17,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-02 01:06:17,510 INFO L87 Difference]: Start difference. First operand 1649 states and 2052 transitions. Second operand 9 states. [2018-12-02 01:06:18,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:06:18,428 INFO L93 Difference]: Finished difference Result 3010 states and 3787 transitions. [2018-12-02 01:06:18,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 01:06:18,429 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 263 [2018-12-02 01:06:18,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:06:18,439 INFO L225 Difference]: With dead ends: 3010 [2018-12-02 01:06:18,439 INFO L226 Difference]: Without dead ends: 1653 [2018-12-02 01:06:18,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 272 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2018-12-02 01:06:18,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2018-12-02 01:06:18,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1506. [2018-12-02 01:06:18,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1506 states. [2018-12-02 01:06:18,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 1782 transitions. [2018-12-02 01:06:18,482 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 1782 transitions. Word has length 263 [2018-12-02 01:06:18,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:06:18,482 INFO L480 AbstractCegarLoop]: Abstraction has 1506 states and 1782 transitions. [2018-12-02 01:06:18,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 01:06:18,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 1782 transitions. [2018-12-02 01:06:18,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-12-02 01:06:18,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:06:18,485 INFO L402 BasicCegarLoop]: trace histogram [4, 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, 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] [2018-12-02 01:06:18,485 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:06:18,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:06:18,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1479931902, now seen corresponding path program 1 times [2018-12-02 01:06:18,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:06:18,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:06:18,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:06:18,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:06:18,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:06:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:06:18,808 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 128 proven. 158 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 01:06:18,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:06:18,808 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6aca4f46-dfb7-4e32-b33d-cc0c3dd6ae01/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-12-02 01:06:18,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:06:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:06:18,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:06:38,278 WARN L180 SmtUtils]: Spent 19.31 s on a formula simplification. DAG size of input: 184 DAG size of output: 54 [2018-12-02 01:06:38,477 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 272 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-02 01:06:38,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:06:38,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2018-12-02 01:06:38,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 01:06:38,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 01:06:38,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2018-12-02 01:06:38,493 INFO L87 Difference]: Start difference. First operand 1506 states and 1782 transitions. Second operand 18 states. [2018-12-02 01:06:58,904 WARN L180 SmtUtils]: Spent 16.26 s on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2018-12-02 01:07:00,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:07:00,370 INFO L93 Difference]: Finished difference Result 4351 states and 5408 transitions. [2018-12-02 01:07:00,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-02 01:07:00,371 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 304 [2018-12-02 01:07:00,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:07:00,378 INFO L225 Difference]: With dead ends: 4351 [2018-12-02 01:07:00,378 INFO L226 Difference]: Without dead ends: 2994 [2018-12-02 01:07:00,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 325 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 36.7s TimeCoverageRelationStatistics Valid=446, Invalid=1716, Unknown=0, NotChecked=0, Total=2162 [2018-12-02 01:07:00,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2018-12-02 01:07:00,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2968. [2018-12-02 01:07:00,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2968 states. [2018-12-02 01:07:00,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2968 states to 2968 states and 3583 transitions. [2018-12-02 01:07:00,442 INFO L78 Accepts]: Start accepts. Automaton has 2968 states and 3583 transitions. Word has length 304 [2018-12-02 01:07:00,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:07:00,442 INFO L480 AbstractCegarLoop]: Abstraction has 2968 states and 3583 transitions. [2018-12-02 01:07:00,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 01:07:00,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2968 states and 3583 transitions. [2018-12-02 01:07:00,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-12-02 01:07:00,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:07:00,445 INFO L402 BasicCegarLoop]: trace histogram [4, 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, 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] [2018-12-02 01:07:00,445 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:07:00,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:07:00,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1661561707, now seen corresponding path program 1 times [2018-12-02 01:07:00,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:07:00,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:07:00,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:07:00,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:07:00,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:07:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:07:00,780 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 201 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:07:00,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:07:00,781 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6aca4f46-dfb7-4e32-b33d-cc0c3dd6ae01/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-12-02 01:07:00,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:07:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:07:00,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:08:45,494 WARN L180 SmtUtils]: Spent 1.66 m on a formula simplification. DAG size of input: 1629 DAG size of output: 262 [2018-12-02 01:08:47,715 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 44 proven. 165 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-02 01:08:47,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:08:47,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 20 [2018-12-02 01:08:47,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-02 01:08:47,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 01:08:47,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=318, Unknown=3, NotChecked=0, Total=380 [2018-12-02 01:08:47,741 INFO L87 Difference]: Start difference. First operand 2968 states and 3583 transitions. Second operand 20 states. [2018-12-02 01:09:40,305 WARN L180 SmtUtils]: Spent 47.53 s on a formula simplification. DAG size of input: 289 DAG size of output: 279 [2018-12-02 01:09:55,466 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~a10~0 |c_old(~a10~0)|)) (.cse1 (= c_~a12~0 0)) (.cse3 (= c_~a4~0 14))) (and .cse0 (<= c_~a1~0 |c_old(~a1~0)|) .cse1 (= c_~a19~0 |c_old(~a19~0)|) (or (let ((.cse2 (= 0 c_~a10~0))) (and (or .cse2 .cse0) (or (and (= |c_old(~a19~0)| c_~a19~0) (not (= c_~a19~0 9))) (not .cse2)))) (not .cse3) (not .cse1) (< 0 (+ c_~a1~0 13))) .cse3 (or (exists ((v_prenex_97 Int)) (let ((.cse5 (* 9 v_prenex_97))) (let ((.cse4 (div .cse5 10))) (let ((.cse6 (mod .cse4 299993))) (and (< .cse4 0) (= (mod .cse5 10) 0) (<= |c_old(~a1~0)| v_prenex_97) (= (mod (+ .cse4 1) 299993) 0) (<= (+ c_~a1~0 75818) (div (+ .cse6 (- 599998)) 5)) (not (= (mod (+ .cse6 2) 5) 0)) (< .cse6 599998) (not (= 0 .cse6))))))) (exists ((v_prenex_31 Int)) (let ((.cse9 (* 9 v_prenex_31))) (let ((.cse10 (div .cse9 10))) (let ((.cse8 (+ .cse10 1)) (.cse7 (mod .cse10 299993))) (and (<= (+ c_~a1~0 75818) (div (+ .cse7 (- 300005)) 5)) (<= |c_old(~a1~0)| v_prenex_31) (< .cse8 0) (not (= (mod .cse8 299993) 0)) (= (mod .cse9 10) 0) (not (= (mod .cse7 5) 0)) (< .cse7 300005) (= 0 .cse7)))))) (exists ((v_prenex_99 Int)) (let ((.cse12 (* 9 v_prenex_99))) (let ((.cse13 (div .cse12 10))) (let ((.cse11 (mod .cse13 299993))) (and (< .cse11 300005) (<= (+ c_~a1~0 75818) (div (+ .cse11 (- 300005)) 5)) (= 0 .cse11) (<= |c_old(~a1~0)| v_prenex_99) (= (mod .cse12 10) 0) (not (= (mod .cse11 5) 0)) (= (mod (+ .cse13 1) 299993) 0)))))) (exists ((v_prenex_42 Int)) (let ((.cse16 (* 9 v_prenex_42))) (let ((.cse14 (div .cse16 10))) (let ((.cse15 (mod .cse14 299993))) (and (<= 0 (+ .cse14 1)) (<= (+ c_~a1~0 75819) (div (+ .cse15 (- 300005)) 5)) (<= 0 .cse14) (= (mod .cse15 5) 0) (<= 0 .cse16) (<= |c_old(~a1~0)| v_prenex_42)))))) (exists ((v_prenex_90 Int)) (let ((.cse17 (* 9 v_prenex_90))) (let ((.cse20 (div .cse17 10))) (let ((.cse18 (+ .cse20 1))) (let ((.cse19 (mod .cse18 299993))) (and (not (= (mod .cse17 10) 0)) (<= |c_old(~a1~0)| v_prenex_90) (< .cse18 0) (not (= .cse19 0)) (<= (+ c_~a1~0 75818) (div (+ .cse19 (- 599998)) 5)) (= 0 (mod .cse20 299993)) (< .cse19 599998) (< .cse17 0) (not (= 0 (mod (+ .cse19 2) 5))))))))) (exists ((v_prenex_68 Int)) (let ((.cse23 (* 9 v_prenex_68))) (let ((.cse21 (div .cse23 10))) (let ((.cse22 (mod (+ .cse21 1) 299993))) (and (< .cse21 0) (< .cse22 300005) (= .cse22 0) (< .cse23 0) (not (= (mod .cse23 10) 0)) (<= (+ c_~a1~0 75818) (div (+ .cse22 (- 300005)) 5)) (<= |c_old(~a1~0)| v_prenex_68) (not (= (mod .cse22 5) 0)) (not (= 0 (mod .cse21 299993)))))))) (exists ((v_prenex_36 Int)) (let ((.cse24 (* 9 v_prenex_36))) (let ((.cse27 (div .cse24 10))) (let ((.cse25 (mod .cse27 299993)) (.cse26 (+ .cse27 1))) (and (= (mod .cse24 10) 0) (< .cse25 599998) (<= (+ c_~a1~0 75818) (div (+ .cse25 (- 599998)) 5)) (not (= (mod .cse26 299993) 0)) (<= |c_old(~a1~0)| v_prenex_36) (not (= (mod (+ .cse25 2) 5) 0)) (not (= 0 .cse25)) (< .cse27 0) (< .cse26 0)))))) (exists ((v_prenex_87 Int)) (let ((.cse30 (* 9 v_prenex_87))) (let ((.cse29 (div .cse30 10))) (let ((.cse28 (mod .cse29 299993))) (and (<= (+ c_~a1~0 75818) (div (+ .cse28 (- 300005)) 5)) (<= 0 (+ .cse29 1)) (not (= (mod .cse28 5) 0)) (<= 0 .cse30) (< .cse28 300005) (<= |c_old(~a1~0)| v_prenex_87) (<= 0 .cse29)))))) (exists ((v_prenex_54 Int)) (let ((.cse34 (* 9 v_prenex_54))) (let ((.cse33 (div .cse34 10))) (let ((.cse32 (+ .cse33 1))) (let ((.cse31 (mod .cse32 299993))) (and (not (= 0 (mod (+ .cse31 2) 5))) (< .cse31 599998) (< .cse32 0) (<= (+ c_~a1~0 75818) (div (+ .cse31 (- 599998)) 5)) (not (= 0 (mod .cse33 299993))) (< .cse33 0) (<= |c_old(~a1~0)| v_prenex_54) (< .cse34 0) (not (= .cse31 0)) (not (= (mod .cse34 10) 0)))))))) (exists ((v_prenex_77 Int)) (let ((.cse36 (* 9 v_prenex_77))) (let ((.cse37 (div .cse36 10))) (let ((.cse35 (mod (+ .cse37 1) 299993))) (and (= .cse35 0) (< .cse36 0) (not (= (mod .cse36 10) 0)) (< .cse35 300005) (<= (+ c_~a1~0 75818) (div (+ .cse35 (- 300005)) 5)) (not (= (mod .cse35 5) 0)) (<= |c_old(~a1~0)| v_prenex_77) (= 0 (mod .cse37 299993))))))) (exists ((v_prenex_93 Int)) (let ((.cse40 (* 9 v_prenex_93))) (let ((.cse38 (div .cse40 10))) (let ((.cse39 (mod .cse38 299993))) (and (< .cse38 0) (< .cse39 599998) (<= |c_old(~a1~0)| v_prenex_93) (not (= 0 .cse39)) (= (mod .cse40 10) 0) (<= (+ c_~a1~0 75818) (div (+ .cse39 (- 599998)) 5)) (not (= (mod (+ .cse39 2) 5) 0)) (<= 0 (+ .cse38 1)))))))))) is different from false [2018-12-02 01:10:34,214 WARN L180 SmtUtils]: Spent 24.35 s on a formula simplification that was a NOOP. DAG size: 275 [2018-12-02 01:11:28,825 WARN L180 SmtUtils]: Spent 50.45 s on a formula simplification that was a NOOP. DAG size: 269 [2018-12-02 01:11:49,826 WARN L180 SmtUtils]: Spent 12.65 s on a formula simplification. DAG size of input: 271 DAG size of output: 57 [2018-12-02 01:11:53,992 WARN L832 $PredicateComparison]: unable to prove that (and (= c_~a12~0 0) (= c_~a4~0 14) (or (exists ((v_prenex_97 Int)) (let ((.cse1 (* 9 v_prenex_97))) (let ((.cse0 (div .cse1 10))) (let ((.cse2 (mod .cse0 299993))) (and (< .cse0 0) (= (mod .cse1 10) 0) (<= |c_old(~a1~0)| v_prenex_97) (= (mod (+ .cse0 1) 299993) 0) (<= (+ c_~a1~0 75818) (div (+ .cse2 (- 599998)) 5)) (not (= (mod (+ .cse2 2) 5) 0)) (< .cse2 599998) (not (= 0 .cse2))))))) (exists ((v_prenex_31 Int)) (let ((.cse5 (* 9 v_prenex_31))) (let ((.cse6 (div .cse5 10))) (let ((.cse4 (+ .cse6 1)) (.cse3 (mod .cse6 299993))) (and (<= (+ c_~a1~0 75818) (div (+ .cse3 (- 300005)) 5)) (<= |c_old(~a1~0)| v_prenex_31) (< .cse4 0) (not (= (mod .cse4 299993) 0)) (= (mod .cse5 10) 0) (not (= (mod .cse3 5) 0)) (< .cse3 300005) (= 0 .cse3)))))) (exists ((v_prenex_99 Int)) (let ((.cse8 (* 9 v_prenex_99))) (let ((.cse9 (div .cse8 10))) (let ((.cse7 (mod .cse9 299993))) (and (< .cse7 300005) (<= (+ c_~a1~0 75818) (div (+ .cse7 (- 300005)) 5)) (= 0 .cse7) (<= |c_old(~a1~0)| v_prenex_99) (= (mod .cse8 10) 0) (not (= (mod .cse7 5) 0)) (= (mod (+ .cse9 1) 299993) 0)))))) (exists ((v_prenex_42 Int)) (let ((.cse12 (* 9 v_prenex_42))) (let ((.cse10 (div .cse12 10))) (let ((.cse11 (mod .cse10 299993))) (and (<= 0 (+ .cse10 1)) (<= (+ c_~a1~0 75819) (div (+ .cse11 (- 300005)) 5)) (<= 0 .cse10) (= (mod .cse11 5) 0) (<= 0 .cse12) (<= |c_old(~a1~0)| v_prenex_42)))))) (exists ((v_prenex_90 Int)) (let ((.cse13 (* 9 v_prenex_90))) (let ((.cse16 (div .cse13 10))) (let ((.cse14 (+ .cse16 1))) (let ((.cse15 (mod .cse14 299993))) (and (not (= (mod .cse13 10) 0)) (<= |c_old(~a1~0)| v_prenex_90) (< .cse14 0) (not (= .cse15 0)) (<= (+ c_~a1~0 75818) (div (+ .cse15 (- 599998)) 5)) (= 0 (mod .cse16 299993)) (< .cse15 599998) (< .cse13 0) (not (= 0 (mod (+ .cse15 2) 5))))))))) (exists ((v_prenex_68 Int)) (let ((.cse19 (* 9 v_prenex_68))) (let ((.cse17 (div .cse19 10))) (let ((.cse18 (mod (+ .cse17 1) 299993))) (and (< .cse17 0) (< .cse18 300005) (= .cse18 0) (< .cse19 0) (not (= (mod .cse19 10) 0)) (<= (+ c_~a1~0 75818) (div (+ .cse18 (- 300005)) 5)) (<= |c_old(~a1~0)| v_prenex_68) (not (= (mod .cse18 5) 0)) (not (= 0 (mod .cse17 299993)))))))) (exists ((v_prenex_36 Int)) (let ((.cse20 (* 9 v_prenex_36))) (let ((.cse23 (div .cse20 10))) (let ((.cse21 (mod .cse23 299993)) (.cse22 (+ .cse23 1))) (and (= (mod .cse20 10) 0) (< .cse21 599998) (<= (+ c_~a1~0 75818) (div (+ .cse21 (- 599998)) 5)) (not (= (mod .cse22 299993) 0)) (<= |c_old(~a1~0)| v_prenex_36) (not (= (mod (+ .cse21 2) 5) 0)) (not (= 0 .cse21)) (< .cse23 0) (< .cse22 0)))))) (exists ((v_prenex_87 Int)) (let ((.cse26 (* 9 v_prenex_87))) (let ((.cse25 (div .cse26 10))) (let ((.cse24 (mod .cse25 299993))) (and (<= (+ c_~a1~0 75818) (div (+ .cse24 (- 300005)) 5)) (<= 0 (+ .cse25 1)) (not (= (mod .cse24 5) 0)) (<= 0 .cse26) (< .cse24 300005) (<= |c_old(~a1~0)| v_prenex_87) (<= 0 .cse25)))))) (exists ((v_prenex_54 Int)) (let ((.cse30 (* 9 v_prenex_54))) (let ((.cse29 (div .cse30 10))) (let ((.cse28 (+ .cse29 1))) (let ((.cse27 (mod .cse28 299993))) (and (not (= 0 (mod (+ .cse27 2) 5))) (< .cse27 599998) (< .cse28 0) (<= (+ c_~a1~0 75818) (div (+ .cse27 (- 599998)) 5)) (not (= 0 (mod .cse29 299993))) (< .cse29 0) (<= |c_old(~a1~0)| v_prenex_54) (< .cse30 0) (not (= .cse27 0)) (not (= (mod .cse30 10) 0)))))))) (exists ((v_prenex_77 Int)) (let ((.cse32 (* 9 v_prenex_77))) (let ((.cse33 (div .cse32 10))) (let ((.cse31 (mod (+ .cse33 1) 299993))) (and (= .cse31 0) (< .cse32 0) (not (= (mod .cse32 10) 0)) (< .cse31 300005) (<= (+ c_~a1~0 75818) (div (+ .cse31 (- 300005)) 5)) (not (= (mod .cse31 5) 0)) (<= |c_old(~a1~0)| v_prenex_77) (= 0 (mod .cse33 299993))))))) (exists ((v_prenex_93 Int)) (let ((.cse36 (* 9 v_prenex_93))) (let ((.cse34 (div .cse36 10))) (let ((.cse35 (mod .cse34 299993))) (and (< .cse34 0) (< .cse35 599998) (<= |c_old(~a1~0)| v_prenex_93) (not (= 0 .cse35)) (= (mod .cse36 10) 0) (<= (+ c_~a1~0 75818) (div (+ .cse35 (- 599998)) 5)) (not (= (mod (+ .cse35 2) 5) 0)) (<= 0 (+ .cse34 1))))))))) is different from false [2018-12-02 01:12:00,185 WARN L832 $PredicateComparison]: unable to prove that (and (= c_~a10~0 |c_old(~a10~0)|) (= c_~a19~0 |c_old(~a19~0)|) (or (exists ((v_prenex_97 Int)) (let ((.cse1 (* 9 v_prenex_97))) (let ((.cse0 (div .cse1 10))) (let ((.cse2 (mod .cse0 299993))) (and (< .cse0 0) (= (mod .cse1 10) 0) (<= |c_old(~a1~0)| v_prenex_97) (= (mod (+ .cse0 1) 299993) 0) (<= (+ c_~a1~0 75818) (div (+ .cse2 (- 599998)) 5)) (not (= (mod (+ .cse2 2) 5) 0)) (< .cse2 599998) (not (= 0 .cse2))))))) (exists ((v_prenex_31 Int)) (let ((.cse5 (* 9 v_prenex_31))) (let ((.cse6 (div .cse5 10))) (let ((.cse4 (+ .cse6 1)) (.cse3 (mod .cse6 299993))) (and (<= (+ c_~a1~0 75818) (div (+ .cse3 (- 300005)) 5)) (<= |c_old(~a1~0)| v_prenex_31) (< .cse4 0) (not (= (mod .cse4 299993) 0)) (= (mod .cse5 10) 0) (not (= (mod .cse3 5) 0)) (< .cse3 300005) (= 0 .cse3)))))) (exists ((v_prenex_99 Int)) (let ((.cse8 (* 9 v_prenex_99))) (let ((.cse9 (div .cse8 10))) (let ((.cse7 (mod .cse9 299993))) (and (< .cse7 300005) (<= (+ c_~a1~0 75818) (div (+ .cse7 (- 300005)) 5)) (= 0 .cse7) (<= |c_old(~a1~0)| v_prenex_99) (= (mod .cse8 10) 0) (not (= (mod .cse7 5) 0)) (= (mod (+ .cse9 1) 299993) 0)))))) (exists ((v_prenex_42 Int)) (let ((.cse12 (* 9 v_prenex_42))) (let ((.cse10 (div .cse12 10))) (let ((.cse11 (mod .cse10 299993))) (and (<= 0 (+ .cse10 1)) (<= (+ c_~a1~0 75819) (div (+ .cse11 (- 300005)) 5)) (<= 0 .cse10) (= (mod .cse11 5) 0) (<= 0 .cse12) (<= |c_old(~a1~0)| v_prenex_42)))))) (exists ((v_prenex_90 Int)) (let ((.cse13 (* 9 v_prenex_90))) (let ((.cse16 (div .cse13 10))) (let ((.cse14 (+ .cse16 1))) (let ((.cse15 (mod .cse14 299993))) (and (not (= (mod .cse13 10) 0)) (<= |c_old(~a1~0)| v_prenex_90) (< .cse14 0) (not (= .cse15 0)) (<= (+ c_~a1~0 75818) (div (+ .cse15 (- 599998)) 5)) (= 0 (mod .cse16 299993)) (< .cse15 599998) (< .cse13 0) (not (= 0 (mod (+ .cse15 2) 5))))))))) (exists ((v_prenex_68 Int)) (let ((.cse19 (* 9 v_prenex_68))) (let ((.cse17 (div .cse19 10))) (let ((.cse18 (mod (+ .cse17 1) 299993))) (and (< .cse17 0) (< .cse18 300005) (= .cse18 0) (< .cse19 0) (not (= (mod .cse19 10) 0)) (<= (+ c_~a1~0 75818) (div (+ .cse18 (- 300005)) 5)) (<= |c_old(~a1~0)| v_prenex_68) (not (= (mod .cse18 5) 0)) (not (= 0 (mod .cse17 299993)))))))) (exists ((v_prenex_36 Int)) (let ((.cse20 (* 9 v_prenex_36))) (let ((.cse23 (div .cse20 10))) (let ((.cse21 (mod .cse23 299993)) (.cse22 (+ .cse23 1))) (and (= (mod .cse20 10) 0) (< .cse21 599998) (<= (+ c_~a1~0 75818) (div (+ .cse21 (- 599998)) 5)) (not (= (mod .cse22 299993) 0)) (<= |c_old(~a1~0)| v_prenex_36) (not (= (mod (+ .cse21 2) 5) 0)) (not (= 0 .cse21)) (< .cse23 0) (< .cse22 0)))))) (exists ((v_prenex_87 Int)) (let ((.cse26 (* 9 v_prenex_87))) (let ((.cse25 (div .cse26 10))) (let ((.cse24 (mod .cse25 299993))) (and (<= (+ c_~a1~0 75818) (div (+ .cse24 (- 300005)) 5)) (<= 0 (+ .cse25 1)) (not (= (mod .cse24 5) 0)) (<= 0 .cse26) (< .cse24 300005) (<= |c_old(~a1~0)| v_prenex_87) (<= 0 .cse25)))))) (exists ((v_prenex_54 Int)) (let ((.cse30 (* 9 v_prenex_54))) (let ((.cse29 (div .cse30 10))) (let ((.cse28 (+ .cse29 1))) (let ((.cse27 (mod .cse28 299993))) (and (not (= 0 (mod (+ .cse27 2) 5))) (< .cse27 599998) (< .cse28 0) (<= (+ c_~a1~0 75818) (div (+ .cse27 (- 599998)) 5)) (not (= 0 (mod .cse29 299993))) (< .cse29 0) (<= |c_old(~a1~0)| v_prenex_54) (< .cse30 0) (not (= .cse27 0)) (not (= (mod .cse30 10) 0)))))))) (exists ((v_prenex_77 Int)) (let ((.cse32 (* 9 v_prenex_77))) (let ((.cse33 (div .cse32 10))) (let ((.cse31 (mod (+ .cse33 1) 299993))) (and (= .cse31 0) (< .cse32 0) (not (= (mod .cse32 10) 0)) (< .cse31 300005) (<= (+ c_~a1~0 75818) (div (+ .cse31 (- 300005)) 5)) (not (= (mod .cse31 5) 0)) (<= |c_old(~a1~0)| v_prenex_77) (= 0 (mod .cse33 299993))))))) (exists ((v_prenex_93 Int)) (let ((.cse36 (* 9 v_prenex_93))) (let ((.cse34 (div .cse36 10))) (let ((.cse35 (mod .cse34 299993))) (and (< .cse34 0) (< .cse35 599998) (<= |c_old(~a1~0)| v_prenex_93) (not (= 0 .cse35)) (= (mod .cse36 10) 0) (<= (+ c_~a1~0 75818) (div (+ .cse35 (- 599998)) 5)) (not (= (mod (+ .cse35 2) 5) 0)) (<= 0 (+ .cse34 1)))))))) (= c_~a1~0 |c_old(~a1~0)|)) is different from false [2018-12-02 01:12:02,432 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~a12~0 0)) (.cse2 (= c_~a4~0 14))) (and (<= c_~a1~0 |c_old(~a1~0)|) .cse0 (or (let ((.cse1 (= 0 c_~a10~0))) (and (or .cse1 (= c_~a10~0 |c_old(~a10~0)|)) (or (and (= |c_old(~a19~0)| c_~a19~0) (not (= c_~a19~0 9))) (not .cse1)))) (not .cse2) (not .cse0) (< 0 (+ c_~a1~0 13))) .cse2 (or (exists ((v_prenex_97 Int)) (let ((.cse4 (* 9 v_prenex_97))) (let ((.cse3 (div .cse4 10))) (let ((.cse5 (mod .cse3 299993))) (and (< .cse3 0) (= (mod .cse4 10) 0) (<= |c_old(~a1~0)| v_prenex_97) (= (mod (+ .cse3 1) 299993) 0) (<= (+ c_~a1~0 75818) (div (+ .cse5 (- 599998)) 5)) (not (= (mod (+ .cse5 2) 5) 0)) (< .cse5 599998) (not (= 0 .cse5))))))) (exists ((v_prenex_31 Int)) (let ((.cse8 (* 9 v_prenex_31))) (let ((.cse9 (div .cse8 10))) (let ((.cse7 (+ .cse9 1)) (.cse6 (mod .cse9 299993))) (and (<= (+ c_~a1~0 75818) (div (+ .cse6 (- 300005)) 5)) (<= |c_old(~a1~0)| v_prenex_31) (< .cse7 0) (not (= (mod .cse7 299993) 0)) (= (mod .cse8 10) 0) (not (= (mod .cse6 5) 0)) (< .cse6 300005) (= 0 .cse6)))))) (exists ((v_prenex_99 Int)) (let ((.cse11 (* 9 v_prenex_99))) (let ((.cse12 (div .cse11 10))) (let ((.cse10 (mod .cse12 299993))) (and (< .cse10 300005) (<= (+ c_~a1~0 75818) (div (+ .cse10 (- 300005)) 5)) (= 0 .cse10) (<= |c_old(~a1~0)| v_prenex_99) (= (mod .cse11 10) 0) (not (= (mod .cse10 5) 0)) (= (mod (+ .cse12 1) 299993) 0)))))) (exists ((v_prenex_42 Int)) (let ((.cse15 (* 9 v_prenex_42))) (let ((.cse13 (div .cse15 10))) (let ((.cse14 (mod .cse13 299993))) (and (<= 0 (+ .cse13 1)) (<= (+ c_~a1~0 75819) (div (+ .cse14 (- 300005)) 5)) (<= 0 .cse13) (= (mod .cse14 5) 0) (<= 0 .cse15) (<= |c_old(~a1~0)| v_prenex_42)))))) (exists ((v_prenex_90 Int)) (let ((.cse16 (* 9 v_prenex_90))) (let ((.cse19 (div .cse16 10))) (let ((.cse17 (+ .cse19 1))) (let ((.cse18 (mod .cse17 299993))) (and (not (= (mod .cse16 10) 0)) (<= |c_old(~a1~0)| v_prenex_90) (< .cse17 0) (not (= .cse18 0)) (<= (+ c_~a1~0 75818) (div (+ .cse18 (- 599998)) 5)) (= 0 (mod .cse19 299993)) (< .cse18 599998) (< .cse16 0) (not (= 0 (mod (+ .cse18 2) 5))))))))) (exists ((v_prenex_68 Int)) (let ((.cse22 (* 9 v_prenex_68))) (let ((.cse20 (div .cse22 10))) (let ((.cse21 (mod (+ .cse20 1) 299993))) (and (< .cse20 0) (< .cse21 300005) (= .cse21 0) (< .cse22 0) (not (= (mod .cse22 10) 0)) (<= (+ c_~a1~0 75818) (div (+ .cse21 (- 300005)) 5)) (<= |c_old(~a1~0)| v_prenex_68) (not (= (mod .cse21 5) 0)) (not (= 0 (mod .cse20 299993)))))))) (exists ((v_prenex_36 Int)) (let ((.cse23 (* 9 v_prenex_36))) (let ((.cse26 (div .cse23 10))) (let ((.cse24 (mod .cse26 299993)) (.cse25 (+ .cse26 1))) (and (= (mod .cse23 10) 0) (< .cse24 599998) (<= (+ c_~a1~0 75818) (div (+ .cse24 (- 599998)) 5)) (not (= (mod .cse25 299993) 0)) (<= |c_old(~a1~0)| v_prenex_36) (not (= (mod (+ .cse24 2) 5) 0)) (not (= 0 .cse24)) (< .cse26 0) (< .cse25 0)))))) (exists ((v_prenex_87 Int)) (let ((.cse29 (* 9 v_prenex_87))) (let ((.cse28 (div .cse29 10))) (let ((.cse27 (mod .cse28 299993))) (and (<= (+ c_~a1~0 75818) (div (+ .cse27 (- 300005)) 5)) (<= 0 (+ .cse28 1)) (not (= (mod .cse27 5) 0)) (<= 0 .cse29) (< .cse27 300005) (<= |c_old(~a1~0)| v_prenex_87) (<= 0 .cse28)))))) (exists ((v_prenex_54 Int)) (let ((.cse33 (* 9 v_prenex_54))) (let ((.cse32 (div .cse33 10))) (let ((.cse31 (+ .cse32 1))) (let ((.cse30 (mod .cse31 299993))) (and (not (= 0 (mod (+ .cse30 2) 5))) (< .cse30 599998) (< .cse31 0) (<= (+ c_~a1~0 75818) (div (+ .cse30 (- 599998)) 5)) (not (= 0 (mod .cse32 299993))) (< .cse32 0) (<= |c_old(~a1~0)| v_prenex_54) (< .cse33 0) (not (= .cse30 0)) (not (= (mod .cse33 10) 0)))))))) (exists ((v_prenex_77 Int)) (let ((.cse35 (* 9 v_prenex_77))) (let ((.cse36 (div .cse35 10))) (let ((.cse34 (mod (+ .cse36 1) 299993))) (and (= .cse34 0) (< .cse35 0) (not (= (mod .cse35 10) 0)) (< .cse34 300005) (<= (+ c_~a1~0 75818) (div (+ .cse34 (- 300005)) 5)) (not (= (mod .cse34 5) 0)) (<= |c_old(~a1~0)| v_prenex_77) (= 0 (mod .cse36 299993))))))) (exists ((v_prenex_93 Int)) (let ((.cse39 (* 9 v_prenex_93))) (let ((.cse37 (div .cse39 10))) (let ((.cse38 (mod .cse37 299993))) (and (< .cse37 0) (< .cse38 599998) (<= |c_old(~a1~0)| v_prenex_93) (not (= 0 .cse38)) (= (mod .cse39 10) 0) (<= (+ c_~a1~0 75818) (div (+ .cse38 (- 599998)) 5)) (not (= (mod (+ .cse38 2) 5) 0)) (<= 0 (+ .cse37 1)))))))))) is different from false [2018-12-02 01:13:30,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:13:30,756 INFO L93 Difference]: Finished difference Result 7155 states and 8870 transitions. [2018-12-02 01:13:30,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-02 01:13:30,757 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 323 [2018-12-02 01:13:30,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:13:30,765 INFO L225 Difference]: With dead ends: 7155 [2018-12-02 01:13:30,766 INFO L226 Difference]: Without dead ends: 4336 [2018-12-02 01:13:30,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 326 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1948 ImplicationChecksByTransitivity, 276.2s TimeCoverageRelationStatistics Valid=1158, Invalid=5160, Unknown=18, NotChecked=636, Total=6972 [2018-12-02 01:13:30,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4336 states. [2018-12-02 01:13:30,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4336 to 3900. [2018-12-02 01:13:30,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3900 states. [2018-12-02 01:13:30,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3900 states to 3900 states and 4676 transitions. [2018-12-02 01:13:30,849 INFO L78 Accepts]: Start accepts. Automaton has 3900 states and 4676 transitions. Word has length 323 [2018-12-02 01:13:30,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:13:30,850 INFO L480 AbstractCegarLoop]: Abstraction has 3900 states and 4676 transitions. [2018-12-02 01:13:30,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-02 01:13:30,850 INFO L276 IsEmpty]: Start isEmpty. Operand 3900 states and 4676 transitions. [2018-12-02 01:13:30,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-12-02 01:13:30,854 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:13:30,854 INFO L402 BasicCegarLoop]: trace histogram [4, 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, 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] [2018-12-02 01:13:30,854 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:13:30,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:13:30,855 INFO L82 PathProgramCache]: Analyzing trace with hash 354790451, now seen corresponding path program 1 times [2018-12-02 01:13:30,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:13:30,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:13:30,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:13:30,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:13:30,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:13:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:13:31,168 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 129 proven. 82 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-12-02 01:13:31,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:13:31,169 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6aca4f46-dfb7-4e32-b33d-cc0c3dd6ae01/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-12-02 01:13:31,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:13:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:13:31,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:13:31,279 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 275 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-02 01:13:31,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:13:31,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2018-12-02 01:13:31,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 01:13:31,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 01:13:31,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-12-02 01:13:31,295 INFO L87 Difference]: Start difference. First operand 3900 states and 4676 transitions. Second operand 15 states. [2018-12-02 01:13:33,042 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2018-12-02 01:13:33,300 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-12-02 01:13:34,191 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 29 [2018-12-02 01:13:34,744 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 26 [2018-12-02 01:13:36,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:13:36,016 INFO L93 Difference]: Finished difference Result 7710 states and 9479 transitions. [2018-12-02 01:13:36,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-02 01:13:36,016 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 327 [2018-12-02 01:13:36,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:13:36,024 INFO L225 Difference]: With dead ends: 7710 [2018-12-02 01:13:36,024 INFO L226 Difference]: Without dead ends: 4106 [2018-12-02 01:13:36,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=584, Invalid=1866, Unknown=0, NotChecked=0, Total=2450 [2018-12-02 01:13:36,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2018-12-02 01:13:36,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 4045. [2018-12-02 01:13:36,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4045 states. [2018-12-02 01:13:36,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4045 states to 4045 states and 4648 transitions. [2018-12-02 01:13:36,101 INFO L78 Accepts]: Start accepts. Automaton has 4045 states and 4648 transitions. Word has length 327 [2018-12-02 01:13:36,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:13:36,102 INFO L480 AbstractCegarLoop]: Abstraction has 4045 states and 4648 transitions. [2018-12-02 01:13:36,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 01:13:36,102 INFO L276 IsEmpty]: Start isEmpty. Operand 4045 states and 4648 transitions. [2018-12-02 01:13:36,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-12-02 01:13:36,105 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:13:36,105 INFO L402 BasicCegarLoop]: trace histogram [4, 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, 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] [2018-12-02 01:13:36,106 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:13:36,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:13:36,106 INFO L82 PathProgramCache]: Analyzing trace with hash -832891204, now seen corresponding path program 1 times [2018-12-02 01:13:36,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:13:36,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:13:36,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:13:36,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:13:36,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:13:36,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:13:36,435 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 210 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:13:36,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:13:36,436 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6aca4f46-dfb7-4e32-b33d-cc0c3dd6ae01/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-12-02 01:13:36,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:13:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:13:36,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:13:37,089 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 204 proven. 2 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-02 01:13:37,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:13:37,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5] total 15 [2018-12-02 01:13:37,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 01:13:37,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 01:13:37,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-12-02 01:13:37,105 INFO L87 Difference]: Start difference. First operand 4045 states and 4648 transitions. Second operand 15 states. [2018-12-02 01:13:38,422 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2018-12-02 01:13:39,745 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2018-12-02 01:13:40,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:13:40,915 INFO L93 Difference]: Finished difference Result 8915 states and 10406 transitions. [2018-12-02 01:13:40,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-02 01:13:40,916 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 332 [2018-12-02 01:13:40,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:13:40,928 INFO L225 Difference]: With dead ends: 8915 [2018-12-02 01:13:40,928 INFO L226 Difference]: Without dead ends: 5311 [2018-12-02 01:13:40,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 357 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=522, Invalid=1734, Unknown=0, NotChecked=0, Total=2256 [2018-12-02 01:13:40,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5311 states. [2018-12-02 01:13:40,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5311 to 4321. [2018-12-02 01:13:40,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4321 states. [2018-12-02 01:13:41,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 4935 transitions. [2018-12-02 01:13:41,001 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 4935 transitions. Word has length 332 [2018-12-02 01:13:41,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:13:41,001 INFO L480 AbstractCegarLoop]: Abstraction has 4321 states and 4935 transitions. [2018-12-02 01:13:41,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 01:13:41,001 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 4935 transitions. [2018-12-02 01:13:41,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-12-02 01:13:41,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:13:41,004 INFO L402 BasicCegarLoop]: trace histogram [4, 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, 2, 2, 2, 2, 2, 2, 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] [2018-12-02 01:13:41,005 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:13:41,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:13:41,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1525905386, now seen corresponding path program 1 times [2018-12-02 01:13:41,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:13:41,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:13:41,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:13:41,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:13:41,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:13:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:13:41,176 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 116 proven. 87 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-02 01:13:41,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:13:41,176 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6aca4f46-dfb7-4e32-b33d-cc0c3dd6ae01/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:13:41,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:13:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:13:41,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:13:41,283 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 240 proven. 2 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-12-02 01:13:41,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:13:41,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-12-02 01:13:41,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 01:13:41,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 01:13:41,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-12-02 01:13:41,300 INFO L87 Difference]: Start difference. First operand 4321 states and 4935 transitions. Second operand 11 states. [2018-12-02 01:13:42,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:13:42,998 INFO L93 Difference]: Finished difference Result 8807 states and 10171 transitions. [2018-12-02 01:13:42,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 01:13:42,998 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 342 [2018-12-02 01:13:42,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:13:43,011 INFO L225 Difference]: With dead ends: 8807 [2018-12-02 01:13:43,011 INFO L226 Difference]: Without dead ends: 4782 [2018-12-02 01:13:43,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 349 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-12-02 01:13:43,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4782 states. [2018-12-02 01:13:43,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4782 to 4321. [2018-12-02 01:13:43,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4321 states. [2018-12-02 01:13:43,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 4866 transitions. [2018-12-02 01:13:43,093 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 4866 transitions. Word has length 342 [2018-12-02 01:13:43,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:13:43,094 INFO L480 AbstractCegarLoop]: Abstraction has 4321 states and 4866 transitions. [2018-12-02 01:13:43,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 01:13:43,094 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 4866 transitions. [2018-12-02 01:13:43,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-12-02 01:13:43,096 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:13:43,097 INFO L402 BasicCegarLoop]: trace histogram [4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-12-02 01:13:43,097 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:13:43,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:13:43,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1547482966, now seen corresponding path program 1 times [2018-12-02 01:13:43,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:13:43,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:13:43,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:13:43,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:13:43,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:13:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:13:43,358 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 132 proven. 116 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 01:13:43,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:13:43,358 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6aca4f46-dfb7-4e32-b33d-cc0c3dd6ae01/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:13:43,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:13:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:13:43,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:13:45,980 WARN L180 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2018-12-02 01:13:48,097 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 0 proven. 323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:13:48,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:13:48,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-12-02 01:13:48,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 01:13:48,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 01:13:48,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=279, Unknown=1, NotChecked=0, Total=342 [2018-12-02 01:13:48,113 INFO L87 Difference]: Start difference. First operand 4321 states and 4866 transitions. Second operand 19 states. [2018-12-02 01:13:51,041 WARN L180 SmtUtils]: Spent 2.39 s on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2018-12-02 01:15:26,305 WARN L180 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2018-12-02 01:15:42,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:42,519 INFO L93 Difference]: Finished difference Result 10432 states and 12004 transitions. [2018-12-02 01:15:42,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-02 01:15:42,519 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 360 [2018-12-02 01:15:42,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:42,528 INFO L225 Difference]: With dead ends: 10432 [2018-12-02 01:15:42,528 INFO L226 Difference]: Without dead ends: 6407 [2018-12-02 01:15:42,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 361 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=471, Invalid=2076, Unknown=3, NotChecked=0, Total=2550 [2018-12-02 01:15:42,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6407 states. [2018-12-02 01:15:42,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6407 to 5517. [2018-12-02 01:15:42,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5517 states. [2018-12-02 01:15:42,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5517 states to 5517 states and 6122 transitions. [2018-12-02 01:15:42,612 INFO L78 Accepts]: Start accepts. Automaton has 5517 states and 6122 transitions. Word has length 360 [2018-12-02 01:15:42,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:42,613 INFO L480 AbstractCegarLoop]: Abstraction has 5517 states and 6122 transitions. [2018-12-02 01:15:42,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 01:15:42,613 INFO L276 IsEmpty]: Start isEmpty. Operand 5517 states and 6122 transitions. [2018-12-02 01:15:42,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-12-02 01:15:42,615 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:42,615 INFO L402 BasicCegarLoop]: trace histogram [4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-02 01:15:42,615 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:42,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:42,616 INFO L82 PathProgramCache]: Analyzing trace with hash -246018646, now seen corresponding path program 1 times [2018-12-02 01:15:42,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:15:42,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:15:42,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:42,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:42,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:15:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:15:42,708 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 01:15:42,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 01:15:42 BoogieIcfgContainer [2018-12-02 01:15:42,813 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 01:15:42,814 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 01:15:42,814 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 01:15:42,814 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 01:15:42,814 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:06:10" (3/4) ... [2018-12-02 01:15:42,816 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 01:15:42,917 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6aca4f46-dfb7-4e32-b33d-cc0c3dd6ae01/bin-2019/uautomizer/witness.graphml [2018-12-02 01:15:42,917 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 01:15:42,917 INFO L168 Benchmark]: Toolchain (without parser) took 573600.99 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 261.1 MB). Free memory was 951.7 MB in the beginning and 1.0 GB in the end (delta: -84.2 MB). Peak memory consumption was 176.9 MB. Max. memory is 11.5 GB. [2018-12-02 01:15:42,918 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:15:42,918 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -130.4 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. [2018-12-02 01:15:42,918 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.82 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:15:42,918 INFO L168 Benchmark]: Boogie Preprocessor took 53.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2018-12-02 01:15:42,918 INFO L168 Benchmark]: RCFGBuilder took 635.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 969.9 MB in the end (delta: 104.9 MB). Peak memory consumption was 104.9 MB. Max. memory is 11.5 GB. [2018-12-02 01:15:42,918 INFO L168 Benchmark]: TraceAbstraction took 572446.74 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 160.4 MB). Free memory was 969.9 MB in the beginning and 1.1 GB in the end (delta: -106.5 MB). Peak memory consumption was 54.0 MB. Max. memory is 11.5 GB. [2018-12-02 01:15:42,919 INFO L168 Benchmark]: Witness Printer took 102.93 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.5 MB). Peak memory consumption was 40.5 MB. Max. memory is 11.5 GB. [2018-12-02 01:15:42,920 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 333.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -130.4 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.82 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 635.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 969.9 MB in the end (delta: 104.9 MB). Peak memory consumption was 104.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 572446.74 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 160.4 MB). Free memory was 969.9 MB in the beginning and 1.1 GB in the end (delta: -106.5 MB). Peak memory consumption was 54.0 MB. Max. memory is 11.5 GB. * Witness Printer took 102.93 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.5 MB). Peak memory consumption was 40.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 46]: 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)=167155, \old(a10)=167159, \old(a12)=167163, \old(a19)=167156, \old(a4)=167160, \old(inputB)=167162, \old(inputC)=167161, \old(inputD)=167157, \old(inputE)=167154, \old(inputF)=167158, 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=-1] [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=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, 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)=6, a1=23, a10=0, a12=0, a19=9, 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)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, 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)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, 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)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, 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)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, 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)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L526] COND FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L529] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L534] COND FALSE !(((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L540] COND TRUE ((a12==0) && (((((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0))) [L541] a1 = (((((a1 + -272193) - -47605) - -570122) % 89)+ 110) [L542] a10 = 1 [L544] return 25; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, \result=25, a1=169, a10=1, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L590] RET, EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=169, a10=1, a12=0, a19=9, a4=14, calculate_output(input)=25, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [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=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=25] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L460] COND TRUE ((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0)))) [L461] a1 = (((a1 / 5) + 105416) + 61704) [L462] a10 = 4 [L464] return 24; VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, \result=24, a1=167153, a10=4, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L590] RET, EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=167153, a10=4, a12=0, a19=9, a4=14, calculate_output(input)=24, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=25] [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=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=24] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L271] COND TRUE ((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0)) [L272] a1 = (((((a1 % 25)+ -8) * 5) % 25)+ 13) [L273] a10 = 1 [L274] a19 = 7 [L276] return -1; VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, \result=-1, a1=13, a10=1, a12=0, a19=7, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L590] RET, EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=13, a10=1, a12=0, a19=7, a4=14, calculate_output(input)=-1, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=24] [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=13, a10=1, a12=0, a19=7, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L590] CALL calculate_output(input) VAL [\old(a1)=13, \old(a10)=1, \old(a19)=7, \old(input)=3, a1=13, a10=1, a12=0, a19=7, 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)=13, \old(a10)=1, \old(a19)=7, \old(input)=3, a1=13, a10=1, a12=0, a19=7, a4=14, input=3, 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)=13, \old(a10)=1, \old(a19)=7, \old(input)=3, a1=13, a10=1, a12=0, a19=7, a4=14, input=3, 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)=13, \old(a10)=1, \old(a19)=7, \old(input)=3, a1=13, a10=1, a12=0, a19=7, a4=14, input=3, 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)=13, \old(a10)=1, \old(a19)=7, \old(input)=3, a1=13, a10=1, a12=0, a19=7, a4=14, input=3, 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)=13, \old(a10)=1, \old(a19)=7, \old(input)=3, a1=13, a10=1, a12=0, a19=7, a4=14, input=3, 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)=13, \old(a10)=1, \old(a19)=7, \old(input)=3, a1=13, a10=1, a12=0, a19=7, a4=14, input=3, 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)=13, \old(a10)=1, \old(a19)=7, \old(input)=3, a1=13, a10=1, a12=0, a19=7, a4=14, input=3, 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)=13, \old(a10)=1, \old(a19)=7, \old(input)=3, a1=13, a10=1, a12=0, a19=7, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND TRUE (((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)) VAL [\old(a1)=13, \old(a10)=1, \old(a19)=7, \old(input)=3, a1=13, a10=1, a12=0, a19=7, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] __VERIFIER_error() VAL [\old(a1)=13, \old(a10)=1, \old(a19)=7, \old(input)=3, a1=13, a10=1, a12=0, a19=7, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 215 locations, 1 error locations. UNSAFE Result, 572.3s OverallTime, 14 OverallIterations, 4 TraceHistogramMax, 435.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 471 SDtfs, 16572 SDslu, 1634 SDs, 0 SdLazy, 27207 SolverSat, 5408 SolverUnsat, 205 SolverUnknown, 0 SolverNotchecked, 230.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3232 GetRequests, 2836 SyntacticMatches, 16 SemanticMatches, 380 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 5164 ImplicationChecksByTransitivity, 332.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5517occurred in iteration=13, 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.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 3334 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 133.8s InterpolantComputationTime, 6108 NumberOfCodeBlocks, 6108 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 5726 ConstructedInterpolants, 36 QuantifiedInterpolants, 10310191 SizeOfPredicates, 15 NumberOfNonLiveVariables, 4563 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 3528/4949 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...