./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label43.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_61739796-355f-4dbf-b747-a72cf58db2b7/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_61739796-355f-4dbf-b747-a72cf58db2b7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_61739796-355f-4dbf-b747-a72cf58db2b7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_61739796-355f-4dbf-b747-a72cf58db2b7/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label43.c -s /tmp/vcloud-vcloud-master/worker/run_dir_61739796-355f-4dbf-b747-a72cf58db2b7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_61739796-355f-4dbf-b747-a72cf58db2b7/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f9a2bb925f9caeb1a81a9f8632446ab7e4aa4c35 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 00:12:55,731 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 00:12:55,734 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 00:12:55,789 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 00:12:55,789 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 00:12:55,791 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 00:12:55,794 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 00:12:55,797 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 00:12:55,800 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 00:12:55,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 00:12:55,804 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 00:12:55,806 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 00:12:55,807 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 00:12:55,808 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 00:12:55,810 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 00:12:55,812 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 00:12:55,814 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 00:12:55,816 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 00:12:55,819 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 00:12:55,823 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 00:12:55,826 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 00:12:55,828 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 00:12:55,830 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 00:12:55,832 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 00:12:55,837 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 00:12:55,838 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 00:12:55,838 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 00:12:55,840 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 00:12:55,841 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 00:12:55,843 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 00:12:55,844 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 00:12:55,845 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 00:12:55,847 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 00:12:55,848 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 00:12:55,850 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 00:12:55,851 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 00:12:55,852 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 00:12:55,852 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 00:12:55,853 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 00:12:55,854 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 00:12:55,855 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 00:12:55,856 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_61739796-355f-4dbf-b747-a72cf58db2b7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-30 00:12:55,889 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 00:12:55,889 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 00:12:55,891 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 00:12:55,891 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 00:12:55,892 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 00:12:55,892 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 00:12:55,892 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 00:12:55,893 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 00:12:55,893 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 00:12:55,893 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 00:12:55,894 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 00:12:55,894 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 00:12:55,894 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 00:12:55,894 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 00:12:55,895 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 00:12:55,895 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 00:12:55,895 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 00:12:55,896 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 00:12:55,896 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 00:12:55,896 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 00:12:55,897 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 00:12:55,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 00:12:55,897 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 00:12:55,898 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 00:12:55,898 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 00:12:55,898 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 00:12:55,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 00:12:55,899 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 00:12:55,899 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 00:12:55,899 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_61739796-355f-4dbf-b747-a72cf58db2b7/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_61739796-355f-4dbf-b747-a72cf58db2b7/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f9a2bb925f9caeb1a81a9f8632446ab7e4aa4c35 [2020-11-30 00:12:56,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 00:12:56,261 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 00:12:56,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 00:12:56,269 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 00:12:56,270 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 00:12:56,272 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_61739796-355f-4dbf-b747-a72cf58db2b7/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label43.c [2020-11-30 00:12:56,364 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_61739796-355f-4dbf-b747-a72cf58db2b7/bin/uautomizer/data/746b9b686/05c9a5fee4224fb2806cfb9c43e666b8/FLAG93ce5bd1c [2020-11-30 00:12:57,117 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 00:12:57,118 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_61739796-355f-4dbf-b747-a72cf58db2b7/sv-benchmarks/c/eca-rers2012/Problem02_label43.c [2020-11-30 00:12:57,149 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_61739796-355f-4dbf-b747-a72cf58db2b7/bin/uautomizer/data/746b9b686/05c9a5fee4224fb2806cfb9c43e666b8/FLAG93ce5bd1c [2020-11-30 00:12:57,319 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_61739796-355f-4dbf-b747-a72cf58db2b7/bin/uautomizer/data/746b9b686/05c9a5fee4224fb2806cfb9c43e666b8 [2020-11-30 00:12:57,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 00:12:57,325 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 00:12:57,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 00:12:57,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 00:12:57,338 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 00:12:57,342 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:12:57" (1/1) ... [2020-11-30 00:12:57,346 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cd3c1ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:12:57, skipping insertion in model container [2020-11-30 00:12:57,347 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:12:57" (1/1) ... [2020-11-30 00:12:57,356 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 00:12:57,430 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 00:12:58,002 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:12:58,015 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 00:12:58,205 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:12:58,229 INFO L208 MainTranslator]: Completed translation [2020-11-30 00:12:58,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:12:58 WrapperNode [2020-11-30 00:12:58,232 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 00:12:58,237 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 00:12:58,237 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 00:12:58,238 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 00:12:58,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:12:58" (1/1) ... [2020-11-30 00:12:58,278 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:12:58" (1/1) ... [2020-11-30 00:12:58,357 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 00:12:58,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 00:12:58,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 00:12:58,365 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 00:12:58,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:12:58" (1/1) ... [2020-11-30 00:12:58,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:12:58" (1/1) ... [2020-11-30 00:12:58,380 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:12:58" (1/1) ... [2020-11-30 00:12:58,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:12:58" (1/1) ... [2020-11-30 00:12:58,408 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:12:58" (1/1) ... [2020-11-30 00:12:58,421 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:12:58" (1/1) ... [2020-11-30 00:12:58,432 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:12:58" (1/1) ... [2020-11-30 00:12:58,445 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 00:12:58,446 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 00:12:58,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 00:12:58,447 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 00:12:58,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:12:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_61739796-355f-4dbf-b747-a72cf58db2b7/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 00:12:58,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 00:12:58,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 00:12:58,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 00:12:58,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 00:13:00,479 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 00:13:00,481 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-11-30 00:13:00,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:13:00 BoogieIcfgContainer [2020-11-30 00:13:00,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 00:13:00,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 00:13:00,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 00:13:00,498 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 00:13:00,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 12:12:57" (1/3) ... [2020-11-30 00:13:00,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a2b3089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:13:00, skipping insertion in model container [2020-11-30 00:13:00,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:12:58" (2/3) ... [2020-11-30 00:13:00,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a2b3089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:13:00, skipping insertion in model container [2020-11-30 00:13:00,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:13:00" (3/3) ... [2020-11-30 00:13:00,503 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem02_label43.c [2020-11-30 00:13:00,517 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 00:13:00,523 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-30 00:13:00,539 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-30 00:13:00,592 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 00:13:00,593 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 00:13:00,593 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 00:13:00,593 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 00:13:00,593 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 00:13:00,593 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 00:13:00,594 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 00:13:00,594 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 00:13:00,624 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states. [2020-11-30 00:13:00,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-11-30 00:13:00,644 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:13:00,645 INFO L422 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] [2020-11-30 00:13:00,645 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:13:00,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:13:00,653 INFO L82 PathProgramCache]: Analyzing trace with hash -505929285, now seen corresponding path program 1 times [2020-11-30 00:13:00,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:13:00,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001638272] [2020-11-30 00:13:00,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:13:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:13:01,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:13:01,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001638272] [2020-11-30 00:13:01,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:13:01,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 00:13:01,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461919821] [2020-11-30 00:13:01,193 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:13:01,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:13:01,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:13:01,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:13:01,212 INFO L87 Difference]: Start difference. First operand 228 states. Second operand 3 states. [2020-11-30 00:13:02,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:13:02,915 INFO L93 Difference]: Finished difference Result 631 states and 1071 transitions. [2020-11-30 00:13:02,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:13:02,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2020-11-30 00:13:02,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:13:02,935 INFO L225 Difference]: With dead ends: 631 [2020-11-30 00:13:02,935 INFO L226 Difference]: Without dead ends: 318 [2020-11-30 00:13:02,941 INFO L677 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 [2020-11-30 00:13:02,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2020-11-30 00:13:03,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2020-11-30 00:13:03,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2020-11-30 00:13:03,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 467 transitions. [2020-11-30 00:13:03,020 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 467 transitions. Word has length 85 [2020-11-30 00:13:03,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:13:03,022 INFO L481 AbstractCegarLoop]: Abstraction has 318 states and 467 transitions. [2020-11-30 00:13:03,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:13:03,022 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 467 transitions. [2020-11-30 00:13:03,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-11-30 00:13:03,028 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:13:03,028 INFO L422 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] [2020-11-30 00:13:03,029 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 00:13:03,029 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:13:03,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:13:03,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1592934382, now seen corresponding path program 1 times [2020-11-30 00:13:03,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:13:03,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836243778] [2020-11-30 00:13:03,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:13:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:13:03,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:13:03,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836243778] [2020-11-30 00:13:03,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:13:03,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 00:13:03,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825099209] [2020-11-30 00:13:03,148 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:13:03,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:13:03,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:13:03,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:13:03,151 INFO L87 Difference]: Start difference. First operand 318 states and 467 transitions. Second operand 3 states. [2020-11-30 00:13:04,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:13:04,113 INFO L93 Difference]: Finished difference Result 919 states and 1357 transitions. [2020-11-30 00:13:04,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:13:04,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2020-11-30 00:13:04,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:13:04,123 INFO L225 Difference]: With dead ends: 919 [2020-11-30 00:13:04,123 INFO L226 Difference]: Without dead ends: 603 [2020-11-30 00:13:04,126 INFO L677 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 [2020-11-30 00:13:04,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-11-30 00:13:04,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 601. [2020-11-30 00:13:04,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2020-11-30 00:13:04,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 775 transitions. [2020-11-30 00:13:04,184 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 775 transitions. Word has length 89 [2020-11-30 00:13:04,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:13:04,185 INFO L481 AbstractCegarLoop]: Abstraction has 601 states and 775 transitions. [2020-11-30 00:13:04,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:13:04,185 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 775 transitions. [2020-11-30 00:13:04,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-11-30 00:13:04,191 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:13:04,191 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:13:04,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 00:13:04,192 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:13:04,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:13:04,193 INFO L82 PathProgramCache]: Analyzing trace with hash 142846209, now seen corresponding path program 1 times [2020-11-30 00:13:04,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:13:04,194 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357772065] [2020-11-30 00:13:04,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:13:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:13:04,348 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:13:04,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357772065] [2020-11-30 00:13:04,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620815656] [2020-11-30 00:13:04,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_61739796-355f-4dbf-b747-a72cf58db2b7/bin/uautomizer/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 [2020-11-30 00:13:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:13:04,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 00:13:04,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:13:04,708 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:13:04,708 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 00:13:04,708 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2020-11-30 00:13:04,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156125829] [2020-11-30 00:13:04,709 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:13:04,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:13:04,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:13:04,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:13:04,711 INFO L87 Difference]: Start difference. First operand 601 states and 775 transitions. Second operand 3 states. [2020-11-30 00:13:05,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:13:05,981 INFO L93 Difference]: Finished difference Result 1486 states and 1974 transitions. [2020-11-30 00:13:05,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:13:05,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2020-11-30 00:13:05,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:13:05,990 INFO L225 Difference]: With dead ends: 1486 [2020-11-30 00:13:05,990 INFO L226 Difference]: Without dead ends: 887 [2020-11-30 00:13:05,995 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:13:05,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2020-11-30 00:13:06,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 885. [2020-11-30 00:13:06,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2020-11-30 00:13:06,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1089 transitions. [2020-11-30 00:13:06,072 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1089 transitions. Word has length 94 [2020-11-30 00:13:06,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:13:06,073 INFO L481 AbstractCegarLoop]: Abstraction has 885 states and 1089 transitions. [2020-11-30 00:13:06,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:13:06,073 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1089 transitions. [2020-11-30 00:13:06,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-11-30 00:13:06,088 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:13:06,089 INFO L422 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] [2020-11-30 00:13:06,314 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-11-30 00:13:06,315 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:13:06,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:13:06,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1513458301, now seen corresponding path program 1 times [2020-11-30 00:13:06,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:13:06,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871766402] [2020-11-30 00:13:06,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:13:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:13:06,413 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:13:06,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871766402] [2020-11-30 00:13:06,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:13:06,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 00:13:06,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571173018] [2020-11-30 00:13:06,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:13:06,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:13:06,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:13:06,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:13:06,417 INFO L87 Difference]: Start difference. First operand 885 states and 1089 transitions. Second operand 3 states. [2020-11-30 00:13:07,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:13:07,485 INFO L93 Difference]: Finished difference Result 2469 states and 3053 transitions. [2020-11-30 00:13:07,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:13:07,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2020-11-30 00:13:07,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:13:07,498 INFO L225 Difference]: With dead ends: 2469 [2020-11-30 00:13:07,498 INFO L226 Difference]: Without dead ends: 1586 [2020-11-30 00:13:07,500 INFO L677 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 [2020-11-30 00:13:07,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2020-11-30 00:13:07,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1586. [2020-11-30 00:13:07,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2020-11-30 00:13:07,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 1895 transitions. [2020-11-30 00:13:07,566 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 1895 transitions. Word has length 95 [2020-11-30 00:13:07,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:13:07,569 INFO L481 AbstractCegarLoop]: Abstraction has 1586 states and 1895 transitions. [2020-11-30 00:13:07,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:13:07,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 1895 transitions. [2020-11-30 00:13:07,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-11-30 00:13:07,574 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:13:07,574 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:13:07,575 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 00:13:07,575 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:13:07,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:13:07,577 INFO L82 PathProgramCache]: Analyzing trace with hash 418705483, now seen corresponding path program 1 times [2020-11-30 00:13:07,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:13:07,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126381395] [2020-11-30 00:13:07,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:13:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:13:07,695 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:13:07,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126381395] [2020-11-30 00:13:07,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:13:07,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:13:07,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531776250] [2020-11-30 00:13:07,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:13:07,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:13:07,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:13:07,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:13:07,702 INFO L87 Difference]: Start difference. First operand 1586 states and 1895 transitions. Second operand 3 states. [2020-11-30 00:13:08,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:13:08,719 INFO L93 Difference]: Finished difference Result 3731 states and 4456 transitions. [2020-11-30 00:13:08,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:13:08,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2020-11-30 00:13:08,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:13:08,734 INFO L225 Difference]: With dead ends: 3731 [2020-11-30 00:13:08,734 INFO L226 Difference]: Without dead ends: 2147 [2020-11-30 00:13:08,737 INFO L677 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 [2020-11-30 00:13:08,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2020-11-30 00:13:08,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 2146. [2020-11-30 00:13:08,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2146 states. [2020-11-30 00:13:08,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 2480 transitions. [2020-11-30 00:13:08,816 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 2480 transitions. Word has length 98 [2020-11-30 00:13:08,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:13:08,817 INFO L481 AbstractCegarLoop]: Abstraction has 2146 states and 2480 transitions. [2020-11-30 00:13:08,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:13:08,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 2480 transitions. [2020-11-30 00:13:08,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-11-30 00:13:08,821 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:13:08,822 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2020-11-30 00:13:08,822 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 00:13:08,822 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:13:08,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:13:08,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1272597306, now seen corresponding path program 1 times [2020-11-30 00:13:08,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:13:08,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661153752] [2020-11-30 00:13:08,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:13:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:13:08,924 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:13:08,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661153752] [2020-11-30 00:13:08,925 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:13:08,925 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:13:08,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354242101] [2020-11-30 00:13:08,927 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:13:08,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:13:08,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:13:08,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:13:08,929 INFO L87 Difference]: Start difference. First operand 2146 states and 2480 transitions. Second operand 3 states. [2020-11-30 00:13:09,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:13:09,845 INFO L93 Difference]: Finished difference Result 4291 states and 4960 transitions. [2020-11-30 00:13:09,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:13:09,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2020-11-30 00:13:09,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:13:09,863 INFO L225 Difference]: With dead ends: 4291 [2020-11-30 00:13:09,863 INFO L226 Difference]: Without dead ends: 2147 [2020-11-30 00:13:09,867 INFO L677 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 [2020-11-30 00:13:09,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2020-11-30 00:13:09,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 2146. [2020-11-30 00:13:09,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2146 states. [2020-11-30 00:13:09,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 2425 transitions. [2020-11-30 00:13:09,930 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 2425 transitions. Word has length 114 [2020-11-30 00:13:09,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:13:09,931 INFO L481 AbstractCegarLoop]: Abstraction has 2146 states and 2425 transitions. [2020-11-30 00:13:09,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:13:09,931 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 2425 transitions. [2020-11-30 00:13:09,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-11-30 00:13:09,935 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:13:09,936 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:13:09,944 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 00:13:09,945 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:13:09,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:13:09,951 INFO L82 PathProgramCache]: Analyzing trace with hash -904328828, now seen corresponding path program 1 times [2020-11-30 00:13:09,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:13:09,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53250328] [2020-11-30 00:13:09,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:13:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:13:10,016 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:13:10,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53250328] [2020-11-30 00:13:10,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:13:10,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:13:10,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950144068] [2020-11-30 00:13:10,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:13:10,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:13:10,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:13:10,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:13:10,019 INFO L87 Difference]: Start difference. First operand 2146 states and 2425 transitions. Second operand 3 states. [2020-11-30 00:13:10,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:13:10,890 INFO L93 Difference]: Finished difference Result 4863 states and 5612 transitions. [2020-11-30 00:13:10,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:13:10,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2020-11-30 00:13:10,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:13:10,907 INFO L225 Difference]: With dead ends: 4863 [2020-11-30 00:13:10,907 INFO L226 Difference]: Without dead ends: 2719 [2020-11-30 00:13:10,911 INFO L677 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 [2020-11-30 00:13:10,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2719 states. [2020-11-30 00:13:10,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2719 to 2710. [2020-11-30 00:13:10,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2020-11-30 00:13:10,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3096 transitions. [2020-11-30 00:13:10,983 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3096 transitions. Word has length 118 [2020-11-30 00:13:10,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:13:10,983 INFO L481 AbstractCegarLoop]: Abstraction has 2710 states and 3096 transitions. [2020-11-30 00:13:10,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:13:10,984 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3096 transitions. [2020-11-30 00:13:10,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-11-30 00:13:10,988 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:13:10,988 INFO L422 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, 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] [2020-11-30 00:13:10,989 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-30 00:13:10,989 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:13:10,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:13:10,989 INFO L82 PathProgramCache]: Analyzing trace with hash 285509865, now seen corresponding path program 1 times [2020-11-30 00:13:10,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:13:10,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288730729] [2020-11-30 00:13:10,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:13:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:13:11,063 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:13:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:13:11,130 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:13:11,209 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:13:11,209 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 00:13:11,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 00:13:11,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 12:13:11 BoogieIcfgContainer [2020-11-30 00:13:11,389 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 00:13:11,389 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 00:13:11,390 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 00:13:11,390 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 00:13:11,391 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:13:00" (3/4) ... [2020-11-30 00:13:11,393 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 00:13:11,626 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_61739796-355f-4dbf-b747-a72cf58db2b7/bin/uautomizer/witness.graphml [2020-11-30 00:13:11,626 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 00:13:11,629 INFO L168 Benchmark]: Toolchain (without parser) took 14303.20 ms. Allocated memory was 100.7 MB in the beginning and 249.6 MB in the end (delta: 148.9 MB). Free memory was 72.4 MB in the beginning and 203.1 MB in the end (delta: -130.7 MB). Peak memory consumption was 139.3 MB. Max. memory is 16.1 GB. [2020-11-30 00:13:11,630 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 100.7 MB. Free memory is still 58.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:13:11,631 INFO L168 Benchmark]: CACSL2BoogieTranslator took 899.08 ms. Allocated memory is still 100.7 MB. Free memory was 72.1 MB in the beginning and 62.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 00:13:11,631 INFO L168 Benchmark]: Boogie Procedure Inliner took 126.80 ms. Allocated memory is still 100.7 MB. Free memory was 61.7 MB in the beginning and 56.5 MB in the end (delta: 5.1 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-11-30 00:13:11,632 INFO L168 Benchmark]: Boogie Preprocessor took 80.36 ms. Allocated memory is still 100.7 MB. Free memory was 56.5 MB in the beginning and 51.9 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-30 00:13:11,632 INFO L168 Benchmark]: RCFGBuilder took 2041.39 ms. Allocated memory was 100.7 MB in the beginning and 132.1 MB in the end (delta: 31.5 MB). Free memory was 51.9 MB in the beginning and 97.6 MB in the end (delta: -45.7 MB). Peak memory consumption was 32.2 MB. Max. memory is 16.1 GB. [2020-11-30 00:13:11,633 INFO L168 Benchmark]: TraceAbstraction took 10896.05 ms. Allocated memory was 132.1 MB in the beginning and 249.6 MB in the end (delta: 117.4 MB). Free memory was 96.7 MB in the beginning and 86.3 MB in the end (delta: 10.4 MB). Peak memory consumption was 128.5 MB. Max. memory is 16.1 GB. [2020-11-30 00:13:11,633 INFO L168 Benchmark]: Witness Printer took 237.10 ms. Allocated memory is still 249.6 MB. Free memory was 86.3 MB in the beginning and 203.1 MB in the end (delta: -116.7 MB). Peak memory consumption was 4.8 MB. Max. memory is 16.1 GB. [2020-11-30 00:13:11,636 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 100.7 MB. Free memory is still 58.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 899.08 ms. Allocated memory is still 100.7 MB. Free memory was 72.1 MB in the beginning and 62.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 126.80 ms. Allocated memory is still 100.7 MB. Free memory was 61.7 MB in the beginning and 56.5 MB in the end (delta: 5.1 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 80.36 ms. Allocated memory is still 100.7 MB. Free memory was 56.5 MB in the beginning and 51.9 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2041.39 ms. Allocated memory was 100.7 MB in the beginning and 132.1 MB in the end (delta: 31.5 MB). Free memory was 51.9 MB in the beginning and 97.6 MB in the end (delta: -45.7 MB). Peak memory consumption was 32.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 10896.05 ms. Allocated memory was 132.1 MB in the beginning and 249.6 MB in the end (delta: 117.4 MB). Free memory was 96.7 MB in the beginning and 86.3 MB in the end (delta: 10.4 MB). Peak memory consumption was 128.5 MB. Max. memory is 16.1 GB. * Witness Printer took 237.10 ms. Allocated memory is still 249.6 MB. Free memory was 86.3 MB in the beginning and 203.1 MB in the end (delta: -116.7 MB). Peak memory consumption was 4.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int a= 1; [L18] int e= 5; [L19] int d= 4; [L20] int f= 6; [L21] int c= 3; [L24] int u = 21; [L25] int v = 22; [L26] int w = 23; [L27] int x = 24; [L28] int y = 25; [L29] int z = 26; [L32] int a25 = 0; [L33] int a11 = 0; [L34] int a28 = 7; [L35] int a19 = 1; [L36] int a21 = 1; [L37] 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] [L613] 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] [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L40] 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] [L45] 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] [L48] 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] [L52] 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] [L57] 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] [L60] 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=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] 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=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] 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=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] 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=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L79] 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=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] 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=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] 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=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L101] 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=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L105] 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=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L109] 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=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L116] 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=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] 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=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] 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=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L133] 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=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] 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=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] 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=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L149] 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=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L153] 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=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] 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=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L164] 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=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] 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=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND TRUE (((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1)) [L176] a25 = 1 [L177] a28 = 9 [L178] return 26; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L40] COND TRUE (((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8)) [L41] a28 = 9 [L42] a11 = 1 [L43] a25 = 1 [L44] return -1; VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L40] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L48] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L52] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L57] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L60] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] 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=1, 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 !(((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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L79] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L101] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L105] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L109] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L116] 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=1, 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 !(((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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L133] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L149] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L153] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L164] 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=1, 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 !((((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=1, 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 !((((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=1, 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 !(((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=1, 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)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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 !((((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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L195] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L201] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] 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=1, 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)&&((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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L222] 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=1, 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 !((!(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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L235] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L242] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L244] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L247] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L258] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L263] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L269] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] 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=1, 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 !(((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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L290] 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=1, 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 !((((((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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L296] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L301] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L303] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L307] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L319] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L338] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L341] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L347] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L359] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L364] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L371] 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=1, 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 !(((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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L385] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L388] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L390] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L399] 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=1, 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 !((((((!(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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L408] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L412] 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=1, 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 !((((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=1, 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 !((!(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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L419] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L424] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L427] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L430] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L433] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L436] 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=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L12] __assert_fail("0", "Problem02_label43.c", 4, "reach_error") VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, 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, 228 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.6s, OverallIterations: 8, TraceHistogramMax: 3, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1030 SDtfs, 1072 SDslu, 123 SDs, 0 SdLazy, 2669 SolverSat, 501 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2710occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 906 NumberOfCodeBlocks, 906 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 779 ConstructedInterpolants, 0 QuantifiedInterpolants, 112691 SizeOfPredicates, 0 NumberOfNonLiveVariables, 229 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 118/121 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...