./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label44.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5f0b28f0-c7ed-4be4-8ccf-285eec0e79cc/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5f0b28f0-c7ed-4be4-8ccf-285eec0e79cc/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5f0b28f0-c7ed-4be4-8ccf-285eec0e79cc/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5f0b28f0-c7ed-4be4-8ccf-285eec0e79cc/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label44.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5f0b28f0-c7ed-4be4-8ccf-285eec0e79cc/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5f0b28f0-c7ed-4be4-8ccf-285eec0e79cc/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eb2ed652d9060283eed99b129e3cfec21e515617 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.24-cad4683 [2019-10-22 11:21:47,026 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:21:47,028 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:21:47,037 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:21:47,038 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:21:47,039 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:21:47,040 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:21:47,042 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:21:47,043 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:21:47,046 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:21:47,048 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:21:47,049 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:21:47,054 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:21:47,056 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:21:47,057 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:21:47,057 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:21:47,058 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:21:47,058 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:21:47,059 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:21:47,060 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:21:47,064 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:21:47,066 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:21:47,068 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:21:47,070 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:21:47,071 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:21:47,071 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:21:47,071 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:21:47,072 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:21:47,072 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:21:47,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:21:47,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:21:47,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:21:47,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:21:47,077 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:21:47,078 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:21:47,079 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:21:47,079 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:21:47,080 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:21:47,080 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:21:47,080 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:21:47,082 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:21:47,083 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5f0b28f0-c7ed-4be4-8ccf-285eec0e79cc/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:21:47,094 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:21:47,105 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:21:47,105 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:21:47,105 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:21:47,106 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:21:47,106 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:21:47,106 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:21:47,106 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:21:47,106 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:21:47,106 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:21:47,106 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:21:47,107 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:21:47,107 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:21:47,107 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:21:47,107 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:21:47,108 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:21:47,108 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:21:47,108 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:21:47,108 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:21:47,108 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:21:47,108 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:21:47,108 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:21:47,109 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:21:47,109 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:21:47,109 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:21:47,110 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:21:47,110 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:21:47,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:21:47,110 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:21:47,110 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:21:47,110 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:21:47,110 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:21:47,111 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:21:47,111 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:21:47,111 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:21:47,111 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_5f0b28f0-c7ed-4be4-8ccf-285eec0e79cc/bin/utaipan 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 -> Taipan 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 -> eb2ed652d9060283eed99b129e3cfec21e515617 [2019-10-22 11:21:47,133 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:21:47,142 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:21:47,144 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:21:47,145 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:21:47,146 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:21:47,146 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5f0b28f0-c7ed-4be4-8ccf-285eec0e79cc/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem02_label44.c [2019-10-22 11:21:47,187 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5f0b28f0-c7ed-4be4-8ccf-285eec0e79cc/bin/utaipan/data/229281b9f/adfb869563994242817913682d2d904d/FLAG434faf1ed [2019-10-22 11:21:47,675 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:21:47,675 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5f0b28f0-c7ed-4be4-8ccf-285eec0e79cc/sv-benchmarks/c/eca-rers2012/Problem02_label44.c [2019-10-22 11:21:47,688 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5f0b28f0-c7ed-4be4-8ccf-285eec0e79cc/bin/utaipan/data/229281b9f/adfb869563994242817913682d2d904d/FLAG434faf1ed [2019-10-22 11:21:48,166 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5f0b28f0-c7ed-4be4-8ccf-285eec0e79cc/bin/utaipan/data/229281b9f/adfb869563994242817913682d2d904d [2019-10-22 11:21:48,168 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:21:48,170 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:21:48,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:48,171 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:21:48,176 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:21:48,178 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:48" (1/1) ... [2019-10-22 11:21:48,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f0d4389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:48, skipping insertion in model container [2019-10-22 11:21:48,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:48" (1/1) ... [2019-10-22 11:21:48,186 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:21:48,236 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:21:48,630 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:48,635 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:21:48,763 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:48,779 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:21:48,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:48 WrapperNode [2019-10-22 11:21:48,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:48,781 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:48,781 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:21:48,781 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:21:48,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:48" (1/1) ... [2019-10-22 11:21:48,816 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:48" (1/1) ... [2019-10-22 11:21:48,883 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:48,884 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:21:48,884 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:21:48,884 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:21:48,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:48" (1/1) ... [2019-10-22 11:21:48,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:48" (1/1) ... [2019-10-22 11:21:48,896 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:48" (1/1) ... [2019-10-22 11:21:48,896 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:48" (1/1) ... [2019-10-22 11:21:48,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:48" (1/1) ... [2019-10-22 11:21:48,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:48" (1/1) ... [2019-10-22 11:21:48,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:48" (1/1) ... [2019-10-22 11:21:48,952 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:21:48,961 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:21:48,961 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:21:48,961 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:21:48,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f0b28f0-c7ed-4be4-8ccf-285eec0e79cc/bin/utaipan/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 [2019-10-22 11:21:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:21:49,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:21:50,045 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:21:50,045 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 11:21:50,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:50 BoogieIcfgContainer [2019-10-22 11:21:50,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:21:50,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:21:50,048 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:21:50,051 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:21:50,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:21:48" (1/3) ... [2019-10-22 11:21:50,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792254dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:50, skipping insertion in model container [2019-10-22 11:21:50,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:48" (2/3) ... [2019-10-22 11:21:50,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792254dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:50, skipping insertion in model container [2019-10-22 11:21:50,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:50" (3/3) ... [2019-10-22 11:21:50,057 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label44.c [2019-10-22 11:21:50,067 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:21:50,076 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:21:50,086 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:21:50,109 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:21:50,110 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:21:50,110 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:21:50,110 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:21:50,110 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:21:50,110 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:21:50,110 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:21:50,110 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:21:50,127 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-10-22 11:21:50,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-22 11:21:50,135 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:50,136 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:50,138 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:50,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:50,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1094583259, now seen corresponding path program 1 times [2019-10-22 11:21:50,152 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:50,152 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327465988] [2019-10-22 11:21:50,152 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:50,152 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:50,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:50,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:50,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:50,525 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327465988] [2019-10-22 11:21:50,526 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:50,526 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:50,526 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415623742] [2019-10-22 11:21:50,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:50,535 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:50,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:50,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:50,550 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-10-22 11:21:51,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:51,762 INFO L93 Difference]: Finished difference Result 775 states and 1353 transitions. [2019-10-22 11:21:51,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:51,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-22 11:21:51,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:51,776 INFO L225 Difference]: With dead ends: 775 [2019-10-22 11:21:51,776 INFO L226 Difference]: Without dead ends: 460 [2019-10-22 11:21:51,779 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:51,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-10-22 11:21:51,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 308. [2019-10-22 11:21:51,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-10-22 11:21:51,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 451 transitions. [2019-10-22 11:21:51,832 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 451 transitions. Word has length 88 [2019-10-22 11:21:51,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:51,833 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 451 transitions. [2019-10-22 11:21:51,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:51,833 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 451 transitions. [2019-10-22 11:21:51,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-22 11:21:51,835 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:51,835 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:51,836 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:51,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:51,836 INFO L82 PathProgramCache]: Analyzing trace with hash 605301392, now seen corresponding path program 1 times [2019-10-22 11:21:51,836 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:51,836 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933682675] [2019-10-22 11:21:51,837 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:51,837 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:51,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:51,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:51,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:51,916 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933682675] [2019-10-22 11:21:51,916 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:51,916 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:51,916 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967579674] [2019-10-22 11:21:51,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:51,918 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:51,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:51,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:51,918 INFO L87 Difference]: Start difference. First operand 308 states and 451 transitions. Second operand 3 states. [2019-10-22 11:21:52,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:52,343 INFO L93 Difference]: Finished difference Result 903 states and 1331 transitions. [2019-10-22 11:21:52,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:52,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-10-22 11:21:52,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:52,347 INFO L225 Difference]: With dead ends: 903 [2019-10-22 11:21:52,347 INFO L226 Difference]: Without dead ends: 597 [2019-10-22 11:21:52,349 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:52,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-10-22 11:21:52,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 592. [2019-10-22 11:21:52,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-22 11:21:52,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 825 transitions. [2019-10-22 11:21:52,378 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 825 transitions. Word has length 92 [2019-10-22 11:21:52,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:52,378 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 825 transitions. [2019-10-22 11:21:52,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:52,378 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 825 transitions. [2019-10-22 11:21:52,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 11:21:52,387 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:52,387 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 11:21:52,388 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:52,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:52,388 INFO L82 PathProgramCache]: Analyzing trace with hash -539647583, now seen corresponding path program 1 times [2019-10-22 11:21:52,389 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:52,389 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662407500] [2019-10-22 11:21:52,389 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:52,389 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:52,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:52,440 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:52,440 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662407500] [2019-10-22 11:21:52,440 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:52,440 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:52,440 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098652283] [2019-10-22 11:21:52,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:52,444 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:52,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:52,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:52,444 INFO L87 Difference]: Start difference. First operand 592 states and 825 transitions. Second operand 3 states. [2019-10-22 11:21:52,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:52,842 INFO L93 Difference]: Finished difference Result 1742 states and 2434 transitions. [2019-10-22 11:21:52,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:52,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-10-22 11:21:52,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:52,847 INFO L225 Difference]: With dead ends: 1742 [2019-10-22 11:21:52,847 INFO L226 Difference]: Without dead ends: 1152 [2019-10-22 11:21:52,848 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:52,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2019-10-22 11:21:52,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1152. [2019-10-22 11:21:52,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152 states. [2019-10-22 11:21:52,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1520 transitions. [2019-10-22 11:21:52,879 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1520 transitions. Word has length 98 [2019-10-22 11:21:52,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:52,880 INFO L462 AbstractCegarLoop]: Abstraction has 1152 states and 1520 transitions. [2019-10-22 11:21:52,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:52,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1520 transitions. [2019-10-22 11:21:52,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-22 11:21:52,888 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:52,888 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:52,888 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:52,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:52,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1461599014, now seen corresponding path program 1 times [2019-10-22 11:21:52,888 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:52,888 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776490030] [2019-10-22 11:21:52,889 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:52,889 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:52,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:52,967 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:52,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776490030] [2019-10-22 11:21:52,968 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:52,969 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:52,969 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149064867] [2019-10-22 11:21:52,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:52,971 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:52,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:52,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:52,972 INFO L87 Difference]: Start difference. First operand 1152 states and 1520 transitions. Second operand 4 states. [2019-10-22 11:21:53,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:53,475 INFO L93 Difference]: Finished difference Result 2306 states and 3045 transitions. [2019-10-22 11:21:53,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:53,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-22 11:21:53,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:53,480 INFO L225 Difference]: With dead ends: 2306 [2019-10-22 11:21:53,480 INFO L226 Difference]: Without dead ends: 1156 [2019-10-22 11:21:53,484 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:53,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2019-10-22 11:21:53,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1151. [2019-10-22 11:21:53,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2019-10-22 11:21:53,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1466 transitions. [2019-10-22 11:21:53,514 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1466 transitions. Word has length 106 [2019-10-22 11:21:53,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:53,515 INFO L462 AbstractCegarLoop]: Abstraction has 1151 states and 1466 transitions. [2019-10-22 11:21:53,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:53,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1466 transitions. [2019-10-22 11:21:53,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-22 11:21:53,518 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:53,518 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:53,519 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:53,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:53,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1605878993, now seen corresponding path program 1 times [2019-10-22 11:21:53,519 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:53,519 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117795560] [2019-10-22 11:21:53,520 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:53,520 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:53,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:53,621 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:53,621 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117795560] [2019-10-22 11:21:53,622 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:53,622 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:53,622 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625886681] [2019-10-22 11:21:53,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:53,622 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:53,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:53,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:53,623 INFO L87 Difference]: Start difference. First operand 1151 states and 1466 transitions. Second operand 4 states. [2019-10-22 11:21:54,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:54,392 INFO L93 Difference]: Finished difference Result 3563 states and 4486 transitions. [2019-10-22 11:21:54,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:54,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-10-22 11:21:54,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:54,399 INFO L225 Difference]: With dead ends: 3563 [2019-10-22 11:21:54,399 INFO L226 Difference]: Without dead ends: 2414 [2019-10-22 11:21:54,401 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:54,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2019-10-22 11:21:54,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 2411. [2019-10-22 11:21:54,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2411 states. [2019-10-22 11:21:54,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 2848 transitions. [2019-10-22 11:21:54,448 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 2848 transitions. Word has length 110 [2019-10-22 11:21:54,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:54,449 INFO L462 AbstractCegarLoop]: Abstraction has 2411 states and 2848 transitions. [2019-10-22 11:21:54,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:54,449 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 2848 transitions. [2019-10-22 11:21:54,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-22 11:21:54,452 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:54,452 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-10-22 11:21:54,452 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:54,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:54,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1321298535, now seen corresponding path program 1 times [2019-10-22 11:21:54,453 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:54,453 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165977194] [2019-10-22 11:21:54,453 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:54,453 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:54,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:54,563 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-22 11:21:54,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165977194] [2019-10-22 11:21:54,563 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:54,564 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:54,564 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029332599] [2019-10-22 11:21:54,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:54,565 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:54,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:54,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:54,565 INFO L87 Difference]: Start difference. First operand 2411 states and 2848 transitions. Second operand 4 states. [2019-10-22 11:21:55,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:55,320 INFO L93 Difference]: Finished difference Result 5800 states and 6855 transitions. [2019-10-22 11:21:55,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:55,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-10-22 11:21:55,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:55,327 INFO L225 Difference]: With dead ends: 5800 [2019-10-22 11:21:55,327 INFO L226 Difference]: Without dead ends: 2264 [2019-10-22 11:21:55,331 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:55,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2019-10-22 11:21:55,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 2264. [2019-10-22 11:21:55,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2264 states. [2019-10-22 11:21:55,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 2584 transitions. [2019-10-22 11:21:55,368 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 2584 transitions. Word has length 115 [2019-10-22 11:21:55,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:55,368 INFO L462 AbstractCegarLoop]: Abstraction has 2264 states and 2584 transitions. [2019-10-22 11:21:55,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:55,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 2584 transitions. [2019-10-22 11:21:55,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-22 11:21:55,371 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:55,371 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:55,371 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:55,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:55,371 INFO L82 PathProgramCache]: Analyzing trace with hash 20473516, now seen corresponding path program 1 times [2019-10-22 11:21:55,371 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:55,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733626447] [2019-10-22 11:21:55,372 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:55,372 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:55,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:55,415 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 11:21:55,415 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733626447] [2019-10-22 11:21:55,415 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:55,415 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:55,416 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363194076] [2019-10-22 11:21:55,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:55,416 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:55,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:55,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:55,416 INFO L87 Difference]: Start difference. First operand 2264 states and 2584 transitions. Second operand 4 states. [2019-10-22 11:21:55,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:55,620 INFO L93 Difference]: Finished difference Result 3957 states and 4514 transitions. [2019-10-22 11:21:55,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:55,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-10-22 11:21:55,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:55,625 INFO L225 Difference]: With dead ends: 3957 [2019-10-22 11:21:55,626 INFO L226 Difference]: Without dead ends: 1695 [2019-10-22 11:21:55,628 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:55,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2019-10-22 11:21:55,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1415. [2019-10-22 11:21:55,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1415 states. [2019-10-22 11:21:55,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 1606 transitions. [2019-10-22 11:21:55,655 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 1606 transitions. Word has length 117 [2019-10-22 11:21:55,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:55,656 INFO L462 AbstractCegarLoop]: Abstraction has 1415 states and 1606 transitions. [2019-10-22 11:21:55,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:55,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 1606 transitions. [2019-10-22 11:21:55,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-22 11:21:55,658 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:55,659 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:55,659 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:55,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:55,659 INFO L82 PathProgramCache]: Analyzing trace with hash 161474528, now seen corresponding path program 1 times [2019-10-22 11:21:55,659 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:55,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521341542] [2019-10-22 11:21:55,660 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:55,660 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:55,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:55,828 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-22 11:21:55,828 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521341542] [2019-10-22 11:21:55,829 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254780105] [2019-10-22 11:21:55,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f0b28f0-c7ed-4be4-8ccf-285eec0e79cc/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:21:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:55,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:21:55,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:55,959 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-22 11:21:55,959 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:55,989 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-22 11:21:55,989 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-22 11:21:55,989 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 8 [2019-10-22 11:21:55,990 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11467560] [2019-10-22 11:21:55,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:55,990 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:55,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:55,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:21:55,991 INFO L87 Difference]: Start difference. First operand 1415 states and 1606 transitions. Second operand 3 states. [2019-10-22 11:21:56,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:56,412 INFO L93 Difference]: Finished difference Result 2828 states and 3210 transitions. [2019-10-22 11:21:56,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:56,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-10-22 11:21:56,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:56,417 INFO L225 Difference]: With dead ends: 2828 [2019-10-22 11:21:56,417 INFO L226 Difference]: Without dead ends: 1415 [2019-10-22 11:21:56,419 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 275 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:21:56,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2019-10-22 11:21:56,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1275. [2019-10-22 11:21:56,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2019-10-22 11:21:56,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1388 transitions. [2019-10-22 11:21:56,440 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1388 transitions. Word has length 139 [2019-10-22 11:21:56,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:56,440 INFO L462 AbstractCegarLoop]: Abstraction has 1275 states and 1388 transitions. [2019-10-22 11:21:56,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:56,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1388 transitions. [2019-10-22 11:21:56,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-22 11:21:56,442 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:56,443 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:56,643 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:21:56,644 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:56,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:56,644 INFO L82 PathProgramCache]: Analyzing trace with hash 2138715965, now seen corresponding path program 1 times [2019-10-22 11:21:56,644 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:56,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736743516] [2019-10-22 11:21:56,645 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:56,645 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:56,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:56,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:21:56,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:21:56,759 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:21:56,760 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:21:56,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:21:56 BoogieIcfgContainer [2019-10-22 11:21:56,866 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:21:56,866 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:21:56,866 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:21:56,867 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:21:56,867 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:50" (3/4) ... [2019-10-22 11:21:56,869 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:21:57,000 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5f0b28f0-c7ed-4be4-8ccf-285eec0e79cc/bin/utaipan/witness.graphml [2019-10-22 11:21:57,003 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:21:57,008 INFO L168 Benchmark]: Toolchain (without parser) took 8838.53 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 331.9 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -124.4 MB). Peak memory consumption was 207.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:57,009 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:57,010 INFO L168 Benchmark]: CACSL2BoogieTranslator took 609.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -183.2 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:57,010 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:57,010 INFO L168 Benchmark]: Boogie Preprocessor took 76.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:57,010 INFO L168 Benchmark]: RCFGBuilder took 1086.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 103.1 MB). Peak memory consumption was 103.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:57,010 INFO L168 Benchmark]: TraceAbstraction took 6817.93 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.1 MB). Free memory was 998.9 MB in the beginning and 1.1 GB in the end (delta: -87.3 MB). Peak memory consumption was 97.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:57,011 INFO L168 Benchmark]: Witness Printer took 140.65 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:57,012 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 609.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -183.2 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 102.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 76.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1086.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 103.1 MB). Peak memory consumption was 103.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6817.93 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.1 MB). Free memory was 998.9 MB in the beginning and 1.1 GB in the end (delta: -87.3 MB). Peak memory consumption was 97.8 MB. Max. memory is 11.5 GB. * Witness Printer took 140.65 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 436]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L603] int output = -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND TRUE ((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7))))) [L51] a28 = 11 [L52] a25 = 1 [L53] return 26; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND TRUE (!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1))) [L350] a28 = 9 [L351] a11 = 1 [L352] a25 = 0 [L353] return -1; VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L398] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L402] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L407] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L414] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L417] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L420] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L423] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L426] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L429] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L432] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L435] COND TRUE (((((!(a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8)) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L436] __VERIFIER_error() VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Result: UNSAFE, OverallTime: 6.7s, OverallIterations: 9, TraceHistogramMax: 4, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1007 SDtfs, 1504 SDslu, 205 SDs, 0 SdLazy, 4221 SolverSat, 703 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 307 GetRequests, 285 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2411occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 585 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1166 NumberOfCodeBlocks, 1166 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1133 ConstructedInterpolants, 0 QuantifiedInterpolants, 341815 SizeOfPredicates, 1 NumberOfNonLiveVariables, 273 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 343/346 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...