./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5c470de7-7221-43c1-aef9-c1b8c3135f3c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5c470de7-7221-43c1-aef9-c1b8c3135f3c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5c470de7-7221-43c1-aef9-c1b8c3135f3c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5c470de7-7221-43c1-aef9-c1b8c3135f3c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label02.c -s /tmp/vcloud-vcloud-master/worker/run_dir_5c470de7-7221-43c1-aef9-c1b8c3135f3c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5c470de7-7221-43c1-aef9-c1b8c3135f3c/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash addc9e4e4fc897318cfe4d26c9760729a73864e1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:49:05,880 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:49:05,881 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:49:05,894 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:49:05,895 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:49:05,896 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:49:05,898 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:49:05,907 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:49:05,911 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:49:05,914 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:49:05,916 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:49:05,917 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:49:05,917 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:49:05,919 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:49:05,920 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:49:05,921 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:49:05,922 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:49:05,923 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:49:05,925 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:49:05,929 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:49:05,932 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:49:05,935 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:49:05,936 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:49:05,937 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:49:05,940 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:49:05,940 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:49:05,940 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:49:05,942 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:49:05,942 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:49:05,943 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:49:05,943 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:49:05,944 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:49:05,945 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:49:05,945 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:49:05,946 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:49:05,946 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:49:05,947 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:49:05,947 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:49:05,947 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:49:05,948 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:49:05,949 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:49:05,949 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5c470de7-7221-43c1-aef9-c1b8c3135f3c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:49:05,973 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:49:05,973 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:49:05,974 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:49:05,974 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:49:05,977 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:49:05,977 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:49:05,978 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:49:05,978 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:49:05,978 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:49:05,978 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:49:05,978 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:49:05,978 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:49:05,978 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:49:05,978 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:49:05,979 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:49:05,979 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:49:05,979 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:49:05,979 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:49:05,979 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:49:05,979 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:49:05,979 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:49:05,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:49:05,980 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:49:05,980 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:49:05,980 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:49:05,980 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:49:05,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:49:05,980 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:49:05,980 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_5c470de7-7221-43c1-aef9-c1b8c3135f3c/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(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> addc9e4e4fc897318cfe4d26c9760729a73864e1 [2019-11-25 08:49:06,114 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:49:06,124 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:49:06,127 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:49:06,128 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:49:06,128 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:49:06,129 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5c470de7-7221-43c1-aef9-c1b8c3135f3c/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label02.c [2019-11-25 08:49:06,177 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5c470de7-7221-43c1-aef9-c1b8c3135f3c/bin/uautomizer/data/9ad434df0/aeb19e1fc96747989f5db536caa77dea/FLAG7c62a8bcd [2019-11-25 08:49:06,744 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:49:06,750 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5c470de7-7221-43c1-aef9-c1b8c3135f3c/sv-benchmarks/c/eca-rers2012/Problem01_label02.c [2019-11-25 08:49:06,761 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5c470de7-7221-43c1-aef9-c1b8c3135f3c/bin/uautomizer/data/9ad434df0/aeb19e1fc96747989f5db536caa77dea/FLAG7c62a8bcd [2019-11-25 08:49:07,159 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5c470de7-7221-43c1-aef9-c1b8c3135f3c/bin/uautomizer/data/9ad434df0/aeb19e1fc96747989f5db536caa77dea [2019-11-25 08:49:07,162 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:49:07,163 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:49:07,168 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:49:07,169 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:49:07,172 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:49:07,172 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:49:07" (1/1) ... [2019-11-25 08:49:07,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@312eab7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:07, skipping insertion in model container [2019-11-25 08:49:07,175 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:49:07" (1/1) ... [2019-11-25 08:49:07,180 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:49:07,226 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:49:07,596 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:49:07,600 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:49:07,733 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:49:07,754 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:49:07,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:07 WrapperNode [2019-11-25 08:49:07,755 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:49:07,755 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:49:07,755 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:49:07,756 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:49:07,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:07" (1/1) ... [2019-11-25 08:49:07,785 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:07" (1/1) ... [2019-11-25 08:49:07,833 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:49:07,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:49:07,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:49:07,835 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:49:07,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:07" (1/1) ... [2019-11-25 08:49:07,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:07" (1/1) ... [2019-11-25 08:49:07,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:07" (1/1) ... [2019-11-25 08:49:07,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:07" (1/1) ... [2019-11-25 08:49:07,885 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:07" (1/1) ... [2019-11-25 08:49:07,894 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:07" (1/1) ... [2019-11-25 08:49:07,907 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:07" (1/1) ... [2019-11-25 08:49:07,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:49:07,915 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:49:07,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:49:07,916 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:49:07,918 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c470de7-7221-43c1-aef9-c1b8c3135f3c/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 [2019-11-25 08:49:07,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:49:07,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:49:09,006 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:49:09,006 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:49:09,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:49:09 BoogieIcfgContainer [2019-11-25 08:49:09,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:49:09,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:49:09,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:49:09,011 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:49:09,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:49:07" (1/3) ... [2019-11-25 08:49:09,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b0a469f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:49:09, skipping insertion in model container [2019-11-25 08:49:09,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:07" (2/3) ... [2019-11-25 08:49:09,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b0a469f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:49:09, skipping insertion in model container [2019-11-25 08:49:09,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:49:09" (3/3) ... [2019-11-25 08:49:09,015 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label02.c [2019-11-25 08:49:09,024 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:49:09,030 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:49:09,040 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:49:09,074 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:49:09,074 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:49:09,074 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:49:09,074 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:49:09,074 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:49:09,075 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:49:09,075 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:49:09,075 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:49:09,097 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-25 08:49:09,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-25 08:49:09,108 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:09,109 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:09,110 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:09,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:09,116 INFO L82 PathProgramCache]: Analyzing trace with hash -776841673, now seen corresponding path program 1 times [2019-11-25 08:49:09,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:09,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053284031] [2019-11-25 08:49:09,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:09,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:09,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053284031] [2019-11-25 08:49:09,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:09,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:49:09,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279474074] [2019-11-25 08:49:09,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:49:09,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:09,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:49:09,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:09,565 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-25 08:49:10,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:10,885 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-11-25 08:49:10,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:49:10,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-25 08:49:10,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:10,902 INFO L225 Difference]: With dead ends: 662 [2019-11-25 08:49:10,902 INFO L226 Difference]: Without dead ends: 397 [2019-11-25 08:49:10,906 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:10,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-25 08:49:10,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 266. [2019-11-25 08:49:10,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-25 08:49:10,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-11-25 08:49:10,989 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 90 [2019-11-25 08:49:10,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:10,990 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-11-25 08:49:10,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:49:10,990 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-11-25 08:49:10,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-25 08:49:10,998 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:10,999 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:10,999 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:11,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:11,000 INFO L82 PathProgramCache]: Analyzing trace with hash 904352266, now seen corresponding path program 1 times [2019-11-25 08:49:11,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:11,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176362765] [2019-11-25 08:49:11,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:11,082 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:11,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176362765] [2019-11-25 08:49:11,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:11,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:49:11,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192189805] [2019-11-25 08:49:11,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:49:11,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:11,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:49:11,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:11,086 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-11-25 08:49:11,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:11,868 INFO L93 Difference]: Finished difference Result 1054 states and 1512 transitions. [2019-11-25 08:49:11,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:49:11,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-25 08:49:11,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:11,873 INFO L225 Difference]: With dead ends: 1054 [2019-11-25 08:49:11,873 INFO L226 Difference]: Without dead ends: 790 [2019-11-25 08:49:11,875 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:11,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-25 08:49:11,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-25 08:49:11,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-25 08:49:11,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1067 transitions. [2019-11-25 08:49:11,911 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1067 transitions. Word has length 96 [2019-11-25 08:49:11,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:11,912 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1067 transitions. [2019-11-25 08:49:11,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:49:11,912 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1067 transitions. [2019-11-25 08:49:11,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-25 08:49:11,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:11,915 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:11,915 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:11,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:11,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1983827210, now seen corresponding path program 1 times [2019-11-25 08:49:11,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:11,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081469547] [2019-11-25 08:49:11,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:12,039 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-25 08:49:12,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081469547] [2019-11-25 08:49:12,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:12,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:12,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179783796] [2019-11-25 08:49:12,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:12,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:12,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:12,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:12,044 INFO L87 Difference]: Start difference. First operand 790 states and 1067 transitions. Second operand 3 states. [2019-11-25 08:49:12,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:12,541 INFO L93 Difference]: Finished difference Result 2233 states and 3029 transitions. [2019-11-25 08:49:12,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:12,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-25 08:49:12,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:12,550 INFO L225 Difference]: With dead ends: 2233 [2019-11-25 08:49:12,550 INFO L226 Difference]: Without dead ends: 1445 [2019-11-25 08:49:12,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:12,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-25 08:49:12,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2019-11-25 08:49:12,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-25 08:49:12,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1878 transitions. [2019-11-25 08:49:12,585 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1878 transitions. Word has length 97 [2019-11-25 08:49:12,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:12,586 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1878 transitions. [2019-11-25 08:49:12,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:12,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1878 transitions. [2019-11-25 08:49:12,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-25 08:49:12,590 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:12,590 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:12,590 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:12,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:12,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1892128057, now seen corresponding path program 1 times [2019-11-25 08:49:12,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:12,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110021663] [2019-11-25 08:49:12,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:12,680 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-25 08:49:12,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110021663] [2019-11-25 08:49:12,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:12,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:12,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254821087] [2019-11-25 08:49:12,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:12,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:12,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:12,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:12,683 INFO L87 Difference]: Start difference. First operand 1445 states and 1878 transitions. Second operand 3 states. [2019-11-25 08:49:13,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:13,199 INFO L93 Difference]: Finished difference Result 3150 states and 4119 transitions. [2019-11-25 08:49:13,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:13,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-11-25 08:49:13,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:13,209 INFO L225 Difference]: With dead ends: 3150 [2019-11-25 08:49:13,210 INFO L226 Difference]: Without dead ends: 1707 [2019-11-25 08:49:13,212 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:13,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-11-25 08:49:13,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1445. [2019-11-25 08:49:13,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-25 08:49:13,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1873 transitions. [2019-11-25 08:49:13,254 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1873 transitions. Word has length 116 [2019-11-25 08:49:13,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:13,255 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1873 transitions. [2019-11-25 08:49:13,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:13,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1873 transitions. [2019-11-25 08:49:13,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-25 08:49:13,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:13,258 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:13,258 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:13,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:13,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1006771335, now seen corresponding path program 1 times [2019-11-25 08:49:13,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:13,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494333980] [2019-11-25 08:49:13,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:13,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:13,357 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-25 08:49:13,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494333980] [2019-11-25 08:49:13,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:13,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:13,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138092655] [2019-11-25 08:49:13,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:13,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:13,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:13,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:13,359 INFO L87 Difference]: Start difference. First operand 1445 states and 1873 transitions. Second operand 3 states. [2019-11-25 08:49:13,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:13,885 INFO L93 Difference]: Finished difference Result 3805 states and 4890 transitions. [2019-11-25 08:49:13,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:13,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-11-25 08:49:13,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:13,897 INFO L225 Difference]: With dead ends: 3805 [2019-11-25 08:49:13,898 INFO L226 Difference]: Without dead ends: 2362 [2019-11-25 08:49:13,901 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:13,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2019-11-25 08:49:13,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 1838. [2019-11-25 08:49:13,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-25 08:49:13,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2315 transitions. [2019-11-25 08:49:13,954 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2315 transitions. Word has length 133 [2019-11-25 08:49:13,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:13,954 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2315 transitions. [2019-11-25 08:49:13,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:13,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2315 transitions. [2019-11-25 08:49:13,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-25 08:49:13,960 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:13,960 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-25 08:49:13,961 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:13,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:13,961 INFO L82 PathProgramCache]: Analyzing trace with hash 546693328, now seen corresponding path program 1 times [2019-11-25 08:49:13,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:13,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860268543] [2019-11-25 08:49:13,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:14,052 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-25 08:49:14,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860268543] [2019-11-25 08:49:14,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:14,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:14,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109300601] [2019-11-25 08:49:14,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:14,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:14,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:14,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:14,056 INFO L87 Difference]: Start difference. First operand 1838 states and 2315 transitions. Second operand 3 states. [2019-11-25 08:49:14,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:14,482 INFO L93 Difference]: Finished difference Result 3936 states and 4944 transitions. [2019-11-25 08:49:14,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:14,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-25 08:49:14,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:14,495 INFO L225 Difference]: With dead ends: 3936 [2019-11-25 08:49:14,495 INFO L226 Difference]: Without dead ends: 2100 [2019-11-25 08:49:14,497 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:14,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-11-25 08:49:14,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2100. [2019-11-25 08:49:14,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2019-11-25 08:49:14,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2595 transitions. [2019-11-25 08:49:14,543 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2595 transitions. Word has length 155 [2019-11-25 08:49:14,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:14,544 INFO L462 AbstractCegarLoop]: Abstraction has 2100 states and 2595 transitions. [2019-11-25 08:49:14,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:14,544 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2595 transitions. [2019-11-25 08:49:14,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-25 08:49:14,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:14,548 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:14,548 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:14,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:14,549 INFO L82 PathProgramCache]: Analyzing trace with hash -967776360, now seen corresponding path program 1 times [2019-11-25 08:49:14,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:14,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089900014] [2019-11-25 08:49:14,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:14,714 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-25 08:49:14,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089900014] [2019-11-25 08:49:14,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:14,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:49:14,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140883456] [2019-11-25 08:49:14,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:49:14,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:14,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:49:14,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:49:14,716 INFO L87 Difference]: Start difference. First operand 2100 states and 2595 transitions. Second operand 8 states. [2019-11-25 08:49:15,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:15,730 INFO L93 Difference]: Finished difference Result 4371 states and 5367 transitions. [2019-11-25 08:49:15,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:49:15,732 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 159 [2019-11-25 08:49:15,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:15,742 INFO L225 Difference]: With dead ends: 4371 [2019-11-25 08:49:15,742 INFO L226 Difference]: Without dead ends: 2273 [2019-11-25 08:49:15,745 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:49:15,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2019-11-25 08:49:15,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 2100. [2019-11-25 08:49:15,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2019-11-25 08:49:15,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2583 transitions. [2019-11-25 08:49:15,791 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2583 transitions. Word has length 159 [2019-11-25 08:49:15,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:15,791 INFO L462 AbstractCegarLoop]: Abstraction has 2100 states and 2583 transitions. [2019-11-25 08:49:15,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:49:15,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2583 transitions. [2019-11-25 08:49:15,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-25 08:49:15,796 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:15,796 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:15,796 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:15,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:15,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1011248568, now seen corresponding path program 1 times [2019-11-25 08:49:15,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:15,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487284206] [2019-11-25 08:49:15,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:15,930 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-25 08:49:15,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487284206] [2019-11-25 08:49:15,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:15,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:49:15,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486552634] [2019-11-25 08:49:15,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:49:15,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:15,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:49:15,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:15,933 INFO L87 Difference]: Start difference. First operand 2100 states and 2583 transitions. Second operand 4 states. [2019-11-25 08:49:16,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:16,559 INFO L93 Difference]: Finished difference Result 4331 states and 5314 transitions. [2019-11-25 08:49:16,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:49:16,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-11-25 08:49:16,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:16,568 INFO L225 Difference]: With dead ends: 4331 [2019-11-25 08:49:16,568 INFO L226 Difference]: Without dead ends: 2233 [2019-11-25 08:49:16,570 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:16,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2233 states. [2019-11-25 08:49:16,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2233 to 2231. [2019-11-25 08:49:16,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2231 states. [2019-11-25 08:49:16,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2606 transitions. [2019-11-25 08:49:16,614 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2606 transitions. Word has length 192 [2019-11-25 08:49:16,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:16,614 INFO L462 AbstractCegarLoop]: Abstraction has 2231 states and 2606 transitions. [2019-11-25 08:49:16,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:49:16,614 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2606 transitions. [2019-11-25 08:49:16,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-25 08:49:16,620 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:16,620 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-25 08:49:16,620 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:16,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:16,621 INFO L82 PathProgramCache]: Analyzing trace with hash -566866055, now seen corresponding path program 1 times [2019-11-25 08:49:16,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:16,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948290110] [2019-11-25 08:49:16,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:16,824 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-11-25 08:49:16,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948290110] [2019-11-25 08:49:16,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:16,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:49:16,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865584212] [2019-11-25 08:49:16,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:16,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:16,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:16,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:16,832 INFO L87 Difference]: Start difference. First operand 2231 states and 2606 transitions. Second operand 3 states. [2019-11-25 08:49:17,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:17,239 INFO L93 Difference]: Finished difference Result 2757 states and 3185 transitions. [2019-11-25 08:49:17,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:17,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-11-25 08:49:17,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:17,252 INFO L225 Difference]: With dead ends: 2757 [2019-11-25 08:49:17,253 INFO L226 Difference]: Without dead ends: 2755 [2019-11-25 08:49:17,254 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:17,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2019-11-25 08:49:17,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 1969. [2019-11-25 08:49:17,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-25 08:49:17,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2324 transitions. [2019-11-25 08:49:17,296 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2324 transitions. Word has length 194 [2019-11-25 08:49:17,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:17,296 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2324 transitions. [2019-11-25 08:49:17,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:17,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2324 transitions. [2019-11-25 08:49:17,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-25 08:49:17,301 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:17,301 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-11-25 08:49:17,301 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:17,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:17,302 INFO L82 PathProgramCache]: Analyzing trace with hash 643345862, now seen corresponding path program 1 times [2019-11-25 08:49:17,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:17,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559045827] [2019-11-25 08:49:17,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:17,415 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-25 08:49:17,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559045827] [2019-11-25 08:49:17,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:17,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:49:17,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294782950] [2019-11-25 08:49:17,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:49:17,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:17,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:49:17,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:17,418 INFO L87 Difference]: Start difference. First operand 1969 states and 2324 transitions. Second operand 4 states. [2019-11-25 08:49:18,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:18,040 INFO L93 Difference]: Finished difference Result 4460 states and 5224 transitions. [2019-11-25 08:49:18,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:49:18,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2019-11-25 08:49:18,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:18,053 INFO L225 Difference]: With dead ends: 4460 [2019-11-25 08:49:18,055 INFO L226 Difference]: Without dead ends: 2493 [2019-11-25 08:49:18,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:18,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2019-11-25 08:49:18,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 1969. [2019-11-25 08:49:18,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-25 08:49:18,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2312 transitions. [2019-11-25 08:49:18,098 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2312 transitions. Word has length 198 [2019-11-25 08:49:18,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:18,101 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2312 transitions. [2019-11-25 08:49:18,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:49:18,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2312 transitions. [2019-11-25 08:49:18,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-11-25 08:49:18,106 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:18,106 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:18,106 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:18,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:18,107 INFO L82 PathProgramCache]: Analyzing trace with hash -333400197, now seen corresponding path program 1 times [2019-11-25 08:49:18,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:18,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96156534] [2019-11-25 08:49:18,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:18,298 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-11-25 08:49:18,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96156534] [2019-11-25 08:49:18,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:18,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:49:18,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574010783] [2019-11-25 08:49:18,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:49:18,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:18,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:49:18,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:49:18,300 INFO L87 Difference]: Start difference. First operand 1969 states and 2312 transitions. Second operand 6 states. [2019-11-25 08:49:19,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:19,127 INFO L93 Difference]: Finished difference Result 4105 states and 4797 transitions. [2019-11-25 08:49:19,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:49:19,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 219 [2019-11-25 08:49:19,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:19,136 INFO L225 Difference]: With dead ends: 4105 [2019-11-25 08:49:19,137 INFO L226 Difference]: Without dead ends: 2138 [2019-11-25 08:49:19,139 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:49:19,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2019-11-25 08:49:19,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 1838. [2019-11-25 08:49:19,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-25 08:49:19,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2102 transitions. [2019-11-25 08:49:19,174 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2102 transitions. Word has length 219 [2019-11-25 08:49:19,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:19,174 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2102 transitions. [2019-11-25 08:49:19,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:49:19,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2102 transitions. [2019-11-25 08:49:19,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-11-25 08:49:19,179 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:19,180 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-25 08:49:19,180 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:19,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:19,180 INFO L82 PathProgramCache]: Analyzing trace with hash 471134404, now seen corresponding path program 1 times [2019-11-25 08:49:19,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:19,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135050480] [2019-11-25 08:49:19,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:19,363 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 194 proven. 4 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-11-25 08:49:19,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135050480] [2019-11-25 08:49:19,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391428826] [2019-11-25 08:49:19,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c470de7-7221-43c1-aef9-c1b8c3135f3c/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 [2019-11-25 08:49:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:19,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:49:19,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:49:19,602 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-11-25 08:49:19,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:49:19,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-11-25 08:49:19,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082606152] [2019-11-25 08:49:19,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:19,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:19,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:19,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:19,605 INFO L87 Difference]: Start difference. First operand 1838 states and 2102 transitions. Second operand 3 states. [2019-11-25 08:49:20,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:20,123 INFO L93 Difference]: Finished difference Result 3672 states and 4201 transitions. [2019-11-25 08:49:20,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:20,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-11-25 08:49:20,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:20,125 INFO L225 Difference]: With dead ends: 3672 [2019-11-25 08:49:20,125 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:49:20,127 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:20,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:49:20,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:49:20,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:49:20,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:49:20,128 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 241 [2019-11-25 08:49:20,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:20,129 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:49:20,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:20,129 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:49:20,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:49:20,334 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:49:20,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:49:20,507 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 91 [2019-11-25 08:49:20,646 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 92 [2019-11-25 08:49:21,016 WARN L192 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 34 [2019-11-25 08:49:21,340 WARN L192 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 34 [2019-11-25 08:49:21,342 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-25 08:49:21,343 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-25 08:49:21,343 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,343 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,343 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,343 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,343 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,343 INFO L444 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,343 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-25 08:49:21,343 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-25 08:49:21,343 INFO L444 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-25 08:49:21,344 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-25 08:49:21,344 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-25 08:49:21,344 INFO L444 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-25 08:49:21,344 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-25 08:49:21,344 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-25 08:49:21,344 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-25 08:49:21,344 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-25 08:49:21,344 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,344 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,344 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,344 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,345 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,345 INFO L444 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,345 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-25 08:49:21,345 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-25 08:49:21,345 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-25 08:49:21,345 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-25 08:49:21,345 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-25 08:49:21,345 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-25 08:49:21,345 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-25 08:49:21,345 INFO L444 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-25 08:49:21,345 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-25 08:49:21,345 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-25 08:49:21,346 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-25 08:49:21,346 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-25 08:49:21,346 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-25 08:49:21,346 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-25 08:49:21,346 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-25 08:49:21,346 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,346 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,346 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,346 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,346 INFO L444 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,346 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-25 08:49:21,347 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-25 08:49:21,347 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-25 08:49:21,347 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-25 08:49:21,347 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-25 08:49:21,347 INFO L444 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-25 08:49:21,347 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-25 08:49:21,347 INFO L444 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-25 08:49:21,347 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-25 08:49:21,348 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse1 (<= ~a17~0 0)) (.cse5 (= ~a16~0 6)) (.cse0 (= ~a16~0 4)) (.cse6 (not (= 1 ~a7~0))) (.cse4 (<= ~a21~0 0)) (.cse7 (= ~a17~0 1)) (.cse2 (= ~a21~0 1)) (.cse3 (not (= 13 ~a8~0)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse1) (and .cse4 .cse5) (and .cse6 .cse2 .cse5 .cse3) (and .cse7 (= ~a20~0 1) .cse2) (and .cse6 .cse7 .cse2) (and .cse0 .cse6 .cse2) (and .cse4 .cse7) (and .cse2 .cse3 (= ~a16~0 5)))) [2019-11-25 08:49:21,348 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,348 INFO L444 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,348 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,348 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,348 INFO L444 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,348 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-25 08:49:21,348 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-25 08:49:21,348 INFO L444 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-25 08:49:21,348 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-25 08:49:21,348 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-25 08:49:21,349 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-25 08:49:21,349 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-25 08:49:21,349 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-25 08:49:21,349 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-25 08:49:21,349 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-25 08:49:21,349 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-25 08:49:21,349 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-25 08:49:21,349 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-25 08:49:21,349 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-25 08:49:21,357 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,357 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,358 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,358 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,358 INFO L444 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,358 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-25 08:49:21,358 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-25 08:49:21,358 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-25 08:49:21,358 INFO L444 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-25 08:49:21,359 INFO L444 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-25 08:49:21,359 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-25 08:49:21,359 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-25 08:49:21,359 INFO L444 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-25 08:49:21,359 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-25 08:49:21,359 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,359 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,360 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,361 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,361 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-25 08:49:21,362 INFO L444 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,362 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-25 08:49:21,362 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-25 08:49:21,362 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-25 08:49:21,362 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-25 08:49:21,362 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-25 08:49:21,362 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-25 08:49:21,363 INFO L444 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-25 08:49:21,363 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:49:21,363 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-25 08:49:21,363 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-25 08:49:21,363 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-25 08:49:21,363 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-25 08:49:21,363 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-25 08:49:21,364 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-25 08:49:21,364 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,365 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse1 (<= ~a17~0 0)) (.cse5 (= ~a16~0 6)) (.cse0 (= ~a16~0 4)) (.cse6 (not (= 1 ~a7~0))) (.cse4 (<= ~a21~0 0)) (.cse7 (= ~a17~0 1)) (.cse2 (= ~a21~0 1)) (.cse3 (not (= 13 ~a8~0)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse1) (and .cse4 .cse5) (and .cse6 .cse2 .cse5 .cse3) (and .cse7 (= ~a20~0 1) .cse2) (and .cse6 .cse7 .cse2) (and .cse0 .cse6 .cse2) (and .cse4 .cse7) (and .cse2 .cse3 (= ~a16~0 5)))) [2019-11-25 08:49:21,365 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,365 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,365 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,366 INFO L444 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,366 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-25 08:49:21,366 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-25 08:49:21,366 INFO L444 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-25 08:49:21,366 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-25 08:49:21,366 INFO L444 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-25 08:49:21,366 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-25 08:49:21,366 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-25 08:49:21,367 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-25 08:49:21,367 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,367 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,367 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,367 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,367 INFO L444 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,367 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-25 08:49:21,368 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:49:21,368 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-25 08:49:21,368 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-25 08:49:21,368 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-25 08:49:21,368 INFO L444 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-25 08:49:21,368 INFO L444 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-25 08:49:21,368 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-25 08:49:21,369 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-25 08:49:21,369 INFO L444 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-25 08:49:21,369 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-25 08:49:21,369 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-25 08:49:21,369 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-25 08:49:21,369 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,369 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,370 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,370 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,370 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-25 08:49:21,370 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,370 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,370 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-25 08:49:21,370 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-25 08:49:21,370 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:49:21,371 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-25 08:49:21,371 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-25 08:49:21,371 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-25 08:49:21,371 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-25 08:49:21,371 INFO L444 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-25 08:49:21,371 INFO L444 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-25 08:49:21,371 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-25 08:49:21,372 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-25 08:49:21,372 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-25 08:49:21,373 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-25 08:49:21,373 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,373 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,373 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,373 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,374 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,374 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-25 08:49:21,374 INFO L444 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,374 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-25 08:49:21,374 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-25 08:49:21,374 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-25 08:49:21,374 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-25 08:49:21,374 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-25 08:49:21,375 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-25 08:49:21,375 INFO L444 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-25 08:49:21,375 INFO L444 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-25 08:49:21,375 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-25 08:49:21,375 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-25 08:49:21,375 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-25 08:49:21,375 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-25 08:49:21,376 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 446) no Hoare annotation was computed. [2019-11-25 08:49:21,377 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-25 08:49:21,377 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-25 08:49:21,378 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-25 08:49:21,378 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,378 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,378 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,378 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,378 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,378 INFO L444 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:49:21,379 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-25 08:49:21,379 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-25 08:49:21,379 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-25 08:49:21,379 INFO L444 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-25 08:49:21,379 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-25 08:49:21,379 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-25 08:49:21,379 INFO L444 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-25 08:49:21,379 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-25 08:49:21,380 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-25 08:49:21,380 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-25 08:49:21,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:49:21 BoogieIcfgContainer [2019-11-25 08:49:21,416 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:49:21,417 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:49:21,417 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:49:21,417 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:49:21,418 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:49:09" (3/4) ... [2019-11-25 08:49:21,421 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:49:21,446 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-25 08:49:21,447 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 08:49:21,646 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5c470de7-7221-43c1-aef9-c1b8c3135f3c/bin/uautomizer/witness.graphml [2019-11-25 08:49:21,646 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:49:21,648 INFO L168 Benchmark]: Toolchain (without parser) took 14485.13 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 417.9 MB). Free memory was 943.4 MB in the beginning and 1.3 GB in the end (delta: -362.5 MB). Peak memory consumption was 55.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:21,648 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:49:21,648 INFO L168 Benchmark]: CACSL2BoogieTranslator took 586.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -173.5 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:21,649 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:21,649 INFO L168 Benchmark]: Boogie Preprocessor took 80.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:49:21,649 INFO L168 Benchmark]: RCFGBuilder took 1092.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 991.6 MB in the end (delta: 114.6 MB). Peak memory consumption was 114.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:21,650 INFO L168 Benchmark]: TraceAbstraction took 12408.46 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 277.9 MB). Free memory was 991.6 MB in the beginning and 1.3 GB in the end (delta: -340.3 MB). Peak memory consumption was 428.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:21,650 INFO L168 Benchmark]: Witness Printer took 229.64 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:21,652 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 586.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -173.5 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 79.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 80.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1092.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 991.6 MB in the end (delta: 114.6 MB). Peak memory consumption was 114.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12408.46 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 277.9 MB). Free memory was 991.6 MB in the beginning and 1.3 GB in the end (delta: -340.3 MB). Peak memory consumption was 428.4 MB. Max. memory is 11.5 GB. * Witness Printer took 229.64 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 446]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((a16 == 4 && a17 <= 0) && a21 == 1) && !(13 == a8)) || ((a21 <= 0 && a16 == 4) && a17 <= 0)) || (a21 <= 0 && a16 == 6)) || (((!(1 == a7) && a21 == 1) && a16 == 6) && !(13 == a8))) || ((a17 == 1 && a20 == 1) && a21 == 1)) || ((!(1 == a7) && a17 == 1) && a21 == 1)) || ((a16 == 4 && !(1 == a7)) && a21 == 1)) || (a21 <= 0 && a17 == 1)) || ((a21 == 1 && !(13 == a8)) && a16 == 5) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((a16 == 4 && a17 <= 0) && a21 == 1) && !(13 == a8)) || ((a21 <= 0 && a16 == 4) && a17 <= 0)) || (a21 <= 0 && a16 == 6)) || (((!(1 == a7) && a21 == 1) && a16 == 6) && !(13 == a8))) || ((a17 == 1 && a20 == 1) && a21 == 1)) || ((!(1 == a7) && a17 == 1) && a21 == 1)) || ((a16 == 4 && !(1 == a7)) && a21 == 1)) || (a21 <= 0 && a17 == 1)) || ((a21 == 1 && !(13 == a8)) && a16 == 5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 12.3s, OverallIterations: 12, TraceHistogramMax: 6, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, HoareTripleCheckerStatistics: 930 SDtfs, 2193 SDslu, 136 SDs, 0 SdLazy, 6433 SolverSat, 1043 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 287 GetRequests, 258 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2231occurred in iteration=8, 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, 12 MinimizatonAttempts, 2702 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 34 NumberOfFragments, 195 HoareAnnotationTreeSize, 3 FomulaSimplifications, 16249 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 3449 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2131 NumberOfCodeBlocks, 2131 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2118 ConstructedInterpolants, 0 QuantifiedInterpolants, 915680 SizeOfPredicates, 1 NumberOfNonLiveVariables, 445 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 1826/1830 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...