./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem16_label21.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c2fbee57-cf47-446f-beef-d6fb03639cc4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c2fbee57-cf47-446f-beef-d6fb03639cc4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c2fbee57-cf47-446f-beef-d6fb03639cc4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c2fbee57-cf47-446f-beef-d6fb03639cc4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem16_label21.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c2fbee57-cf47-446f-beef-d6fb03639cc4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c2fbee57-cf47-446f-beef-d6fb03639cc4/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 2a7583bada7d92ecf81db6380e139f6bc8bbcd06 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:24:00,726 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:24:00,728 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:24:00,738 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:24:00,739 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:24:00,740 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:24:00,741 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:24:00,743 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:24:00,745 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:24:00,746 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:24:00,747 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:24:00,748 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:24:00,749 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:24:00,750 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:24:00,751 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:24:00,752 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:24:00,752 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:24:00,753 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:24:00,757 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:24:00,760 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:24:00,764 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:24:00,767 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:24:00,769 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:24:00,771 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:24:00,773 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:24:00,775 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:24:00,776 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:24:00,777 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:24:00,778 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:24:00,779 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:24:00,780 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:24:00,781 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:24:00,782 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:24:00,782 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:24:00,784 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:24:00,784 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:24:00,785 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:24:00,786 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:24:00,786 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:24:00,787 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:24:00,787 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:24:00,789 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c2fbee57-cf47-446f-beef-d6fb03639cc4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:24:00,805 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:24:00,805 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:24:00,807 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:24:00,807 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:24:00,807 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:24:00,808 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:24:00,808 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:24:00,808 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:24:00,808 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:24:00,809 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:24:00,810 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:24:00,810 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:24:00,810 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:24:00,810 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:24:00,811 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:24:00,811 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:24:00,811 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:24:00,811 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:24:00,812 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:24:00,812 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:24:00,812 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:24:00,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:24:00,813 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:24:00,813 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:24:00,813 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:24:00,813 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:24:00,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:24:00,814 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:24:00,814 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_c2fbee57-cf47-446f-beef-d6fb03639cc4/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 -> 2a7583bada7d92ecf81db6380e139f6bc8bbcd06 [2019-11-15 21:24:00,863 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:24:00,873 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:24:00,876 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:24:00,878 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:24:00,878 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:24:00,879 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c2fbee57-cf47-446f-beef-d6fb03639cc4/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem16_label21.c [2019-11-15 21:24:00,931 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c2fbee57-cf47-446f-beef-d6fb03639cc4/bin/uautomizer/data/621f98301/49cee3915f65435b8edc29d59be61a5f/FLAGbc4c16222 [2019-11-15 21:24:01,516 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:24:01,517 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c2fbee57-cf47-446f-beef-d6fb03639cc4/sv-benchmarks/c/eca-rers2012/Problem16_label21.c [2019-11-15 21:24:01,546 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c2fbee57-cf47-446f-beef-d6fb03639cc4/bin/uautomizer/data/621f98301/49cee3915f65435b8edc29d59be61a5f/FLAGbc4c16222 [2019-11-15 21:24:01,725 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c2fbee57-cf47-446f-beef-d6fb03639cc4/bin/uautomizer/data/621f98301/49cee3915f65435b8edc29d59be61a5f [2019-11-15 21:24:01,727 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:24:01,728 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:24:01,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:24:01,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:24:01,733 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:24:01,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:24:01" (1/1) ... [2019-11-15 21:24:01,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f2d2514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:01, skipping insertion in model container [2019-11-15 21:24:01,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:24:01" (1/1) ... [2019-11-15 21:24:01,744 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:24:01,833 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:24:02,682 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:24:02,687 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:24:02,906 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:24:02,922 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:24:02,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:02 WrapperNode [2019-11-15 21:24:02,923 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:24:02,926 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:24:02,926 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:24:02,926 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:24:02,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:02" (1/1) ... [2019-11-15 21:24:02,970 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:02" (1/1) ... [2019-11-15 21:24:03,066 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:24:03,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:24:03,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:24:03,067 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:24:03,076 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:02" (1/1) ... [2019-11-15 21:24:03,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:02" (1/1) ... [2019-11-15 21:24:03,102 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:02" (1/1) ... [2019-11-15 21:24:03,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:02" (1/1) ... [2019-11-15 21:24:03,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:02" (1/1) ... [2019-11-15 21:24:03,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:02" (1/1) ... [2019-11-15 21:24:03,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:02" (1/1) ... [2019-11-15 21:24:03,199 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:24:03,199 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:24:03,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:24:03,200 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:24:03,200 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2fbee57-cf47-446f-beef-d6fb03639cc4/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-15 21:24:03,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:24:03,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:24:05,907 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:24:05,907 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 21:24:05,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:24:05 BoogieIcfgContainer [2019-11-15 21:24:05,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:24:05,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:24:05,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:24:05,913 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:24:05,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:24:01" (1/3) ... [2019-11-15 21:24:05,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dcd6b23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:24:05, skipping insertion in model container [2019-11-15 21:24:05,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:02" (2/3) ... [2019-11-15 21:24:05,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dcd6b23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:24:05, skipping insertion in model container [2019-11-15 21:24:05,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:24:05" (3/3) ... [2019-11-15 21:24:05,916 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem16_label21.c [2019-11-15 21:24:05,926 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:24:05,934 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 21:24:05,944 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 21:24:05,970 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:24:05,970 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:24:05,970 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:24:05,970 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:24:05,971 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:24:05,971 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:24:05,971 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:24:05,971 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:24:05,994 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states. [2019-11-15 21:24:06,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-15 21:24:06,001 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:24:06,001 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:24:06,003 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:24:06,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:06,008 INFO L82 PathProgramCache]: Analyzing trace with hash 323974986, now seen corresponding path program 1 times [2019-11-15 21:24:06,016 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:06,017 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255690291] [2019-11-15 21:24:06,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:06,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:06,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:06,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:06,454 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-15 21:24:06,454 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255690291] [2019-11-15 21:24:06,455 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:24:06,455 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:24:06,455 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071058674] [2019-11-15 21:24:06,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:24:06,458 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:24:06,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:24:06,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:24:06,477 INFO L87 Difference]: Start difference. First operand 396 states. Second operand 7 states. [2019-11-15 21:24:13,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:24:13,812 INFO L93 Difference]: Finished difference Result 1815 states and 3471 transitions. [2019-11-15 21:24:13,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:24:13,815 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-11-15 21:24:13,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:24:13,850 INFO L225 Difference]: With dead ends: 1815 [2019-11-15 21:24:13,850 INFO L226 Difference]: Without dead ends: 1342 [2019-11-15 21:24:13,859 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:24:13,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2019-11-15 21:24:13,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 991. [2019-11-15 21:24:13,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2019-11-15 21:24:13,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1483 transitions. [2019-11-15 21:24:13,989 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1483 transitions. Word has length 38 [2019-11-15 21:24:13,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:24:13,989 INFO L462 AbstractCegarLoop]: Abstraction has 991 states and 1483 transitions. [2019-11-15 21:24:13,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:24:13,990 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1483 transitions. [2019-11-15 21:24:14,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-11-15 21:24:14,008 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:24:14,009 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 21:24:14,009 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:24:14,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:14,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1339527614, now seen corresponding path program 1 times [2019-11-15 21:24:14,010 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:14,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110033226] [2019-11-15 21:24:14,011 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:14,011 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:14,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:14,377 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 21:24:14,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110033226] [2019-11-15 21:24:14,377 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:24:14,377 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:24:14,378 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873394775] [2019-11-15 21:24:14,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:24:14,381 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:24:14,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:24:14,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:24:14,381 INFO L87 Difference]: Start difference. First operand 991 states and 1483 transitions. Second operand 4 states. [2019-11-15 21:24:16,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:24:16,322 INFO L93 Difference]: Finished difference Result 2638 states and 4103 transitions. [2019-11-15 21:24:16,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:24:16,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2019-11-15 21:24:16,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:24:16,335 INFO L225 Difference]: With dead ends: 2638 [2019-11-15 21:24:16,335 INFO L226 Difference]: Without dead ends: 1649 [2019-11-15 21:24:16,338 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:24:16,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2019-11-15 21:24:16,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649. [2019-11-15 21:24:16,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1649 states. [2019-11-15 21:24:16,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2382 transitions. [2019-11-15 21:24:16,382 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2382 transitions. Word has length 228 [2019-11-15 21:24:16,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:24:16,386 INFO L462 AbstractCegarLoop]: Abstraction has 1649 states and 2382 transitions. [2019-11-15 21:24:16,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:24:16,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2382 transitions. [2019-11-15 21:24:16,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-11-15 21:24:16,392 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:24:16,393 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:24:16,393 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:24:16,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:16,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1455088589, now seen corresponding path program 1 times [2019-11-15 21:24:16,394 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:16,394 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200971589] [2019-11-15 21:24:16,395 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:16,396 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:16,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:16,808 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-15 21:24:16,809 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200971589] [2019-11-15 21:24:16,809 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:24:16,809 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:24:16,810 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517629635] [2019-11-15 21:24:16,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:24:16,811 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:24:16,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:24:16,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:24:16,815 INFO L87 Difference]: Start difference. First operand 1649 states and 2382 transitions. Second operand 4 states. [2019-11-15 21:24:19,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:24:19,089 INFO L93 Difference]: Finished difference Result 4941 states and 6996 transitions. [2019-11-15 21:24:19,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:24:19,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 339 [2019-11-15 21:24:19,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:24:19,116 INFO L225 Difference]: With dead ends: 4941 [2019-11-15 21:24:19,116 INFO L226 Difference]: Without dead ends: 2636 [2019-11-15 21:24:19,119 INFO L600 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-15 21:24:19,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2019-11-15 21:24:19,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2636. [2019-11-15 21:24:19,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2636 states. [2019-11-15 21:24:19,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 2855 transitions. [2019-11-15 21:24:19,179 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 2855 transitions. Word has length 339 [2019-11-15 21:24:19,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:24:19,180 INFO L462 AbstractCegarLoop]: Abstraction has 2636 states and 2855 transitions. [2019-11-15 21:24:19,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:24:19,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 2855 transitions. [2019-11-15 21:24:19,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2019-11-15 21:24:19,194 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:24:19,195 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:24:19,195 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:24:19,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:19,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1707840837, now seen corresponding path program 1 times [2019-11-15 21:24:19,196 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:19,196 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597352346] [2019-11-15 21:24:19,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:19,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:19,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:19,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:19,776 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 645 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-15 21:24:19,776 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597352346] [2019-11-15 21:24:19,776 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:24:19,776 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:24:19,777 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288719194] [2019-11-15 21:24:19,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:24:19,777 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:24:19,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:24:19,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:24:19,778 INFO L87 Difference]: Start difference. First operand 2636 states and 2855 transitions. Second operand 4 states. [2019-11-15 21:24:21,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:24:21,699 INFO L93 Difference]: Finished difference Result 8231 states and 8981 transitions. [2019-11-15 21:24:21,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:24:21,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 615 [2019-11-15 21:24:21,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:24:21,727 INFO L225 Difference]: With dead ends: 8231 [2019-11-15 21:24:21,728 INFO L226 Difference]: Without dead ends: 5926 [2019-11-15 21:24:21,731 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:24:21,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5926 states. [2019-11-15 21:24:21,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5926 to 4939. [2019-11-15 21:24:21,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4939 states. [2019-11-15 21:24:21,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4939 states to 4939 states and 5298 transitions. [2019-11-15 21:24:21,831 INFO L78 Accepts]: Start accepts. Automaton has 4939 states and 5298 transitions. Word has length 615 [2019-11-15 21:24:21,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:24:21,832 INFO L462 AbstractCegarLoop]: Abstraction has 4939 states and 5298 transitions. [2019-11-15 21:24:21,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:24:21,832 INFO L276 IsEmpty]: Start isEmpty. Operand 4939 states and 5298 transitions. [2019-11-15 21:24:21,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 679 [2019-11-15 21:24:21,853 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:24:21,853 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:24:21,854 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:24:21,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:21,854 INFO L82 PathProgramCache]: Analyzing trace with hash -276815383, now seen corresponding path program 1 times [2019-11-15 21:24:21,854 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:21,855 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942404950] [2019-11-15 21:24:21,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:21,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:21,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:22,533 INFO L134 CoverageAnalysis]: Checked inductivity of 897 backedges. 719 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2019-11-15 21:24:22,534 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942404950] [2019-11-15 21:24:22,534 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:24:22,534 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:24:22,535 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868121284] [2019-11-15 21:24:22,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:24:22,536 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:24:22,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:24:22,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:24:22,538 INFO L87 Difference]: Start difference. First operand 4939 states and 5298 transitions. Second operand 4 states. [2019-11-15 21:24:24,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:24:24,481 INFO L93 Difference]: Finished difference Result 12837 states and 13876 transitions. [2019-11-15 21:24:24,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:24:24,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 678 [2019-11-15 21:24:24,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:24:24,523 INFO L225 Difference]: With dead ends: 12837 [2019-11-15 21:24:24,524 INFO L226 Difference]: Without dead ends: 8229 [2019-11-15 21:24:24,529 INFO L600 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-15 21:24:24,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8229 states. [2019-11-15 21:24:24,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8229 to 8229. [2019-11-15 21:24:24,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8229 states. [2019-11-15 21:24:24,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8229 states to 8229 states and 8759 transitions. [2019-11-15 21:24:24,690 INFO L78 Accepts]: Start accepts. Automaton has 8229 states and 8759 transitions. Word has length 678 [2019-11-15 21:24:24,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:24:24,691 INFO L462 AbstractCegarLoop]: Abstraction has 8229 states and 8759 transitions. [2019-11-15 21:24:24,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:24:24,692 INFO L276 IsEmpty]: Start isEmpty. Operand 8229 states and 8759 transitions. [2019-11-15 21:24:24,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 704 [2019-11-15 21:24:24,701 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:24:24,702 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:24:24,702 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:24:24,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:24,703 INFO L82 PathProgramCache]: Analyzing trace with hash 340514409, now seen corresponding path program 1 times [2019-11-15 21:24:24,703 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:24,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073602625] [2019-11-15 21:24:24,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:24,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:24,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:25,995 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 321 proven. 243 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2019-11-15 21:24:25,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073602625] [2019-11-15 21:24:25,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693303275] [2019-11-15 21:24:25,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2fbee57-cf47-446f-beef-d6fb03639cc4/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-15 21:24:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:26,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:24:26,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:24:26,700 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 475 trivial. 0 not checked. [2019-11-15 21:24:26,701 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:24:26,701 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-15 21:24:26,702 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935748842] [2019-11-15 21:24:26,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:24:26,703 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:24:26,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:24:26,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:24:26,704 INFO L87 Difference]: Start difference. First operand 8229 states and 8759 transitions. Second operand 3 states. [2019-11-15 21:24:27,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:24:27,889 INFO L93 Difference]: Finished difference Result 16127 states and 17185 transitions. [2019-11-15 21:24:27,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:24:27,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 703 [2019-11-15 21:24:27,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:24:27,937 INFO L225 Difference]: With dead ends: 16127 [2019-11-15 21:24:27,937 INFO L226 Difference]: Without dead ends: 8229 [2019-11-15 21:24:27,947 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 712 GetRequests, 703 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:24:27,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8229 states. [2019-11-15 21:24:28,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8229 to 8229. [2019-11-15 21:24:28,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8229 states. [2019-11-15 21:24:28,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8229 states to 8229 states and 8692 transitions. [2019-11-15 21:24:28,100 INFO L78 Accepts]: Start accepts. Automaton has 8229 states and 8692 transitions. Word has length 703 [2019-11-15 21:24:28,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:24:28,101 INFO L462 AbstractCegarLoop]: Abstraction has 8229 states and 8692 transitions. [2019-11-15 21:24:28,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:24:28,108 INFO L276 IsEmpty]: Start isEmpty. Operand 8229 states and 8692 transitions. [2019-11-15 21:24:28,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 875 [2019-11-15 21:24:28,124 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:24:28,125 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:24:28,328 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:24:28,328 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:24:28,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:28,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1714990728, now seen corresponding path program 1 times [2019-11-15 21:24:28,329 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:28,329 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077617565] [2019-11-15 21:24:28,329 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:28,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:28,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:29,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1507 backedges. 751 proven. 0 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2019-11-15 21:24:29,609 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077617565] [2019-11-15 21:24:29,609 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:24:29,610 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:24:29,610 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910857269] [2019-11-15 21:24:29,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:24:29,611 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:24:29,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:24:29,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:24:29,612 INFO L87 Difference]: Start difference. First operand 8229 states and 8692 transitions. Second operand 4 states. [2019-11-15 21:24:31,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:24:31,493 INFO L93 Difference]: Finished difference Result 17772 states and 18743 transitions. [2019-11-15 21:24:31,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:24:31,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 874 [2019-11-15 21:24:31,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:24:31,523 INFO L225 Difference]: With dead ends: 17772 [2019-11-15 21:24:31,523 INFO L226 Difference]: Without dead ends: 9216 [2019-11-15 21:24:31,534 INFO L600 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-15 21:24:31,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9216 states. [2019-11-15 21:24:31,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9216 to 7900. [2019-11-15 21:24:31,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7900 states. [2019-11-15 21:24:31,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 8219 transitions. [2019-11-15 21:24:31,673 INFO L78 Accepts]: Start accepts. Automaton has 7900 states and 8219 transitions. Word has length 874 [2019-11-15 21:24:31,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:24:31,675 INFO L462 AbstractCegarLoop]: Abstraction has 7900 states and 8219 transitions. [2019-11-15 21:24:31,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:24:31,675 INFO L276 IsEmpty]: Start isEmpty. Operand 7900 states and 8219 transitions. [2019-11-15 21:24:31,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1030 [2019-11-15 21:24:31,703 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:24:31,706 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:24:31,706 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:24:31,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:31,707 INFO L82 PathProgramCache]: Analyzing trace with hash -2118622610, now seen corresponding path program 1 times [2019-11-15 21:24:31,707 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:31,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233770423] [2019-11-15 21:24:31,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:31,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:31,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:34,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1599 backedges. 1122 proven. 38 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2019-11-15 21:24:34,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233770423] [2019-11-15 21:24:34,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168499812] [2019-11-15 21:24:34,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2fbee57-cf47-446f-beef-d6fb03639cc4/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:24:34,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:34,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 1196 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:24:34,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:24:36,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1599 backedges. 964 proven. 83 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2019-11-15 21:24:36,009 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:24:36,010 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 3] total 11 [2019-11-15 21:24:36,010 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391046920] [2019-11-15 21:24:36,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 21:24:36,012 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:24:36,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 21:24:36,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:24:36,013 INFO L87 Difference]: Start difference. First operand 7900 states and 8219 transitions. Second operand 11 states. [2019-11-15 21:24:45,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:24:45,321 INFO L93 Difference]: Finished difference Result 19469 states and 20307 transitions. [2019-11-15 21:24:45,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-15 21:24:45,322 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1029 [2019-11-15 21:24:45,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:24:45,340 INFO L225 Difference]: With dead ends: 19469 [2019-11-15 21:24:45,340 INFO L226 Difference]: Without dead ends: 11900 [2019-11-15 21:24:45,352 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1080 GetRequests, 1044 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=317, Invalid=1089, Unknown=0, NotChecked=0, Total=1406 [2019-11-15 21:24:45,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11900 states. [2019-11-15 21:24:45,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11900 to 9740. [2019-11-15 21:24:45,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9740 states. [2019-11-15 21:24:45,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9740 states to 9740 states and 10058 transitions. [2019-11-15 21:24:45,481 INFO L78 Accepts]: Start accepts. Automaton has 9740 states and 10058 transitions. Word has length 1029 [2019-11-15 21:24:45,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:24:45,482 INFO L462 AbstractCegarLoop]: Abstraction has 9740 states and 10058 transitions. [2019-11-15 21:24:45,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 21:24:45,482 INFO L276 IsEmpty]: Start isEmpty. Operand 9740 states and 10058 transitions. [2019-11-15 21:24:45,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1660 [2019-11-15 21:24:45,515 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:24:45,516 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:24:45,719 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:24:45,728 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:24:45,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:45,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1015306804, now seen corresponding path program 1 times [2019-11-15 21:24:45,728 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:45,729 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502593888] [2019-11-15 21:24:45,729 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:45,729 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:45,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:49,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4527 backedges. 1977 proven. 157 refuted. 0 times theorem prover too weak. 2393 trivial. 0 not checked. [2019-11-15 21:24:49,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502593888] [2019-11-15 21:24:49,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752503467] [2019-11-15 21:24:49,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2fbee57-cf47-446f-beef-d6fb03639cc4/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:24:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:50,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 1890 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:24:50,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:24:51,851 INFO L134 CoverageAnalysis]: Checked inductivity of 4527 backedges. 2134 proven. 0 refuted. 0 times theorem prover too weak. 2393 trivial. 0 not checked. [2019-11-15 21:24:51,851 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:24:51,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-11-15 21:24:51,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504631595] [2019-11-15 21:24:51,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:24:51,854 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:24:51,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:24:51,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:24:51,855 INFO L87 Difference]: Start difference. First operand 9740 states and 10058 transitions. Second operand 3 states. [2019-11-15 21:24:52,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:24:52,830 INFO L93 Difference]: Finished difference Result 20743 states and 21415 transitions. [2019-11-15 21:24:52,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:24:52,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1659 [2019-11-15 21:24:52,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:24:52,848 INFO L225 Difference]: With dead ends: 20743 [2019-11-15 21:24:52,848 INFO L226 Difference]: Without dead ends: 11334 [2019-11-15 21:24:52,861 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1667 GetRequests, 1658 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:24:52,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11334 states. [2019-11-15 21:24:53,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11334 to 10883. [2019-11-15 21:24:53,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10883 states. [2019-11-15 21:24:53,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10883 states to 10883 states and 11216 transitions. [2019-11-15 21:24:53,035 INFO L78 Accepts]: Start accepts. Automaton has 10883 states and 11216 transitions. Word has length 1659 [2019-11-15 21:24:53,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:24:53,040 INFO L462 AbstractCegarLoop]: Abstraction has 10883 states and 11216 transitions. [2019-11-15 21:24:53,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:24:53,040 INFO L276 IsEmpty]: Start isEmpty. Operand 10883 states and 11216 transitions. [2019-11-15 21:24:53,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1829 [2019-11-15 21:24:53,098 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:24:53,100 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:24:53,310 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:24:53,310 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:24:53,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:53,311 INFO L82 PathProgramCache]: Analyzing trace with hash 231526824, now seen corresponding path program 1 times [2019-11-15 21:24:53,311 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:53,311 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731078509] [2019-11-15 21:24:53,311 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:53,311 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:53,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:58,508 INFO L134 CoverageAnalysis]: Checked inductivity of 5662 backedges. 4447 proven. 0 refuted. 0 times theorem prover too weak. 1215 trivial. 0 not checked. [2019-11-15 21:24:58,509 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731078509] [2019-11-15 21:24:58,509 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:24:58,510 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 21:24:58,510 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950352033] [2019-11-15 21:24:58,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:24:58,511 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:24:58,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:24:58,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:24:58,512 INFO L87 Difference]: Start difference. First operand 10883 states and 11216 transitions. Second operand 9 states. [2019-11-15 21:25:05,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:25:05,945 INFO L93 Difference]: Finished difference Result 29687 states and 30616 transitions. [2019-11-15 21:25:05,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:25:05,945 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1828 [2019-11-15 21:25:05,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:25:05,970 INFO L225 Difference]: With dead ends: 29687 [2019-11-15 21:25:05,970 INFO L226 Difference]: Without dead ends: 19135 [2019-11-15 21:25:05,984 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-11-15 21:25:06,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19135 states. [2019-11-15 21:25:06,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19135 to 10883. [2019-11-15 21:25:06,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10883 states. [2019-11-15 21:25:06,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10883 states to 10883 states and 11202 transitions. [2019-11-15 21:25:06,152 INFO L78 Accepts]: Start accepts. Automaton has 10883 states and 11202 transitions. Word has length 1828 [2019-11-15 21:25:06,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:25:06,155 INFO L462 AbstractCegarLoop]: Abstraction has 10883 states and 11202 transitions. [2019-11-15 21:25:06,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:25:06,155 INFO L276 IsEmpty]: Start isEmpty. Operand 10883 states and 11202 transitions. [2019-11-15 21:25:06,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1833 [2019-11-15 21:25:06,194 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:25:06,195 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-11-15 21:25:06,195 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:25:06,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:25:06,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1515186063, now seen corresponding path program 1 times [2019-11-15 21:25:06,197 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:25:06,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917778247] [2019-11-15 21:25:06,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:06,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:06,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:25:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:25:08,564 INFO L134 CoverageAnalysis]: Checked inductivity of 6644 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 6285 trivial. 0 not checked. [2019-11-15 21:25:08,564 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917778247] [2019-11-15 21:25:08,565 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:25:08,565 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:25:08,565 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182406153] [2019-11-15 21:25:08,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:25:08,567 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:25:08,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:25:08,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:25:08,567 INFO L87 Difference]: Start difference. First operand 10883 states and 11202 transitions. Second operand 4 states. [2019-11-15 21:25:10,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:25:10,030 INFO L93 Difference]: Finished difference Result 22093 states and 22731 transitions. [2019-11-15 21:25:10,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:25:10,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1832 [2019-11-15 21:25:10,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:25:10,047 INFO L225 Difference]: With dead ends: 22093 [2019-11-15 21:25:10,047 INFO L226 Difference]: Without dead ends: 10883 [2019-11-15 21:25:10,055 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-15 21:25:10,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10883 states. [2019-11-15 21:25:10,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10883 to 10883. [2019-11-15 21:25:10,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10883 states. [2019-11-15 21:25:10,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10883 states to 10883 states and 11131 transitions. [2019-11-15 21:25:10,169 INFO L78 Accepts]: Start accepts. Automaton has 10883 states and 11131 transitions. Word has length 1832 [2019-11-15 21:25:10,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:25:10,170 INFO L462 AbstractCegarLoop]: Abstraction has 10883 states and 11131 transitions. [2019-11-15 21:25:10,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:25:10,171 INFO L276 IsEmpty]: Start isEmpty. Operand 10883 states and 11131 transitions. [2019-11-15 21:25:10,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1990 [2019-11-15 21:25:10,221 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:25:10,222 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:25:10,222 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:25:10,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:25:10,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1621777748, now seen corresponding path program 1 times [2019-11-15 21:25:10,224 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:25:10,224 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442314412] [2019-11-15 21:25:10,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:10,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:10,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:25:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:25:13,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6963 backedges. 4615 proven. 186 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2019-11-15 21:25:13,797 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442314412] [2019-11-15 21:25:13,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632114785] [2019-11-15 21:25:13,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2fbee57-cf47-446f-beef-d6fb03639cc4/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:25:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:25:14,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 2268 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 21:25:14,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:25:17,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6963 backedges. 4646 proven. 0 refuted. 0 times theorem prover too weak. 2317 trivial. 0 not checked. [2019-11-15 21:25:17,826 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:25:17,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-11-15 21:25:17,827 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856486463] [2019-11-15 21:25:17,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:25:17,829 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:25:17,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:25:17,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:25:17,830 INFO L87 Difference]: Start difference. First operand 10883 states and 11131 transitions. Second operand 4 states. [2019-11-15 21:25:19,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:25:19,188 INFO L93 Difference]: Finished difference Result 21438 states and 21932 transitions. [2019-11-15 21:25:19,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:25:19,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1989 [2019-11-15 21:25:19,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:25:19,199 INFO L225 Difference]: With dead ends: 21438 [2019-11-15 21:25:19,200 INFO L226 Difference]: Without dead ends: 10886 [2019-11-15 21:25:19,206 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2003 GetRequests, 1991 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:25:19,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10886 states. [2019-11-15 21:25:19,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10886 to 10203. [2019-11-15 21:25:19,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10203 states. [2019-11-15 21:25:19,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10203 states to 10203 states and 10425 transitions. [2019-11-15 21:25:19,325 INFO L78 Accepts]: Start accepts. Automaton has 10203 states and 10425 transitions. Word has length 1989 [2019-11-15 21:25:19,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:25:19,326 INFO L462 AbstractCegarLoop]: Abstraction has 10203 states and 10425 transitions. [2019-11-15 21:25:19,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:25:19,327 INFO L276 IsEmpty]: Start isEmpty. Operand 10203 states and 10425 transitions. [2019-11-15 21:25:19,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2076 [2019-11-15 21:25:19,368 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:25:19,369 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:25:19,574 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:25:19,574 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:25:19,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:25:19,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1522743548, now seen corresponding path program 1 times [2019-11-15 21:25:19,575 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:25:19,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875384042] [2019-11-15 21:25:19,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:19,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:19,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:25:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:25:28,473 INFO L134 CoverageAnalysis]: Checked inductivity of 7671 backedges. 2975 proven. 1949 refuted. 0 times theorem prover too weak. 2747 trivial. 0 not checked. [2019-11-15 21:25:28,473 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875384042] [2019-11-15 21:25:28,473 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47326071] [2019-11-15 21:25:28,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2fbee57-cf47-446f-beef-d6fb03639cc4/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:25:28,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:25:28,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 2393 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:25:28,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:25:31,069 INFO L134 CoverageAnalysis]: Checked inductivity of 7671 backedges. 4321 proven. 0 refuted. 0 times theorem prover too weak. 3350 trivial. 0 not checked. [2019-11-15 21:25:31,069 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:25:31,071 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [14] total 16 [2019-11-15 21:25:31,071 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653868767] [2019-11-15 21:25:31,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:25:31,072 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:25:31,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:25:31,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-11-15 21:25:31,072 INFO L87 Difference]: Start difference. First operand 10203 states and 10425 transitions. Second operand 3 states. [2019-11-15 21:25:32,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:25:32,019 INFO L93 Difference]: Finished difference Result 20733 states and 21186 transitions. [2019-11-15 21:25:32,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:25:32,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2075 [2019-11-15 21:25:32,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:25:32,046 INFO L225 Difference]: With dead ends: 20733 [2019-11-15 21:25:32,046 INFO L226 Difference]: Without dead ends: 10861 [2019-11-15 21:25:32,051 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2098 GetRequests, 2076 SyntacticMatches, 8 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-11-15 21:25:32,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10861 states. [2019-11-15 21:25:32,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10861 to 10861. [2019-11-15 21:25:32,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10861 states. [2019-11-15 21:25:32,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10861 states to 10861 states and 11087 transitions. [2019-11-15 21:25:32,179 INFO L78 Accepts]: Start accepts. Automaton has 10861 states and 11087 transitions. Word has length 2075 [2019-11-15 21:25:32,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:25:32,180 INFO L462 AbstractCegarLoop]: Abstraction has 10861 states and 11087 transitions. [2019-11-15 21:25:32,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:25:32,181 INFO L276 IsEmpty]: Start isEmpty. Operand 10861 states and 11087 transitions. [2019-11-15 21:25:32,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2160 [2019-11-15 21:25:32,226 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:25:32,228 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:25:32,432 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:25:32,433 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:25:32,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:25:32,433 INFO L82 PathProgramCache]: Analyzing trace with hash 958669163, now seen corresponding path program 1 times [2019-11-15 21:25:32,434 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:25:32,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947024007] [2019-11-15 21:25:32,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:32,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:32,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:25:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:25:43,581 INFO L134 CoverageAnalysis]: Checked inductivity of 8787 backedges. 3342 proven. 2973 refuted. 0 times theorem prover too weak. 2472 trivial. 0 not checked. [2019-11-15 21:25:43,581 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947024007] [2019-11-15 21:25:43,581 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358655440] [2019-11-15 21:25:43,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2fbee57-cf47-446f-beef-d6fb03639cc4/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:25:44,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:25:44,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 2487 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 21:25:44,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:25:44,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:25:44,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:25:44,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:25:44,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:25:44,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:25:44,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:25:44,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:25:44,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:25:44,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:25:44,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:25:44,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:25:44,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:25:44,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:25:44,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:25:44,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:25:44,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:25:44,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:25:44,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:25:44,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:25:44,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:25:44,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:25:44,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:25:44,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:25:44,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:25:44,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:25:44,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:25:47,500 INFO L134 CoverageAnalysis]: Checked inductivity of 8787 backedges. 4964 proven. 0 refuted. 0 times theorem prover too weak. 3823 trivial. 0 not checked. [2019-11-15 21:25:47,500 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:25:47,501 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [18] total 20 [2019-11-15 21:25:47,502 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392773401] [2019-11-15 21:25:47,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:25:47,504 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:25:47,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:25:47,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2019-11-15 21:25:47,504 INFO L87 Difference]: Start difference. First operand 10861 states and 11087 transitions. Second operand 3 states. [2019-11-15 21:25:49,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:25:49,000 INFO L93 Difference]: Finished difference Result 23694 states and 24208 transitions. [2019-11-15 21:25:49,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:25:49,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2159 [2019-11-15 21:25:49,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:25:49,011 INFO L225 Difference]: With dead ends: 23694 [2019-11-15 21:25:49,011 INFO L226 Difference]: Without dead ends: 13164 [2019-11-15 21:25:49,017 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2181 GetRequests, 2159 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2019-11-15 21:25:49,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2019-11-15 21:25:49,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 12835. [2019-11-15 21:25:49,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12835 states. [2019-11-15 21:25:49,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12835 states to 12835 states and 13095 transitions. [2019-11-15 21:25:49,151 INFO L78 Accepts]: Start accepts. Automaton has 12835 states and 13095 transitions. Word has length 2159 [2019-11-15 21:25:49,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:25:49,152 INFO L462 AbstractCegarLoop]: Abstraction has 12835 states and 13095 transitions. [2019-11-15 21:25:49,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:25:49,152 INFO L276 IsEmpty]: Start isEmpty. Operand 12835 states and 13095 transitions. [2019-11-15 21:25:49,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2212 [2019-11-15 21:25:49,191 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:25:49,192 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:25:49,393 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:25:49,393 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:25:49,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:25:49,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1613825995, now seen corresponding path program 1 times [2019-11-15 21:25:49,394 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:25:49,394 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478323062] [2019-11-15 21:25:49,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:49,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:49,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:25:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:25:52,281 INFO L134 CoverageAnalysis]: Checked inductivity of 9605 backedges. 5637 proven. 0 refuted. 0 times theorem prover too weak. 3968 trivial. 0 not checked. [2019-11-15 21:25:52,282 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478323062] [2019-11-15 21:25:52,282 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:25:52,282 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:25:52,283 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117543800] [2019-11-15 21:25:52,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:25:52,284 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:25:52,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:25:52,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:25:52,285 INFO L87 Difference]: Start difference. First operand 12835 states and 13095 transitions. Second operand 3 states. [2019-11-15 21:25:53,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:25:53,418 INFO L93 Difference]: Finished difference Result 30274 states and 30904 transitions. [2019-11-15 21:25:53,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:25:53,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2211 [2019-11-15 21:25:53,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:25:53,443 INFO L225 Difference]: With dead ends: 30274 [2019-11-15 21:25:53,444 INFO L226 Difference]: Without dead ends: 17770 [2019-11-15 21:25:53,452 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-15 21:25:53,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17770 states. [2019-11-15 21:25:53,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17770 to 15796. [2019-11-15 21:25:53,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15796 states. [2019-11-15 21:25:53,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15796 states to 15796 states and 16116 transitions. [2019-11-15 21:25:53,599 INFO L78 Accepts]: Start accepts. Automaton has 15796 states and 16116 transitions. Word has length 2211 [2019-11-15 21:25:53,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:25:53,600 INFO L462 AbstractCegarLoop]: Abstraction has 15796 states and 16116 transitions. [2019-11-15 21:25:53,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:25:53,600 INFO L276 IsEmpty]: Start isEmpty. Operand 15796 states and 16116 transitions. [2019-11-15 21:25:53,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2253 [2019-11-15 21:25:53,645 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:25:53,647 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:25:53,647 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:25:53,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:25:53,648 INFO L82 PathProgramCache]: Analyzing trace with hash -834045833, now seen corresponding path program 1 times [2019-11-15 21:25:53,648 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:25:53,648 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732316831] [2019-11-15 21:25:53,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:53,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:53,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:25:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:05,858 INFO L134 CoverageAnalysis]: Checked inductivity of 9455 backedges. 3555 proven. 3159 refuted. 0 times theorem prover too weak. 2741 trivial. 0 not checked. [2019-11-15 21:26:05,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732316831] [2019-11-15 21:26:05,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461216548] [2019-11-15 21:26:05,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2fbee57-cf47-446f-beef-d6fb03639cc4/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:26:06,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:06,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 2580 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:26:06,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:26:06,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:26:08,910 INFO L134 CoverageAnalysis]: Checked inductivity of 9455 backedges. 431 proven. 0 refuted. 0 times theorem prover too weak. 9024 trivial. 0 not checked. [2019-11-15 21:26:08,911 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:26:08,912 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [18] total 20 [2019-11-15 21:26:08,912 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130309925] [2019-11-15 21:26:08,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:26:08,913 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:08,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:26:08,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2019-11-15 21:26:08,913 INFO L87 Difference]: Start difference. First operand 15796 states and 16116 transitions. Second operand 3 states. [2019-11-15 21:26:10,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:10,578 INFO L93 Difference]: Finished difference Result 32575 states and 33255 transitions. [2019-11-15 21:26:10,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:26:10,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2252 [2019-11-15 21:26:10,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:10,583 INFO L225 Difference]: With dead ends: 32575 [2019-11-15 21:26:10,583 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 21:26:10,593 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2274 GetRequests, 2252 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2019-11-15 21:26:10,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 21:26:10,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 21:26:10,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 21:26:10,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 21:26:10,594 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2252 [2019-11-15 21:26:10,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:10,595 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:26:10,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:26:10,596 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:26:10,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 21:26:10,801 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:26:10,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 21:26:11,104 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 310 DAG size of output: 191 [2019-11-15 21:26:11,446 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 310 DAG size of output: 191 [2019-11-15 21:26:12,695 WARN L191 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 172 DAG size of output: 91 [2019-11-15 21:26:13,435 WARN L191 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 89 [2019-11-15 21:26:14,504 WARN L191 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 172 DAG size of output: 91 [2019-11-15 21:26:14,505 INFO L443 ceAbstractionStarter]: For program point L894(lines 894 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,505 INFO L443 ceAbstractionStarter]: For program point L828(lines 828 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,506 INFO L443 ceAbstractionStarter]: For program point L696(lines 696 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,506 INFO L443 ceAbstractionStarter]: For program point L1687(lines 1687 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,506 INFO L443 ceAbstractionStarter]: For program point L1291(lines 1291 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,506 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,506 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,506 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,506 INFO L443 ceAbstractionStarter]: For program point L961(lines 961 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,506 INFO L443 ceAbstractionStarter]: For program point L763(lines 763 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,506 INFO L443 ceAbstractionStarter]: For program point L631(lines 631 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,506 INFO L443 ceAbstractionStarter]: For program point L1622(lines 1622 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,506 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,506 INFO L443 ceAbstractionStarter]: For program point L1358(lines 1358 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,506 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,506 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-15 21:26:14,506 INFO L443 ceAbstractionStarter]: For program point L1160(lines 1160 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,507 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-15 21:26:14,507 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-15 21:26:14,507 INFO L439 ceAbstractionStarter]: At program point L1491(lines 23 1492) the Hoare annotation is: (let ((.cse6 (= ~a12~0 5)) (.cse15 (= ~a12~0 8)) (.cse11 (= ~a16~0 9)) (.cse2 (= 3 ~a15~0)) (.cse13 (<= (+ ~a18~0 79) 0)) (.cse4 (< 0 (+ ~a18~0 156)))) (let ((.cse3 (or (not .cse11) (and .cse2 .cse13 .cse4))) (.cse5 (not (= 12 ~a16~0))) (.cse12 (not .cse15)) (.cse1 (= ~a15~0 4)) (.cse7 (not (= 1 ULTIMATE.start_calculate_output_~input))) (.cse0 (= ~a16~0 8)) (.cse14 (not .cse6))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse1 .cse5 .cse6 .cse7 (<= (+ ~a18~0 391209) 0)) (and .cse1 .cse5 (= ~a12~0 6)) (and (exists ((v_~a18~0_901 Int)) (let ((.cse9 (div (* v_~a18~0_901 10) (- 5)))) (let ((.cse8 (* 5 .cse9))) (and (<= (+ v_~a18~0_901 79) 0) (<= 5 .cse8) (<= (div (* .cse9 5) 5) ~a18~0) (<= 0 .cse8))))) (and .cse1 .cse5 .cse6 .cse3)) (and .cse2 (exists ((v_~a18~0_903 Int)) (let ((.cse10 (mod v_~a18~0_903 299932))) (and (not (= .cse10 0)) (< v_~a18~0_903 0) (<= (+ .cse10 134) ~a18~0))))) (and .cse1 .cse11 (= ~a12~0 7)) (and .cse1 (not (= ~a12~0 9)) .cse5 .cse3 .cse12 .cse13) (and .cse1 (<= ~a12~0 6) .cse5 .cse7 .cse13 .cse4) (and .cse1 .cse11 .cse14 .cse12 .cse13) (and (or (and .cse1 .cse11 .cse4) (and .cse1 .cse11 (not (= 1 ULTIMATE.start_calculate_output2_~input)) .cse7)) .cse15) (and .cse0 .cse2) (and .cse14 .cse2)))) [2019-11-15 21:26:14,507 INFO L443 ceAbstractionStarter]: For program point L434(lines 434 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,507 INFO L443 ceAbstractionStarter]: For program point L1227(lines 1227 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,507 INFO L443 ceAbstractionStarter]: For program point L567(lines 567 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,507 INFO L443 ceAbstractionStarter]: For program point L501(lines 501 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,507 INFO L443 ceAbstractionStarter]: For program point L303(lines 303 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,508 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,508 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,508 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,508 INFO L443 ceAbstractionStarter]: For program point L1757(lines 1757 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,508 INFO L443 ceAbstractionStarter]: For program point L1559(lines 1559 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,508 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-15 21:26:14,508 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-15 21:26:14,508 INFO L443 ceAbstractionStarter]: For program point L1097(lines 1097 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,508 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-15 21:26:14,508 INFO L443 ceAbstractionStarter]: For program point L1031(lines 1031 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,508 INFO L443 ceAbstractionStarter]: For program point L899(lines 899 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,508 INFO L443 ceAbstractionStarter]: For program point L1428(lines 1428 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,508 INFO L443 ceAbstractionStarter]: For program point L834(lines 834 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,508 INFO L443 ceAbstractionStarter]: For program point L1693(lines 1693 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,509 INFO L443 ceAbstractionStarter]: For program point L636(lines 636 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,509 INFO L443 ceAbstractionStarter]: For program point L1297(lines 1297 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,509 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,509 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,509 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,509 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,509 INFO L443 ceAbstractionStarter]: For program point L967(lines 967 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,509 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,509 INFO L443 ceAbstractionStarter]: For program point L703(lines 703 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,509 INFO L443 ceAbstractionStarter]: For program point L1628(lines 1628 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,509 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,509 INFO L443 ceAbstractionStarter]: For program point L1364(lines 1364 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,509 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-15 21:26:14,510 INFO L443 ceAbstractionStarter]: For program point L1166(lines 1166 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,510 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-15 21:26:14,510 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-15 21:26:14,510 INFO L443 ceAbstractionStarter]: For program point L1497(lines 1497 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,510 INFO L443 ceAbstractionStarter]: For program point L440(lines 440 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,510 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,510 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,510 INFO L443 ceAbstractionStarter]: For program point L1234(lines 1234 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,510 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,510 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,510 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,510 INFO L443 ceAbstractionStarter]: For program point L1036(lines 1036 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,510 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,510 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,511 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-15 21:26:14,511 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-15 21:26:14,511 INFO L443 ceAbstractionStarter]: For program point L1103(lines 1103 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,511 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-15 21:26:14,511 INFO L443 ceAbstractionStarter]: For program point L905(lines 905 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,511 INFO L439 ceAbstractionStarter]: At program point L1764(lines 1494 1765) the Hoare annotation is: (let ((.cse5 (= ~a16~0 9)) (.cse7 (= ~a12~0 8)) (.cse15 (= ~a12~0 5))) (let ((.cse4 (not .cse15)) (.cse11 (<= ~a12~0 6)) (.cse6 (not (= 1 ULTIMATE.start_calculate_output2_~input))) (.cse8 (not (= 1 ULTIMATE.start_calculate_output_~input))) (.cse9 (< 0 (+ ~a18~0 156))) (.cse13 (<= (+ ~a18~0 79) 0)) (.cse14 (not .cse7)) (.cse0 (= 3 ~a15~0)) (.cse10 (not .cse5)) (.cse12 (not (= 12 ~a16~0))) (.cse2 (= ~a16~0 8)) (.cse3 (= ~a15~0 4))) (or (and .cse0 (exists ((v_~a18~0_903 Int)) (let ((.cse1 (mod v_~a18~0_903 299932))) (and (not (= .cse1 0)) (< v_~a18~0_903 0) (<= (+ .cse1 134) ~a18~0))))) (and .cse2 .cse3 .cse4) (and .cse3 .cse5 .cse6 .cse7 (or .cse8 .cse9)) (and .cse4 .cse0) (and .cse10 .cse0 .cse9) (and .cse3 .cse5 (= ~a12~0 7)) (and .cse3 .cse11 .cse6 .cse12 .cse8 (<= (+ ~a18~0 391209) 0)) (and .cse3 .cse5 .cse4 .cse13 .cse14) (and .cse3 .cse11 .cse6 .cse12 .cse8 .cse13 .cse9) (and .cse3 (not (= ~a12~0 9)) .cse10 .cse12 .cse13 .cse14) (and .cse3 .cse12 (= ~a12~0 6)) (and .cse2 .cse0) (and .cse3 .cse10 .cse12 .cse15 (exists ((v_~a18~0_901 Int)) (let ((.cse17 (div (* v_~a18~0_901 10) (- 5)))) (let ((.cse16 (* 5 .cse17))) (and (<= (+ v_~a18~0_901 79) 0) (<= 5 .cse16) (<= (div (* .cse17 5) 5) ~a18~0) (<= 0 .cse16)))))) (and .cse2 .cse3 (not (= 3 ULTIMATE.start_calculate_output_~input)))))) [2019-11-15 21:26:14,511 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,511 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,511 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,511 INFO L443 ceAbstractionStarter]: For program point L1434(lines 1434 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,512 INFO L443 ceAbstractionStarter]: For program point L840(lines 840 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,512 INFO L443 ceAbstractionStarter]: For program point L1699(lines 1699 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,512 INFO L443 ceAbstractionStarter]: For program point L1633(lines 1633 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,512 INFO L443 ceAbstractionStarter]: For program point L1303(lines 1303 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,512 INFO L443 ceAbstractionStarter]: For program point L246(lines 246 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,512 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,512 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,512 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,512 INFO L443 ceAbstractionStarter]: For program point L775(lines 775 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,512 INFO L443 ceAbstractionStarter]: For program point L1370(lines 1370 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,512 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-15 21:26:14,512 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,512 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-15 21:26:14,513 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-15 21:26:14,513 INFO L443 ceAbstractionStarter]: For program point L974(lines 974 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,513 INFO L446 ceAbstractionStarter]: At program point L1767(lines 1767 1783) the Hoare annotation is: true [2019-11-15 21:26:14,513 INFO L443 ceAbstractionStarter]: For program point L578(lines 578 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,513 INFO L443 ceAbstractionStarter]: For program point L1503(lines 1503 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,513 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,513 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,513 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,513 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,513 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,513 INFO L443 ceAbstractionStarter]: For program point L1042(lines 1042 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,513 INFO L443 ceAbstractionStarter]: For program point L778(lines 778 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,513 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,513 INFO L443 ceAbstractionStarter]: For program point L1241(lines 1241 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,514 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-15 21:26:14,514 INFO L443 ceAbstractionStarter]: For program point L1175(lines 1175 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,514 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-15 21:26:14,514 INFO L443 ceAbstractionStarter]: For program point L1109(lines 1109 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,514 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-15 21:26:14,514 INFO L443 ceAbstractionStarter]: For program point L1704(lines 1704 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,514 INFO L443 ceAbstractionStarter]: For program point L1638(lines 1638 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,515 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,515 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,515 INFO L443 ceAbstractionStarter]: For program point L1440(lines 1440 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,515 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,515 INFO L443 ceAbstractionStarter]: For program point L846(lines 846 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,515 INFO L443 ceAbstractionStarter]: For program point L648(lines 648 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,515 INFO L443 ceAbstractionStarter]: For program point L1573(lines 1573 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,515 INFO L443 ceAbstractionStarter]: For program point L1375(lines 1375 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,515 INFO L443 ceAbstractionStarter]: For program point L1309(lines 1309 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,515 INFO L443 ceAbstractionStarter]: For program point L252(lines 252 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,516 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,516 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,516 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,516 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,516 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-15 21:26:14,516 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-15 21:26:14,516 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-15 21:26:14,517 INFO L439 ceAbstractionStarter]: At program point L1773-2(lines 1773 1782) the Hoare annotation is: (let ((.cse6 (= ~a12~0 5)) (.cse15 (= ~a12~0 8)) (.cse11 (= ~a16~0 9)) (.cse2 (= 3 ~a15~0)) (.cse13 (<= (+ ~a18~0 79) 0)) (.cse4 (< 0 (+ ~a18~0 156)))) (let ((.cse3 (or (not .cse11) (and .cse2 .cse13 .cse4))) (.cse5 (not (= 12 ~a16~0))) (.cse12 (not .cse15)) (.cse1 (= ~a15~0 4)) (.cse7 (not (= 1 ULTIMATE.start_calculate_output_~input))) (.cse0 (= ~a16~0 8)) (.cse14 (not .cse6))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse1 .cse5 .cse6 .cse7 (<= (+ ~a18~0 391209) 0)) (and .cse1 .cse5 (= ~a12~0 6)) (and (exists ((v_~a18~0_901 Int)) (let ((.cse9 (div (* v_~a18~0_901 10) (- 5)))) (let ((.cse8 (* 5 .cse9))) (and (<= (+ v_~a18~0_901 79) 0) (<= 5 .cse8) (<= (div (* .cse9 5) 5) ~a18~0) (<= 0 .cse8))))) (and .cse1 .cse5 .cse6 .cse3)) (and .cse2 (exists ((v_~a18~0_903 Int)) (let ((.cse10 (mod v_~a18~0_903 299932))) (and (not (= .cse10 0)) (< v_~a18~0_903 0) (<= (+ .cse10 134) ~a18~0))))) (and .cse1 .cse11 (= ~a12~0 7)) (and .cse1 (not (= ~a12~0 9)) .cse5 .cse3 .cse12 .cse13) (and .cse1 (<= ~a12~0 6) .cse5 .cse7 .cse13 .cse4) (and .cse1 .cse11 .cse14 .cse12 .cse13) (and (or (and .cse1 .cse11 .cse4) (and .cse1 .cse11 (not (= 1 ULTIMATE.start_calculate_output2_~input)) .cse7)) .cse15) (and .cse0 .cse2) (and .cse14 .cse2)))) [2019-11-15 21:26:14,517 INFO L443 ceAbstractionStarter]: For program point L584(lines 584 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,517 INFO L443 ceAbstractionStarter]: For program point L386(lines 386 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,517 INFO L443 ceAbstractionStarter]: For program point L717(lines 717 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,517 INFO L443 ceAbstractionStarter]: For program point L1510(lines 1510 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,517 INFO L443 ceAbstractionStarter]: For program point L321(lines 321 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,517 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,517 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,518 INFO L443 ceAbstractionStarter]: For program point L1114(lines 1114 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,518 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,518 INFO L443 ceAbstractionStarter]: For program point L1048(lines 1048 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,518 INFO L443 ceAbstractionStarter]: For program point L784(lines 784 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,518 INFO L443 ceAbstractionStarter]: For program point L1709(lines 1709 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,518 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,518 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 21:26:14,518 INFO L443 ceAbstractionStarter]: For program point L1247(lines 1247 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,518 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-15 21:26:14,518 INFO L443 ceAbstractionStarter]: For program point L1181(lines 1181 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,519 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-15 21:26:14,519 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-15 21:26:14,519 INFO L443 ceAbstractionStarter]: For program point L917(lines 917 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,519 INFO L443 ceAbstractionStarter]: For program point L851(lines 851 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,519 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,519 INFO L443 ceAbstractionStarter]: For program point L1446(lines 1446 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,519 INFO L443 ceAbstractionStarter]: For program point L1314(lines 1314 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,519 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,519 INFO L443 ceAbstractionStarter]: For program point L1645(lines 1645 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,519 INFO L443 ceAbstractionStarter]: For program point L1579(lines 1579 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,519 INFO L443 ceAbstractionStarter]: For program point L1381(lines 1381 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,519 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,520 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,520 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,520 INFO L443 ceAbstractionStarter]: For program point L1778(line 1778) no Hoare annotation was computed. [2019-11-15 21:26:14,520 INFO L443 ceAbstractionStarter]: For program point L655(lines 655 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,520 INFO L443 ceAbstractionStarter]: For program point L589(lines 589 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,520 INFO L443 ceAbstractionStarter]: For program point L457(lines 457 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,520 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,520 INFO L443 ceAbstractionStarter]: For program point L1250(lines 1250 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,520 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-15 21:26:14,521 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-15 21:26:14,521 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-15 21:26:14,521 INFO L443 ceAbstractionStarter]: For program point L986(lines 986 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,521 INFO L443 ceAbstractionStarter]: For program point L1515(lines 1515 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,521 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,521 INFO L443 ceAbstractionStarter]: For program point L789(lines 789 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,521 INFO L443 ceAbstractionStarter]: For program point L723(lines 723 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,521 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,521 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,521 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,521 INFO L443 ceAbstractionStarter]: For program point L1120(lines 1120 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,522 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,522 INFO L443 ceAbstractionStarter]: For program point L922(lines 922 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,522 INFO L443 ceAbstractionStarter]: For program point L1715(lines 1715 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,522 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,522 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-15 21:26:14,522 INFO L443 ceAbstractionStarter]: For program point L1187(lines 1187 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,522 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-15 21:26:14,522 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-15 21:26:14,522 INFO L443 ceAbstractionStarter]: For program point L1055(lines 1055 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,522 INFO L443 ceAbstractionStarter]: For program point L857(lines 857 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,522 INFO L443 ceAbstractionStarter]: For program point L527(lines 527 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,522 INFO L443 ceAbstractionStarter]: For program point L1386(lines 1386 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,522 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 21:26:14,522 INFO L443 ceAbstractionStarter]: For program point L1651(lines 1651 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,523 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,523 INFO L443 ceAbstractionStarter]: For program point L1585(lines 1585 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,523 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,523 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,523 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,523 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,523 INFO L443 ceAbstractionStarter]: For program point L661(lines 661 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,524 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,524 INFO L443 ceAbstractionStarter]: For program point L1256(lines 1256 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,524 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-15 21:26:14,524 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-15 21:26:14,524 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-15 21:26:14,524 INFO L443 ceAbstractionStarter]: For program point L728(lines 728 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,525 INFO L443 ceAbstractionStarter]: For program point L1521(lines 1521 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,525 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,525 INFO L443 ceAbstractionStarter]: For program point L1125(lines 1125 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,525 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,525 INFO L443 ceAbstractionStarter]: For program point L1456(lines 1456 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,525 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,525 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,525 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,525 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,525 INFO L443 ceAbstractionStarter]: For program point L796(lines 796 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,525 INFO L443 ceAbstractionStarter]: For program point L1721(lines 1721 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,525 INFO L443 ceAbstractionStarter]: For program point L664(lines 664 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,526 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,526 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-15 21:26:14,526 INFO L443 ceAbstractionStarter]: For program point L1193(lines 1193 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,526 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-15 21:26:14,526 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-15 21:26:14,526 INFO L443 ceAbstractionStarter]: For program point L1061(lines 1061 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,526 INFO L443 ceAbstractionStarter]: For program point L929(lines 929 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,526 INFO L443 ceAbstractionStarter]: For program point L863(lines 863 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,526 INFO L443 ceAbstractionStarter]: For program point L1656(lines 1656 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,526 INFO L443 ceAbstractionStarter]: For program point L533(lines 533 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,526 INFO L443 ceAbstractionStarter]: For program point L1392(lines 1392 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,526 INFO L443 ceAbstractionStarter]: For program point L600(lines 600 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,526 INFO L443 ceAbstractionStarter]: For program point L1591(lines 1591 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,526 INFO L443 ceAbstractionStarter]: For program point L1327(lines 1327 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,527 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,527 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,527 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,527 INFO L443 ceAbstractionStarter]: For program point L469(lines 469 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,527 INFO L443 ceAbstractionStarter]: For program point L1262(lines 1262 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,527 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-11-15 21:26:14,527 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-15 21:26:14,527 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-15 21:26:14,527 INFO L443 ceAbstractionStarter]: For program point L734(lines 734 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,527 INFO L443 ceAbstractionStarter]: For program point L1527(lines 1527 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,527 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,527 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,527 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,528 INFO L443 ceAbstractionStarter]: For program point L1131(lines 1131 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,528 INFO L443 ceAbstractionStarter]: For program point L999(lines 999 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,528 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,528 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,528 INFO L443 ceAbstractionStarter]: For program point L802(lines 802 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,528 INFO L443 ceAbstractionStarter]: For program point L1727(lines 1727 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,528 INFO L443 ceAbstractionStarter]: For program point L670(lines 670 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,529 INFO L443 ceAbstractionStarter]: For program point L538(lines 538 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,529 INFO L443 ceAbstractionStarter]: For program point L1397(lines 1397 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,529 INFO L443 ceAbstractionStarter]: For program point L274(lines 274 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,529 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-15 21:26:14,529 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-15 21:26:14,530 INFO L443 ceAbstractionStarter]: For program point L1067(lines 1067 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,530 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,530 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,530 INFO L443 ceAbstractionStarter]: For program point L1200(lines 1200 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,530 INFO L443 ceAbstractionStarter]: For program point L1663(lines 1663 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,530 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,530 INFO L443 ceAbstractionStarter]: For program point L1597(lines 1597 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,531 INFO L443 ceAbstractionStarter]: For program point L1267(lines 1267 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,531 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,531 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,531 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,531 INFO L443 ceAbstractionStarter]: For program point L1334(lines 1334 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,531 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-15 21:26:14,532 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-15 21:26:14,532 INFO L443 ceAbstractionStarter]: For program point L476(lines 476 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,532 INFO L443 ceAbstractionStarter]: For program point L1137(lines 1137 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,532 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,532 INFO L443 ceAbstractionStarter]: For program point L741(lines 741 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,532 INFO L443 ceAbstractionStarter]: For program point L543(lines 543 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,532 INFO L443 ceAbstractionStarter]: For program point L1534(lines 1534 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,533 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,533 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,533 INFO L443 ceAbstractionStarter]: For program point L279(lines 279 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,533 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,533 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,533 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,533 INFO L443 ceAbstractionStarter]: For program point L808(lines 808 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,533 INFO L443 ceAbstractionStarter]: For program point L1733(lines 1733 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,533 INFO L443 ceAbstractionStarter]: For program point L1403(lines 1403 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,533 INFO L443 ceAbstractionStarter]: For program point L1205(lines 1205 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,533 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-15 21:26:14,533 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-15 21:26:14,533 INFO L443 ceAbstractionStarter]: For program point L1073(lines 1073 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,533 INFO L443 ceAbstractionStarter]: For program point L875(lines 875 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,534 INFO L443 ceAbstractionStarter]: For program point L677(lines 677 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,534 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,534 INFO L443 ceAbstractionStarter]: For program point L1669(lines 1669 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,534 INFO L443 ceAbstractionStarter]: For program point L612(lines 612 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,534 INFO L443 ceAbstractionStarter]: For program point L1603(lines 1603 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,534 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,534 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,534 INFO L443 ceAbstractionStarter]: For program point L1472(lines 1472 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,534 INFO L443 ceAbstractionStarter]: For program point L1274(lines 1274 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,534 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-15 21:26:14,534 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-15 21:26:14,534 INFO L443 ceAbstractionStarter]: For program point L746(lines 746 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,534 INFO L443 ceAbstractionStarter]: For program point L680(lines 680 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,534 INFO L443 ceAbstractionStarter]: For program point L548(lines 548 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,535 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,535 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 21:26:14,535 INFO L443 ceAbstractionStarter]: For program point L1341(lines 1341 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,535 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,535 INFO L443 ceAbstractionStarter]: For program point L1143(lines 1143 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,535 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,535 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2019-11-15 21:26:14,535 INFO L443 ceAbstractionStarter]: For program point L1540(lines 1540 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,535 INFO L443 ceAbstractionStarter]: For program point L483(lines 483 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,535 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,535 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,535 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,535 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,536 INFO L443 ceAbstractionStarter]: For program point L1739(lines 1739 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,536 INFO L443 ceAbstractionStarter]: For program point L1409(lines 1409 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,536 INFO L443 ceAbstractionStarter]: For program point L1211(lines 1211 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,536 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-15 21:26:14,536 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-15 21:26:14,536 INFO L443 ceAbstractionStarter]: For program point L1079(lines 1079 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,536 INFO L443 ceAbstractionStarter]: For program point L815(lines 815 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,536 INFO L443 ceAbstractionStarter]: For program point L948(lines 948 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,536 INFO L443 ceAbstractionStarter]: For program point L882(lines 882 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,536 INFO L443 ceAbstractionStarter]: For program point L1675(lines 1675 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,536 INFO L443 ceAbstractionStarter]: For program point L618(lines 618 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,536 INFO L443 ceAbstractionStarter]: For program point L1609(lines 1609 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,536 INFO L443 ceAbstractionStarter]: For program point L1477(lines 1477 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,536 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,536 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,537 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-11-15 21:26:14,537 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,537 INFO L443 ceAbstractionStarter]: For program point L1280(lines 1280 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,537 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,537 INFO L443 ceAbstractionStarter]: For program point L1214(lines 1214 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,537 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-15 21:26:14,537 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-15 21:26:14,537 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-15 21:26:14,537 INFO L443 ceAbstractionStarter]: For program point L752(lines 752 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,537 INFO L443 ceAbstractionStarter]: For program point L686(lines 686 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,538 INFO L443 ceAbstractionStarter]: For program point L554(lines 554 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,538 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,538 INFO L443 ceAbstractionStarter]: For program point L1347(lines 1347 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,538 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,538 INFO L443 ceAbstractionStarter]: For program point L1149(lines 1149 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,538 INFO L443 ceAbstractionStarter]: For program point L1546(lines 1546 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,538 INFO L443 ceAbstractionStarter]: For program point L489(lines 489 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,538 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,538 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,538 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,539 INFO L443 ceAbstractionStarter]: For program point L1018(lines 1018 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,539 INFO L443 ceAbstractionStarter]: For program point L424(lines 424 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,539 INFO L443 ceAbstractionStarter]: For program point L1415(lines 1415 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,539 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-15 21:26:14,539 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-15 21:26:14,539 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 21:26:14,539 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-15 21:26:14,540 INFO L443 ceAbstractionStarter]: For program point L1746(lines 1746 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,540 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,540 INFO L443 ceAbstractionStarter]: For program point L954(lines 954 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,540 INFO L443 ceAbstractionStarter]: For program point L888(lines 888 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,540 INFO L443 ceAbstractionStarter]: For program point L822(lines 822 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,540 INFO L443 ceAbstractionStarter]: For program point L624(lines 624 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,540 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,541 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,541 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,541 INFO L443 ceAbstractionStarter]: For program point L691(lines 691 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,541 INFO L443 ceAbstractionStarter]: For program point L1682(lines 1682 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,541 INFO L443 ceAbstractionStarter]: For program point L1616(lines 1616 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,541 INFO L443 ceAbstractionStarter]: For program point L1484(lines 1484 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,541 INFO L443 ceAbstractionStarter]: For program point L427(lines 427 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,542 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,542 INFO L443 ceAbstractionStarter]: For program point L1286(lines 1286 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,542 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,542 INFO L443 ceAbstractionStarter]: For program point L1220(lines 1220 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,542 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-15 21:26:14,542 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-15 21:26:14,542 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-15 21:26:14,543 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,543 INFO L443 ceAbstractionStarter]: For program point L560(lines 560 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,543 INFO L443 ceAbstractionStarter]: For program point L1353(lines 1353 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,543 INFO L443 ceAbstractionStarter]: For program point L1155(lines 1155 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,543 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,543 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,543 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,543 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,543 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 21:26:14,543 INFO L443 ceAbstractionStarter]: For program point L1553(lines 1553 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,544 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-15 21:26:14,544 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-15 21:26:14,544 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-15 21:26:14,544 INFO L443 ceAbstractionStarter]: For program point L1025(lines 1025 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,544 INFO L443 ceAbstractionStarter]: For program point L1752(lines 1752 1763) no Hoare annotation was computed. [2019-11-15 21:26:14,544 INFO L443 ceAbstractionStarter]: For program point L1422(lines 1422 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,544 INFO L443 ceAbstractionStarter]: For program point L1092(lines 1092 1490) no Hoare annotation was computed. [2019-11-15 21:26:14,553 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,554 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,555 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,555 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,556 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-11-15 21:26:14,556 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-11-15 21:26:14,556 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-11-15 21:26:14,568 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,568 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,569 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,569 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,569 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-11-15 21:26:14,570 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-11-15 21:26:14,570 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-11-15 21:26:14,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-11-15 21:26:14,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-11-15 21:26:14,576 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-11-15 21:26:14,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,580 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-11-15 21:26:14,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-11-15 21:26:14,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-11-15 21:26:14,582 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,582 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,582 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,585 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,585 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,586 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,586 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,586 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-11-15 21:26:14,587 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-11-15 21:26:14,587 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-11-15 21:26:14,589 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,589 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,590 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,590 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,590 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-11-15 21:26:14,591 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-11-15 21:26:14,591 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-11-15 21:26:14,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:26:14 BoogieIcfgContainer [2019-11-15 21:26:14,594 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:26:14,595 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:26:14,595 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:26:14,596 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:26:14,596 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:24:05" (3/4) ... [2019-11-15 21:26:14,604 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 21:26:14,663 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-15 21:26:14,667 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 21:26:14,710 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((a16 == 8 && a15 == 4) || ((3 == a15 && (!(a16 == 9) || ((3 == a15 && a18 + 79 <= 0) && 0 < a18 + 156))) && 0 < a18 + 156)) || ((((a15 == 4 && !(12 == a16)) && a12 == 5) && !(1 == input)) && a18 + 391209 <= 0)) || ((a15 == 4 && !(12 == a16)) && a12 == 6)) || ((\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5)) && ((a15 == 4 && !(12 == a16)) && a12 == 5) && (!(a16 == 9) || ((3 == a15 && a18 + 79 <= 0) && 0 < a18 + 156)))) || (3 == a15 && (\exists v_~a18~0_903 : int :: (!(v_~a18~0_903 % 299932 == 0) && v_~a18~0_903 < 0) && v_~a18~0_903 % 299932 + 134 <= a18))) || ((a15 == 4 && a16 == 9) && a12 == 7)) || (((((a15 == 4 && !(a12 == 9)) && !(12 == a16)) && (!(a16 == 9) || ((3 == a15 && a18 + 79 <= 0) && 0 < a18 + 156))) && !(a12 == 8)) && a18 + 79 <= 0)) || (((((a15 == 4 && a12 <= 6) && !(12 == a16)) && !(1 == input)) && a18 + 79 <= 0) && 0 < a18 + 156)) || ((((a15 == 4 && a16 == 9) && !(a12 == 5)) && !(a12 == 8)) && a18 + 79 <= 0)) || ((((a15 == 4 && a16 == 9) && 0 < a18 + 156) || (((a15 == 4 && a16 == 9) && !(1 == input)) && !(1 == input))) && a12 == 8)) || (a16 == 8 && 3 == a15)) || (!(a12 == 5) && 3 == a15) [2019-11-15 21:26:14,715 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((a16 == 8 && a15 == 4) || ((3 == a15 && (!(a16 == 9) || ((3 == a15 && a18 + 79 <= 0) && 0 < a18 + 156))) && 0 < a18 + 156)) || ((((a15 == 4 && !(12 == a16)) && a12 == 5) && !(1 == input)) && a18 + 391209 <= 0)) || ((a15 == 4 && !(12 == a16)) && a12 == 6)) || ((\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5)) && ((a15 == 4 && !(12 == a16)) && a12 == 5) && (!(a16 == 9) || ((3 == a15 && a18 + 79 <= 0) && 0 < a18 + 156)))) || (3 == a15 && (\exists v_~a18~0_903 : int :: (!(v_~a18~0_903 % 299932 == 0) && v_~a18~0_903 < 0) && v_~a18~0_903 % 299932 + 134 <= a18))) || ((a15 == 4 && a16 == 9) && a12 == 7)) || (((((a15 == 4 && !(a12 == 9)) && !(12 == a16)) && (!(a16 == 9) || ((3 == a15 && a18 + 79 <= 0) && 0 < a18 + 156))) && !(a12 == 8)) && a18 + 79 <= 0)) || (((((a15 == 4 && a12 <= 6) && !(12 == a16)) && !(1 == input)) && a18 + 79 <= 0) && 0 < a18 + 156)) || ((((a15 == 4 && a16 == 9) && !(a12 == 5)) && !(a12 == 8)) && a18 + 79 <= 0)) || ((((a15 == 4 && a16 == 9) && 0 < a18 + 156) || (((a15 == 4 && a16 == 9) && !(1 == input)) && !(1 == input))) && a12 == 8)) || (a16 == 8 && 3 == a15)) || (!(a12 == 5) && 3 == a15) [2019-11-15 21:26:14,733 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((3 == a15 && (\exists v_~a18~0_903 : int :: (!(v_~a18~0_903 % 299932 == 0) && v_~a18~0_903 < 0) && v_~a18~0_903 % 299932 + 134 <= a18)) || ((a16 == 8 && a15 == 4) && !(a12 == 5))) || ((((a15 == 4 && a16 == 9) && !(1 == input)) && a12 == 8) && (!(1 == input) || 0 < a18 + 156))) || (!(a12 == 5) && 3 == a15)) || ((!(a16 == 9) && 3 == a15) && 0 < a18 + 156)) || ((a15 == 4 && a16 == 9) && a12 == 7)) || (((((a15 == 4 && a12 <= 6) && !(1 == input)) && !(12 == a16)) && !(1 == input)) && a18 + 391209 <= 0)) || ((((a15 == 4 && a16 == 9) && !(a12 == 5)) && a18 + 79 <= 0) && !(a12 == 8))) || ((((((a15 == 4 && a12 <= 6) && !(1 == input)) && !(12 == a16)) && !(1 == input)) && a18 + 79 <= 0) && 0 < a18 + 156)) || (((((a15 == 4 && !(a12 == 9)) && !(a16 == 9)) && !(12 == a16)) && a18 + 79 <= 0) && !(a12 == 8))) || ((a15 == 4 && !(12 == a16)) && a12 == 6)) || (a16 == 8 && 3 == a15)) || ((((a15 == 4 && !(a16 == 9)) && !(12 == a16)) && a12 == 5) && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5)))) || ((a16 == 8 && a15 == 4) && !(3 == input)) [2019-11-15 21:26:14,913 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c2fbee57-cf47-446f-beef-d6fb03639cc4/bin/uautomizer/witness.graphml [2019-11-15 21:26:14,913 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:26:14,917 INFO L168 Benchmark]: Toolchain (without parser) took 133186.57 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.1 GB). Free memory was 940.8 MB in the beginning and 3.3 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-11-15 21:26:14,917 INFO L168 Benchmark]: CDTParser took 0.24 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-15 21:26:14,917 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1196.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 178.8 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -176.4 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:26:14,918 INFO L168 Benchmark]: Boogie Procedure Inliner took 140.18 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: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:26:14,918 INFO L168 Benchmark]: Boogie Preprocessor took 132.63 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-15 21:26:14,918 INFO L168 Benchmark]: RCFGBuilder took 2709.67 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: 27.6 MB). Peak memory consumption was 193.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:26:14,919 INFO L168 Benchmark]: TraceAbstraction took 128684.88 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 3.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-11-15 21:26:14,919 INFO L168 Benchmark]: Witness Printer took 318.72 ms. Allocated memory is still 5.1 GB. Free memory was 3.4 GB in the beginning and 3.3 GB in the end (delta: 109.7 MB). Peak memory consumption was 109.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:26:14,921 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.24 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 1196.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 178.8 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -176.4 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 140.18 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: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 132.63 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. * RCFGBuilder took 2709.67 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: 27.6 MB). Peak memory consumption was 193.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 128684.88 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 3.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 318.72 ms. Allocated memory is still 5.1 GB. Free memory was 3.4 GB in the beginning and 3.3 GB in the end (delta: 109.7 MB). Peak memory consumption was 109.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 121]: 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: 23]: Loop Invariant [2019-11-15 21:26:14,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-11-15 21:26:14,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-11-15 21:26:14,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-11-15 21:26:14,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-11-15 21:26:14,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-11-15 21:26:14,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] Derived loop invariant: ((((((((((((a16 == 8 && a15 == 4) || ((3 == a15 && (!(a16 == 9) || ((3 == a15 && a18 + 79 <= 0) && 0 < a18 + 156))) && 0 < a18 + 156)) || ((((a15 == 4 && !(12 == a16)) && a12 == 5) && !(1 == input)) && a18 + 391209 <= 0)) || ((a15 == 4 && !(12 == a16)) && a12 == 6)) || ((\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5)) && ((a15 == 4 && !(12 == a16)) && a12 == 5) && (!(a16 == 9) || ((3 == a15 && a18 + 79 <= 0) && 0 < a18 + 156)))) || (3 == a15 && (\exists v_~a18~0_903 : int :: (!(v_~a18~0_903 % 299932 == 0) && v_~a18~0_903 < 0) && v_~a18~0_903 % 299932 + 134 <= a18))) || ((a15 == 4 && a16 == 9) && a12 == 7)) || (((((a15 == 4 && !(a12 == 9)) && !(12 == a16)) && (!(a16 == 9) || ((3 == a15 && a18 + 79 <= 0) && 0 < a18 + 156))) && !(a12 == 8)) && a18 + 79 <= 0)) || (((((a15 == 4 && a12 <= 6) && !(12 == a16)) && !(1 == input)) && a18 + 79 <= 0) && 0 < a18 + 156)) || ((((a15 == 4 && a16 == 9) && !(a12 == 5)) && !(a12 == 8)) && a18 + 79 <= 0)) || ((((a15 == 4 && a16 == 9) && 0 < a18 + 156) || (((a15 == 4 && a16 == 9) && !(1 == input)) && !(1 == input))) && a12 == 8)) || (a16 == 8 && 3 == a15)) || (!(a12 == 5) && 3 == a15) - InvariantResult [Line: 1494]: Loop Invariant [2019-11-15 21:26:14,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-11-15 21:26:14,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-11-15 21:26:14,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-11-15 21:26:14,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-11-15 21:26:14,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-11-15 21:26:14,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-11-15 21:26:14,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] Derived loop invariant: (((((((((((((3 == a15 && (\exists v_~a18~0_903 : int :: (!(v_~a18~0_903 % 299932 == 0) && v_~a18~0_903 < 0) && v_~a18~0_903 % 299932 + 134 <= a18)) || ((a16 == 8 && a15 == 4) && !(a12 == 5))) || ((((a15 == 4 && a16 == 9) && !(1 == input)) && a12 == 8) && (!(1 == input) || 0 < a18 + 156))) || (!(a12 == 5) && 3 == a15)) || ((!(a16 == 9) && 3 == a15) && 0 < a18 + 156)) || ((a15 == 4 && a16 == 9) && a12 == 7)) || (((((a15 == 4 && a12 <= 6) && !(1 == input)) && !(12 == a16)) && !(1 == input)) && a18 + 391209 <= 0)) || ((((a15 == 4 && a16 == 9) && !(a12 == 5)) && a18 + 79 <= 0) && !(a12 == 8))) || ((((((a15 == 4 && a12 <= 6) && !(1 == input)) && !(12 == a16)) && !(1 == input)) && a18 + 79 <= 0) && 0 < a18 + 156)) || (((((a15 == 4 && !(a12 == 9)) && !(a16 == 9)) && !(12 == a16)) && a18 + 79 <= 0) && !(a12 == 8))) || ((a15 == 4 && !(12 == a16)) && a12 == 6)) || (a16 == 8 && 3 == a15)) || ((((a15 == 4 && !(a16 == 9)) && !(12 == a16)) && a12 == 5) && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5)))) || ((a16 == 8 && a15 == 4) && !(3 == input)) - InvariantResult [Line: 1767]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1773]: Loop Invariant [2019-11-15 21:26:14,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-11-15 21:26:14,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-11-15 21:26:14,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-11-15 21:26:14,960 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,960 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,960 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 21:26:14,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-11-15 21:26:14,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-11-15 21:26:14,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] Derived loop invariant: ((((((((((((a16 == 8 && a15 == 4) || ((3 == a15 && (!(a16 == 9) || ((3 == a15 && a18 + 79 <= 0) && 0 < a18 + 156))) && 0 < a18 + 156)) || ((((a15 == 4 && !(12 == a16)) && a12 == 5) && !(1 == input)) && a18 + 391209 <= 0)) || ((a15 == 4 && !(12 == a16)) && a12 == 6)) || ((\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5)) && ((a15 == 4 && !(12 == a16)) && a12 == 5) && (!(a16 == 9) || ((3 == a15 && a18 + 79 <= 0) && 0 < a18 + 156)))) || (3 == a15 && (\exists v_~a18~0_903 : int :: (!(v_~a18~0_903 % 299932 == 0) && v_~a18~0_903 < 0) && v_~a18~0_903 % 299932 + 134 <= a18))) || ((a15 == 4 && a16 == 9) && a12 == 7)) || (((((a15 == 4 && !(a12 == 9)) && !(12 == a16)) && (!(a16 == 9) || ((3 == a15 && a18 + 79 <= 0) && 0 < a18 + 156))) && !(a12 == 8)) && a18 + 79 <= 0)) || (((((a15 == 4 && a12 <= 6) && !(12 == a16)) && !(1 == input)) && a18 + 79 <= 0) && 0 < a18 + 156)) || ((((a15 == 4 && a16 == 9) && !(a12 == 5)) && !(a12 == 8)) && a18 + 79 <= 0)) || ((((a15 == 4 && a16 == 9) && 0 < a18 + 156) || (((a15 == 4 && a16 == 9) && !(1 == input)) && !(1 == input))) && a12 == 8)) || (a16 == 8 && 3 == a15)) || (!(a12 == 5) && 3 == a15) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 396 locations, 1 error locations. Result: SAFE, OverallTime: 128.5s, OverallIterations: 16, TraceHistogramMax: 14, AutomataDifference: 44.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.7s, HoareTripleCheckerStatistics: 3705 SDtfs, 11470 SDslu, 360 SDs, 0 SdLazy, 38907 SolverSat, 3508 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 34.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12077 GetRequests, 11907 SyntacticMatches, 29 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15796occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 16503 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 183 NumberOfFragments, 864 HoareAnnotationTreeSize, 4 FomulaSimplifications, 21594 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 4 FomulaSimplificationsInter, 9348 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 27.9s InterpolantComputationTime, 32375 NumberOfCodeBlocks, 32375 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 32352 ConstructedInterpolants, 148 QuantifiedInterpolants, 219996721 SizeOfPredicates, 5 NumberOfNonLiveVariables, 13653 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 23 InterpolantComputations, 15 PerfectInterpolantSequences, 96673/105461 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...