./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_bd803c96-257b-433e-89a3-328009077599/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_bd803c96-257b-433e-89a3-328009077599/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bd803c96-257b-433e-89a3-328009077599/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bd803c96-257b-433e-89a3-328009077599/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label50.c -s /tmp/vcloud-vcloud-master/worker/run_dir_bd803c96-257b-433e-89a3-328009077599/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bd803c96-257b-433e-89a3-328009077599/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 7492cd022f1e8554d216271372c4fc16e69b1112 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 04:06:53,815 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 04:06:53,816 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 04:06:53,827 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 04:06:53,827 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 04:06:53,828 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 04:06:53,829 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 04:06:53,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 04:06:53,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 04:06:53,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 04:06:53,835 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 04:06:53,836 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 04:06:53,836 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 04:06:53,837 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 04:06:53,838 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 04:06:53,839 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 04:06:53,840 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 04:06:53,841 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 04:06:53,843 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 04:06:53,844 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 04:06:53,846 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 04:06:53,847 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 04:06:53,848 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 04:06:53,849 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 04:06:53,851 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 04:06:53,852 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 04:06:53,852 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 04:06:53,853 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 04:06:53,853 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 04:06:53,854 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 04:06:53,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 04:06:53,856 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 04:06:53,857 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 04:06:53,858 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 04:06:53,859 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 04:06:53,859 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 04:06:53,859 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 04:06:53,859 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 04:06:53,860 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 04:06:53,860 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 04:06:53,861 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 04:06:53,861 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bd803c96-257b-433e-89a3-328009077599/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 04:06:53,881 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 04:06:53,881 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 04:06:53,882 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 04:06:53,883 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 04:06:53,883 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 04:06:53,883 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 04:06:53,883 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 04:06:53,883 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 04:06:53,884 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 04:06:53,884 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 04:06:53,885 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 04:06:53,885 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 04:06:53,885 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 04:06:53,885 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 04:06:53,885 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 04:06:53,886 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 04:06:53,886 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 04:06:53,886 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 04:06:53,886 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 04:06:53,886 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 04:06:53,887 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 04:06:53,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 04:06:53,887 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 04:06:53,887 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 04:06:53,887 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 04:06:53,888 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 04:06:53,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 04:06:53,888 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 04:06:53,888 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_bd803c96-257b-433e-89a3-328009077599/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 -> 7492cd022f1e8554d216271372c4fc16e69b1112 [2019-11-20 04:06:54,055 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 04:06:54,064 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 04:06:54,071 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 04:06:54,072 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 04:06:54,073 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 04:06:54,073 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bd803c96-257b-433e-89a3-328009077599/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem11_label50.c [2019-11-20 04:06:54,132 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bd803c96-257b-433e-89a3-328009077599/bin/uautomizer/data/da8469f0b/f9d4024b783e48a2ac4bcd78718bf499/FLAGb6b0a5d00 [2019-11-20 04:06:54,670 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 04:06:54,670 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bd803c96-257b-433e-89a3-328009077599/sv-benchmarks/c/eca-rers2012/Problem11_label50.c [2019-11-20 04:06:54,682 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bd803c96-257b-433e-89a3-328009077599/bin/uautomizer/data/da8469f0b/f9d4024b783e48a2ac4bcd78718bf499/FLAGb6b0a5d00 [2019-11-20 04:06:54,896 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bd803c96-257b-433e-89a3-328009077599/bin/uautomizer/data/da8469f0b/f9d4024b783e48a2ac4bcd78718bf499 [2019-11-20 04:06:54,899 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 04:06:54,900 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 04:06:54,901 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 04:06:54,901 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 04:06:54,908 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 04:06:54,909 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:06:54" (1/1) ... [2019-11-20 04:06:54,911 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a4da688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:54, skipping insertion in model container [2019-11-20 04:06:54,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:06:54" (1/1) ... [2019-11-20 04:06:54,918 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 04:06:54,971 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 04:06:55,640 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:06:55,645 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 04:06:55,796 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:06:55,810 INFO L192 MainTranslator]: Completed translation [2019-11-20 04:06:55,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:55 WrapperNode [2019-11-20 04:06:55,811 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 04:06:55,811 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 04:06:55,811 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 04:06:55,812 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 04:06:55,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:55" (1/1) ... [2019-11-20 04:06:55,868 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:55" (1/1) ... [2019-11-20 04:06:55,994 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 04:06:55,995 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 04:06:55,995 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 04:06:55,996 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 04:06:56,004 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:55" (1/1) ... [2019-11-20 04:06:56,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:55" (1/1) ... [2019-11-20 04:06:56,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:55" (1/1) ... [2019-11-20 04:06:56,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:55" (1/1) ... [2019-11-20 04:06:56,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:55" (1/1) ... [2019-11-20 04:06:56,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:55" (1/1) ... [2019-11-20 04:06:56,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:55" (1/1) ... [2019-11-20 04:06:56,124 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 04:06:56,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 04:06:56,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 04:06:56,125 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 04:06:56,126 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd803c96-257b-433e-89a3-328009077599/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-20 04:06:56,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 04:06:56,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 04:06:58,043 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 04:06:58,043 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 04:06:58,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:06:58 BoogieIcfgContainer [2019-11-20 04:06:58,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 04:06:58,046 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 04:06:58,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 04:06:58,048 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 04:06:58,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:06:54" (1/3) ... [2019-11-20 04:06:58,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b4ea137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:06:58, skipping insertion in model container [2019-11-20 04:06:58,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:55" (2/3) ... [2019-11-20 04:06:58,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b4ea137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:06:58, skipping insertion in model container [2019-11-20 04:06:58,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:06:58" (3/3) ... [2019-11-20 04:06:58,052 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label50.c [2019-11-20 04:06:58,061 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 04:06:58,067 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 04:06:58,077 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 04:06:58,105 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 04:06:58,105 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 04:06:58,105 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 04:06:58,106 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 04:06:58,106 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 04:06:58,106 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 04:06:58,106 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 04:06:58,107 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 04:06:58,136 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-11-20 04:06:58,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-20 04:06:58,142 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:06:58,143 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:58,143 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:06:58,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:58,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1318097310, now seen corresponding path program 1 times [2019-11-20 04:06:58,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:58,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774582379] [2019-11-20 04:06:58,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:58,420 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-20 04:06:58,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774582379] [2019-11-20 04:06:58,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:06:58,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:06:58,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076100954] [2019-11-20 04:06:58,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:06:58,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:06:58,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:06:58,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:06:58,441 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-11-20 04:07:00,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:07:00,712 INFO L93 Difference]: Finished difference Result 973 states and 1743 transitions. [2019-11-20 04:07:00,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:07:00,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-11-20 04:07:00,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:07:00,742 INFO L225 Difference]: With dead ends: 973 [2019-11-20 04:07:00,742 INFO L226 Difference]: Without dead ends: 607 [2019-11-20 04:07:00,751 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:07:00,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-11-20 04:07:00,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 604. [2019-11-20 04:07:00,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-11-20 04:07:00,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 874 transitions. [2019-11-20 04:07:00,847 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 874 transitions. Word has length 36 [2019-11-20 04:07:00,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:07:00,848 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 874 transitions. [2019-11-20 04:07:00,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:07:00,848 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 874 transitions. [2019-11-20 04:07:00,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 04:07:00,855 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:07:00,856 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 04:07:00,856 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:07:00,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:07:00,857 INFO L82 PathProgramCache]: Analyzing trace with hash -464053414, now seen corresponding path program 1 times [2019-11-20 04:07:00,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:07:00,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932773022] [2019-11-20 04:07:00,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:07:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:07:01,058 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:07:01,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932773022] [2019-11-20 04:07:01,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:07:01,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:07:01,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596943310] [2019-11-20 04:07:01,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:07:01,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:07:01,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:07:01,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:07:01,066 INFO L87 Difference]: Start difference. First operand 604 states and 874 transitions. Second operand 4 states. [2019-11-20 04:07:02,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:07:02,553 INFO L93 Difference]: Finished difference Result 2328 states and 3390 transitions. [2019-11-20 04:07:02,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:07:02,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-11-20 04:07:02,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:07:02,565 INFO L225 Difference]: With dead ends: 2328 [2019-11-20 04:07:02,565 INFO L226 Difference]: Without dead ends: 1726 [2019-11-20 04:07:02,567 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:07:02,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2019-11-20 04:07:02,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1710. [2019-11-20 04:07:02,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1710 states. [2019-11-20 04:07:02,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2342 transitions. [2019-11-20 04:07:02,611 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2342 transitions. Word has length 104 [2019-11-20 04:07:02,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:07:02,612 INFO L462 AbstractCegarLoop]: Abstraction has 1710 states and 2342 transitions. [2019-11-20 04:07:02,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:07:02,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2342 transitions. [2019-11-20 04:07:02,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-20 04:07:02,616 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:07:02,616 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 04:07:02,617 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:07:02,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:07:02,617 INFO L82 PathProgramCache]: Analyzing trace with hash 898348729, now seen corresponding path program 1 times [2019-11-20 04:07:02,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:07:02,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509489809] [2019-11-20 04:07:02,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:07:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:07:02,817 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:07:02,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509489809] [2019-11-20 04:07:02,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:07:02,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:07:02,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968423955] [2019-11-20 04:07:02,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:07:02,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:07:02,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:07:02,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:07:02,823 INFO L87 Difference]: Start difference. First operand 1710 states and 2342 transitions. Second operand 3 states. [2019-11-20 04:07:03,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:07:03,718 INFO L93 Difference]: Finished difference Result 4707 states and 6454 transitions. [2019-11-20 04:07:03,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:07:03,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-11-20 04:07:03,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:07:03,735 INFO L225 Difference]: With dead ends: 4707 [2019-11-20 04:07:03,735 INFO L226 Difference]: Without dead ends: 2999 [2019-11-20 04:07:03,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:07:03,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2019-11-20 04:07:03,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 2999. [2019-11-20 04:07:03,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2999 states. [2019-11-20 04:07:03,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 3735 transitions. [2019-11-20 04:07:03,794 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 3735 transitions. Word has length 130 [2019-11-20 04:07:03,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:07:03,795 INFO L462 AbstractCegarLoop]: Abstraction has 2999 states and 3735 transitions. [2019-11-20 04:07:03,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:07:03,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 3735 transitions. [2019-11-20 04:07:03,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-20 04:07:03,797 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:07:03,798 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-11-20 04:07:03,798 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:07:03,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:07:03,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1163752101, now seen corresponding path program 1 times [2019-11-20 04:07:03,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:07:03,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264484645] [2019-11-20 04:07:03,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:07:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:07:03,943 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 04:07:03,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264484645] [2019-11-20 04:07:03,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904862425] [2019-11-20 04:07:03,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd803c96-257b-433e-89a3-328009077599/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-20 04:07:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:07:04,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 04:07:04,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:07:04,110 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:07:04,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 04:07:04,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-11-20 04:07:04,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092362347] [2019-11-20 04:07:04,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:07:04,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:07:04,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:07:04,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:07:04,115 INFO L87 Difference]: Start difference. First operand 2999 states and 3735 transitions. Second operand 3 states. [2019-11-20 04:07:04,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:07:04,967 INFO L93 Difference]: Finished difference Result 7652 states and 9361 transitions. [2019-11-20 04:07:04,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:07:04,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-20 04:07:04,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:07:04,991 INFO L225 Difference]: With dead ends: 7652 [2019-11-20 04:07:04,991 INFO L226 Difference]: Without dead ends: 4655 [2019-11-20 04:07:04,995 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 158 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-20 04:07:05,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4655 states. [2019-11-20 04:07:05,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4655 to 3550. [2019-11-20 04:07:05,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3550 states. [2019-11-20 04:07:05,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3550 states to 3550 states and 4399 transitions. [2019-11-20 04:07:05,069 INFO L78 Accepts]: Start accepts. Automaton has 3550 states and 4399 transitions. Word has length 158 [2019-11-20 04:07:05,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:07:05,070 INFO L462 AbstractCegarLoop]: Abstraction has 3550 states and 4399 transitions. [2019-11-20 04:07:05,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:07:05,070 INFO L276 IsEmpty]: Start isEmpty. Operand 3550 states and 4399 transitions. [2019-11-20 04:07:05,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-20 04:07:05,073 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:07:05,073 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:07:05,285 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:07:05,285 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:07:05,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:07:05,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1754552329, now seen corresponding path program 1 times [2019-11-20 04:07:05,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:07:05,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229213826] [2019-11-20 04:07:05,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:07:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:07:05,483 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:07:05,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229213826] [2019-11-20 04:07:05,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:07:05,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:07:05,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317644367] [2019-11-20 04:07:05,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:07:05,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:07:05,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:07:05,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:07:05,485 INFO L87 Difference]: Start difference. First operand 3550 states and 4399 transitions. Second operand 4 states. [2019-11-20 04:07:07,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:07:07,037 INFO L93 Difference]: Finished difference Result 8407 states and 10478 transitions. [2019-11-20 04:07:07,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:07:07,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-11-20 04:07:07,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:07:07,061 INFO L225 Difference]: With dead ends: 8407 [2019-11-20 04:07:07,061 INFO L226 Difference]: Without dead ends: 4859 [2019-11-20 04:07:07,066 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:07:07,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4859 states. [2019-11-20 04:07:07,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4859 to 4102. [2019-11-20 04:07:07,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4102 states. [2019-11-20 04:07:07,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 5013 transitions. [2019-11-20 04:07:07,149 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 5013 transitions. Word has length 163 [2019-11-20 04:07:07,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:07:07,150 INFO L462 AbstractCegarLoop]: Abstraction has 4102 states and 5013 transitions. [2019-11-20 04:07:07,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:07:07,150 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 5013 transitions. [2019-11-20 04:07:07,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-11-20 04:07:07,155 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:07:07,155 INFO L410 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, 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] [2019-11-20 04:07:07,156 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:07:07,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:07:07,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1310756102, now seen corresponding path program 1 times [2019-11-20 04:07:07,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:07:07,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126436596] [2019-11-20 04:07:07,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:07:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:07:07,663 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:07:07,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126436596] [2019-11-20 04:07:07,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865664224] [2019-11-20 04:07:07,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd803c96-257b-433e-89a3-328009077599/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-20 04:07:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:07:07,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 04:07:07,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:07:07,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:07,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:08,204 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 67 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:07:08,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:07:08,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 7 [2019-11-20 04:07:08,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349481810] [2019-11-20 04:07:08,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 04:07:08,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:07:08,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 04:07:08,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-20 04:07:08,206 INFO L87 Difference]: Start difference. First operand 4102 states and 5013 transitions. Second operand 8 states. [2019-11-20 04:07:14,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:07:14,987 INFO L93 Difference]: Finished difference Result 17803 states and 21348 transitions. [2019-11-20 04:07:14,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-20 04:07:14,989 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 248 [2019-11-20 04:07:14,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:07:15,051 INFO L225 Difference]: With dead ends: 17803 [2019-11-20 04:07:15,051 INFO L226 Difference]: Without dead ends: 13334 [2019-11-20 04:07:15,058 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-11-20 04:07:15,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13334 states. [2019-11-20 04:07:15,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13334 to 11847. [2019-11-20 04:07:15,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11847 states. [2019-11-20 04:07:15,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11847 states to 11847 states and 13963 transitions. [2019-11-20 04:07:15,378 INFO L78 Accepts]: Start accepts. Automaton has 11847 states and 13963 transitions. Word has length 248 [2019-11-20 04:07:15,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:07:15,379 INFO L462 AbstractCegarLoop]: Abstraction has 11847 states and 13963 transitions. [2019-11-20 04:07:15,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 04:07:15,379 INFO L276 IsEmpty]: Start isEmpty. Operand 11847 states and 13963 transitions. [2019-11-20 04:07:15,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-11-20 04:07:15,392 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:07:15,393 INFO L410 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:07:15,596 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:07:15,596 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:07:15,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:07:15,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1638131916, now seen corresponding path program 1 times [2019-11-20 04:07:15,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:07:15,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823398267] [2019-11-20 04:07:15,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:07:15,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:07:16,139 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 218 proven. 158 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:07:16,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823398267] [2019-11-20 04:07:16,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628450703] [2019-11-20 04:07:16,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd803c96-257b-433e-89a3-328009077599/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-20 04:07:16,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:07:16,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 04:07:16,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:07:16,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:16,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:16,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:16,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:16,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:16,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:16,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:16,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:16,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:16,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:16,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:16,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:16,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:16,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:16,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:16,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:16,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:16,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:16,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:16,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:16,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:16,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:16,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:16,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:16,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:16,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:16,641 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 28 [2019-11-20 04:07:17,203 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 101 proven. 179 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-20 04:07:17,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:07:17,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3] total 9 [2019-11-20 04:07:17,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849539610] [2019-11-20 04:07:17,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 04:07:17,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:07:17,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 04:07:17,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-20 04:07:17,207 INFO L87 Difference]: Start difference. First operand 11847 states and 13963 transitions. Second operand 9 states. [2019-11-20 04:07:24,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:07:24,142 INFO L93 Difference]: Finished difference Result 30168 states and 35764 transitions. [2019-11-20 04:07:24,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-20 04:07:24,142 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 345 [2019-11-20 04:07:24,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:07:24,182 INFO L225 Difference]: With dead ends: 30168 [2019-11-20 04:07:24,182 INFO L226 Difference]: Without dead ends: 20354 [2019-11-20 04:07:24,194 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2019-11-20 04:07:24,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20354 states. [2019-11-20 04:07:24,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20354 to 17011. [2019-11-20 04:07:24,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17011 states. [2019-11-20 04:07:24,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17011 states to 17011 states and 19720 transitions. [2019-11-20 04:07:24,465 INFO L78 Accepts]: Start accepts. Automaton has 17011 states and 19720 transitions. Word has length 345 [2019-11-20 04:07:24,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:07:24,466 INFO L462 AbstractCegarLoop]: Abstraction has 17011 states and 19720 transitions. [2019-11-20 04:07:24,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 04:07:24,466 INFO L276 IsEmpty]: Start isEmpty. Operand 17011 states and 19720 transitions. [2019-11-20 04:07:24,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-11-20 04:07:24,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:07:24,484 INFO L410 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:07:24,688 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:07:24,688 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:07:24,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:07:24,689 INFO L82 PathProgramCache]: Analyzing trace with hash -620962545, now seen corresponding path program 1 times [2019-11-20 04:07:24,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:07:24,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946372557] [2019-11-20 04:07:24,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:07:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:07:25,003 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-11-20 04:07:25,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946372557] [2019-11-20 04:07:25,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:07:25,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:07:25,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382814443] [2019-11-20 04:07:25,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:07:25,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:07:25,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:07:25,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:07:25,006 INFO L87 Difference]: Start difference. First operand 17011 states and 19720 transitions. Second operand 4 states. [2019-11-20 04:07:26,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:07:26,290 INFO L93 Difference]: Finished difference Result 37366 states and 43502 transitions. [2019-11-20 04:07:26,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:07:26,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 357 [2019-11-20 04:07:26,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:07:26,361 INFO L225 Difference]: With dead ends: 37366 [2019-11-20 04:07:26,361 INFO L226 Difference]: Without dead ends: 20725 [2019-11-20 04:07:26,401 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:07:26,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20725 states. [2019-11-20 04:07:26,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20725 to 19035. [2019-11-20 04:07:26,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19035 states. [2019-11-20 04:07:26,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19035 states to 19035 states and 21900 transitions. [2019-11-20 04:07:26,851 INFO L78 Accepts]: Start accepts. Automaton has 19035 states and 21900 transitions. Word has length 357 [2019-11-20 04:07:26,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:07:26,852 INFO L462 AbstractCegarLoop]: Abstraction has 19035 states and 21900 transitions. [2019-11-20 04:07:26,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:07:26,852 INFO L276 IsEmpty]: Start isEmpty. Operand 19035 states and 21900 transitions. [2019-11-20 04:07:26,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-11-20 04:07:26,873 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:07:26,874 INFO L410 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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-20 04:07:26,875 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:07:26,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:07:26,875 INFO L82 PathProgramCache]: Analyzing trace with hash -108272370, now seen corresponding path program 1 times [2019-11-20 04:07:26,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:07:26,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125403621] [2019-11-20 04:07:26,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:07:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:07:27,237 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-20 04:07:27,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125403621] [2019-11-20 04:07:27,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:07:27,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 04:07:27,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104660902] [2019-11-20 04:07:27,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 04:07:27,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:07:27,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 04:07:27,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:07:27,240 INFO L87 Difference]: Start difference. First operand 19035 states and 21900 transitions. Second operand 5 states. [2019-11-20 04:07:28,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:07:28,850 INFO L93 Difference]: Finished difference Result 36254 states and 41917 transitions. [2019-11-20 04:07:28,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 04:07:28,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 358 [2019-11-20 04:07:28,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:07:28,884 INFO L225 Difference]: With dead ends: 36254 [2019-11-20 04:07:28,884 INFO L226 Difference]: Without dead ends: 21099 [2019-11-20 04:07:28,900 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:07:28,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21099 states. [2019-11-20 04:07:29,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21099 to 19967. [2019-11-20 04:07:29,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19967 states. [2019-11-20 04:07:29,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19967 states to 19967 states and 22740 transitions. [2019-11-20 04:07:29,131 INFO L78 Accepts]: Start accepts. Automaton has 19967 states and 22740 transitions. Word has length 358 [2019-11-20 04:07:29,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:07:29,131 INFO L462 AbstractCegarLoop]: Abstraction has 19967 states and 22740 transitions. [2019-11-20 04:07:29,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 04:07:29,131 INFO L276 IsEmpty]: Start isEmpty. Operand 19967 states and 22740 transitions. [2019-11-20 04:07:29,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2019-11-20 04:07:29,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:07:29,150 INFO L410 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:07:29,151 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:07:29,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:07:29,151 INFO L82 PathProgramCache]: Analyzing trace with hash 535880552, now seen corresponding path program 1 times [2019-11-20 04:07:29,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:07:29,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642368484] [2019-11-20 04:07:29,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:07:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:07:29,478 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-20 04:07:29,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642368484] [2019-11-20 04:07:29,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:07:29,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:07:29,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304029029] [2019-11-20 04:07:29,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:07:29,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:07:29,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:07:29,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:07:29,483 INFO L87 Difference]: Start difference. First operand 19967 states and 22740 transitions. Second operand 4 states. [2019-11-20 04:07:30,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:07:30,773 INFO L93 Difference]: Finished difference Result 39938 states and 45481 transitions. [2019-11-20 04:07:30,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:07:30,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 361 [2019-11-20 04:07:30,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:07:30,796 INFO L225 Difference]: With dead ends: 39938 [2019-11-20 04:07:30,796 INFO L226 Difference]: Without dead ends: 19973 [2019-11-20 04:07:30,811 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:07:30,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19973 states. [2019-11-20 04:07:31,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19973 to 17942. [2019-11-20 04:07:31,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17942 states. [2019-11-20 04:07:31,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17942 states to 17942 states and 20269 transitions. [2019-11-20 04:07:31,028 INFO L78 Accepts]: Start accepts. Automaton has 17942 states and 20269 transitions. Word has length 361 [2019-11-20 04:07:31,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:07:31,028 INFO L462 AbstractCegarLoop]: Abstraction has 17942 states and 20269 transitions. [2019-11-20 04:07:31,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:07:31,029 INFO L276 IsEmpty]: Start isEmpty. Operand 17942 states and 20269 transitions. [2019-11-20 04:07:31,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-11-20 04:07:31,041 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:07:31,042 INFO L410 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:07:31,042 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:07:31,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:07:31,043 INFO L82 PathProgramCache]: Analyzing trace with hash 19325802, now seen corresponding path program 1 times [2019-11-20 04:07:31,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:07:31,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537445312] [2019-11-20 04:07:31,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:07:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:07:31,327 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-20 04:07:31,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537445312] [2019-11-20 04:07:31,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:07:31,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:07:31,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585669222] [2019-11-20 04:07:31,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:07:31,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:07:31,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:07:31,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:07:31,329 INFO L87 Difference]: Start difference. First operand 17942 states and 20269 transitions. Second operand 3 states. [2019-11-20 04:07:32,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:07:32,145 INFO L93 Difference]: Finished difference Result 34770 states and 39330 transitions. [2019-11-20 04:07:32,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:07:32,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 395 [2019-11-20 04:07:32,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:07:32,165 INFO L225 Difference]: With dead ends: 34770 [2019-11-20 04:07:32,165 INFO L226 Difference]: Without dead ends: 19044 [2019-11-20 04:07:32,174 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:07:32,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19044 states. [2019-11-20 04:07:32,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19044 to 17743. [2019-11-20 04:07:32,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17743 states. [2019-11-20 04:07:32,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17743 states to 17743 states and 19773 transitions. [2019-11-20 04:07:32,376 INFO L78 Accepts]: Start accepts. Automaton has 17743 states and 19773 transitions. Word has length 395 [2019-11-20 04:07:32,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:07:32,376 INFO L462 AbstractCegarLoop]: Abstraction has 17743 states and 19773 transitions. [2019-11-20 04:07:32,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:07:32,377 INFO L276 IsEmpty]: Start isEmpty. Operand 17743 states and 19773 transitions. [2019-11-20 04:07:32,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2019-11-20 04:07:32,391 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:07:32,391 INFO L410 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-11-20 04:07:32,391 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:07:32,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:07:32,392 INFO L82 PathProgramCache]: Analyzing trace with hash -168560213, now seen corresponding path program 1 times [2019-11-20 04:07:32,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:07:32,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022123068] [2019-11-20 04:07:32,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:07:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:07:32,811 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 388 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:07:32,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022123068] [2019-11-20 04:07:32,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050054016] [2019-11-20 04:07:32,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd803c96-257b-433e-89a3-328009077599/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-20 04:07:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:07:33,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 04:07:33,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:07:33,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:33,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:34,046 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 191 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:07:34,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:07:34,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 10 [2019-11-20 04:07:34,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71671605] [2019-11-20 04:07:34,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 04:07:34,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:07:34,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 04:07:34,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-20 04:07:34,049 INFO L87 Difference]: Start difference. First operand 17743 states and 19773 transitions. Second operand 10 states. [2019-11-20 04:07:39,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:07:39,769 INFO L93 Difference]: Finished difference Result 36971 states and 41074 transitions. [2019-11-20 04:07:39,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-20 04:07:39,769 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 431 [2019-11-20 04:07:39,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:07:39,783 INFO L225 Difference]: With dead ends: 36971 [2019-11-20 04:07:39,784 INFO L226 Difference]: Without dead ends: 22921 [2019-11-20 04:07:39,791 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2019-11-20 04:07:39,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22921 states. [2019-11-20 04:07:39,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22921 to 16448. [2019-11-20 04:07:39,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16448 states. [2019-11-20 04:07:39,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16448 states to 16448 states and 18237 transitions. [2019-11-20 04:07:39,989 INFO L78 Accepts]: Start accepts. Automaton has 16448 states and 18237 transitions. Word has length 431 [2019-11-20 04:07:39,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:07:39,990 INFO L462 AbstractCegarLoop]: Abstraction has 16448 states and 18237 transitions. [2019-11-20 04:07:39,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 04:07:39,990 INFO L276 IsEmpty]: Start isEmpty. Operand 16448 states and 18237 transitions. [2019-11-20 04:07:40,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2019-11-20 04:07:40,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:07:40,015 INFO L410 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:07:40,218 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:07:40,223 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:07:40,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:07:40,223 INFO L82 PathProgramCache]: Analyzing trace with hash -794974525, now seen corresponding path program 1 times [2019-11-20 04:07:40,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:07:40,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838876127] [2019-11-20 04:07:40,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:07:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:07:40,665 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 637 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-11-20 04:07:40,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838876127] [2019-11-20 04:07:40,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:07:40,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:07:40,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825689321] [2019-11-20 04:07:40,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 04:07:40,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:07:40,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 04:07:40,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:07:40,668 INFO L87 Difference]: Start difference. First operand 16448 states and 18237 transitions. Second operand 5 states. [2019-11-20 04:07:42,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:07:42,059 INFO L93 Difference]: Finished difference Result 36769 states and 40703 transitions. [2019-11-20 04:07:42,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 04:07:42,059 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 527 [2019-11-20 04:07:42,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:07:42,073 INFO L225 Difference]: With dead ends: 36769 [2019-11-20 04:07:42,073 INFO L226 Difference]: Without dead ends: 22353 [2019-11-20 04:07:42,082 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:07:42,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22353 states. [2019-11-20 04:07:42,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22353 to 17921. [2019-11-20 04:07:42,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17921 states. [2019-11-20 04:07:42,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17921 states to 17921 states and 19769 transitions. [2019-11-20 04:07:42,275 INFO L78 Accepts]: Start accepts. Automaton has 17921 states and 19769 transitions. Word has length 527 [2019-11-20 04:07:42,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:07:42,275 INFO L462 AbstractCegarLoop]: Abstraction has 17921 states and 19769 transitions. [2019-11-20 04:07:42,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 04:07:42,275 INFO L276 IsEmpty]: Start isEmpty. Operand 17921 states and 19769 transitions. [2019-11-20 04:07:42,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2019-11-20 04:07:42,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:07:42,293 INFO L410 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:07:42,293 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:07:42,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:07:42,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1413485239, now seen corresponding path program 1 times [2019-11-20 04:07:42,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:07:42,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824789749] [2019-11-20 04:07:42,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:07:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:07:42,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 519 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2019-11-20 04:07:42,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824789749] [2019-11-20 04:07:42,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:07:42,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:07:42,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68644864] [2019-11-20 04:07:42,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:07:42,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:07:42,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:07:42,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:07:42,874 INFO L87 Difference]: Start difference. First operand 17921 states and 19769 transitions. Second operand 3 states. [2019-11-20 04:07:43,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:07:43,589 INFO L93 Difference]: Finished difference Result 36390 states and 40168 transitions. [2019-11-20 04:07:43,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:07:43,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 553 [2019-11-20 04:07:43,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:07:43,590 INFO L225 Difference]: With dead ends: 36390 [2019-11-20 04:07:43,590 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 04:07:43,598 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:07:43,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 04:07:43,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 04:07:43,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 04:07:43,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 04:07:43,599 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 553 [2019-11-20 04:07:43,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:07:43,599 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 04:07:43,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:07:43,599 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 04:07:43,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 04:07:43,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 04:07:44,346 WARN L191 SmtUtils]: Spent 735.00 ms on a formula simplification. DAG size of input: 514 DAG size of output: 347 [2019-11-20 04:07:44,921 WARN L191 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 514 DAG size of output: 347 [2019-11-20 04:07:46,378 WARN L191 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 325 DAG size of output: 72 [2019-11-20 04:07:47,755 WARN L191 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 325 DAG size of output: 72 [2019-11-20 04:07:47,758 INFO L444 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-20 04:07:47,758 INFO L444 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-11-20 04:07:47,758 INFO L444 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-11-20 04:07:47,758 INFO L447 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-11-20 04:07:47,758 INFO L444 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,758 INFO L444 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,758 INFO L444 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,758 INFO L444 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,758 INFO L444 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,758 INFO L444 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,758 INFO L444 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,759 INFO L444 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-20 04:07:47,759 INFO L444 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-11-20 04:07:47,759 INFO L444 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-20 04:07:47,759 INFO L444 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,759 INFO L444 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,759 INFO L444 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,759 INFO L444 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,759 INFO L444 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,759 INFO L444 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,759 INFO L444 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,759 INFO L444 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,759 INFO L444 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,759 INFO L444 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-11-20 04:07:47,759 INFO L444 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-20 04:07:47,759 INFO L444 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-11-20 04:07:47,759 INFO L444 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,760 INFO L440 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse7 (= 10 ~a25~0))) (let ((.cse3 (= 12 ~a25~0)) (.cse8 (<= ~a29~0 275)) (.cse2 (<= ~a23~0 312)) (.cse0 (= ~a25~0 13)) (.cse9 (<= (+ ~a23~0 43) 0)) (.cse6 (not .cse7)) (.cse10 (<= ~a29~0 245)) (.cse5 (exists ((v_~a29~0_502 Int)) (let ((.cse11 (+ v_~a29~0_502 69157))) (and (<= 130 v_~a29~0_502) (<= ~a29~0 (+ (mod .cse11 299861) 300138)) (<= 0 .cse11))))) (.cse4 (= ~a4~0 1)) (.cse1 (= 1 ~a4~0))) (or (and .cse0 (<= (+ ~a29~0 (* 5 ~a23~0)) 101230) .cse1) (and .cse2 .cse3 .cse4) (and .cse2 (<= ~a29~0 140)) (and .cse5 .cse1 .cse6) (and (<= ~a29~0 130) .cse7) (and .cse3 .cse8) (and .cse1 (= ~a25~0 11)) (and (= ~a25~0 9) .cse1) (and .cse8 .cse9 .cse6) (and .cse0 .cse2 .cse10) (and .cse4 .cse7 .cse9) (and (not .cse0) (<= ~a29~0 599998) .cse9 .cse6) (and (or (<= ~a23~0 138) .cse10) .cse5 .cse4) (and (< 306 ~a23~0) .cse7 .cse1)))) [2019-11-20 04:07:47,760 INFO L444 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,760 INFO L444 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,760 INFO L444 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,760 INFO L444 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,760 INFO L444 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,760 INFO L444 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,760 INFO L444 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,760 INFO L444 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,760 INFO L444 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-11-20 04:07:47,760 INFO L444 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-11-20 04:07:47,760 INFO L444 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-11-20 04:07:47,760 INFO L444 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-11-20 04:07:47,761 INFO L444 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-11-20 04:07:47,761 INFO L444 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-11-20 04:07:47,761 INFO L444 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-11-20 04:07:47,761 INFO L444 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,761 INFO L444 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,761 INFO L444 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,761 INFO L444 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,761 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,761 INFO L444 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,761 INFO L444 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,761 INFO L444 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,761 INFO L444 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,761 INFO L444 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,761 INFO L444 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-11-20 04:07:47,761 INFO L444 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-11-20 04:07:47,762 INFO L444 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-11-20 04:07:47,762 INFO L444 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-11-20 04:07:47,762 INFO L444 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,762 INFO L444 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,762 INFO L444 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,762 INFO L444 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,762 INFO L444 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,762 INFO L444 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-11-20 04:07:47,763 INFO L444 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-11-20 04:07:47,763 INFO L444 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-20 04:07:47,763 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,763 INFO L444 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,763 INFO L444 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,763 INFO L444 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,763 INFO L444 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-11-20 04:07:47,763 INFO L444 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-11-20 04:07:47,763 INFO L444 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,763 INFO L444 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,763 INFO L444 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,763 INFO L444 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,764 INFO L444 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,764 INFO L444 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,764 INFO L444 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-11-20 04:07:47,764 INFO L444 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-11-20 04:07:47,764 INFO L444 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,764 INFO L444 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,764 INFO L444 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-20 04:07:47,764 INFO L444 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-20 04:07:47,764 INFO L444 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-11-20 04:07:47,764 INFO L444 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,764 INFO L444 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,764 INFO L444 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,764 INFO L444 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,765 INFO L444 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,765 INFO L444 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,765 INFO L444 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,765 INFO L444 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-11-20 04:07:47,765 INFO L444 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-11-20 04:07:47,765 INFO L444 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-11-20 04:07:47,765 INFO L444 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-11-20 04:07:47,765 INFO L444 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-11-20 04:07:47,765 INFO L444 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-11-20 04:07:47,765 INFO L444 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-11-20 04:07:47,766 INFO L444 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,766 INFO L444 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,766 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 04:07:47,766 INFO L444 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-11-20 04:07:47,766 INFO L444 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-11-20 04:07:47,766 INFO L444 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,766 INFO L444 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,766 INFO L444 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,766 INFO L444 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,766 INFO L444 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,766 INFO L444 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-11-20 04:07:47,766 INFO L444 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-11-20 04:07:47,766 INFO L444 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-11-20 04:07:47,766 INFO L444 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,766 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,766 INFO L444 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,767 INFO L444 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,767 INFO L444 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,767 INFO L444 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,767 INFO L444 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-11-20 04:07:47,767 INFO L444 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-11-20 04:07:47,767 INFO L444 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-11-20 04:07:47,767 INFO L444 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,767 INFO L444 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,767 INFO L444 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,767 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,767 INFO L444 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,767 INFO L444 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,768 INFO L444 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,768 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 04:07:47,768 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 114) no Hoare annotation was computed. [2019-11-20 04:07:47,768 INFO L444 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,768 INFO L444 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-11-20 04:07:47,768 INFO L444 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-11-20 04:07:47,768 INFO L444 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-11-20 04:07:47,768 INFO L444 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,768 INFO L444 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,768 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,768 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,768 INFO L444 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,768 INFO L444 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,769 INFO L444 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,769 INFO L444 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,769 INFO L444 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,769 INFO L444 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,769 INFO L444 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,769 INFO L444 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-11-20 04:07:47,769 INFO L444 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-11-20 04:07:47,769 INFO L444 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-20 04:07:47,769 INFO L444 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-11-20 04:07:47,769 INFO L444 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-20 04:07:47,769 INFO L444 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,769 INFO L444 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,769 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,769 INFO L444 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,769 INFO L444 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,769 INFO L444 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,770 INFO L444 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,770 INFO L444 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-11-20 04:07:47,770 INFO L444 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-20 04:07:47,770 INFO L444 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-11-20 04:07:47,770 INFO L444 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,770 INFO L444 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,770 INFO L444 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,770 INFO L444 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-11-20 04:07:47,770 INFO L444 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-11-20 04:07:47,770 INFO L444 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,770 INFO L444 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,770 INFO L444 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,770 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,770 INFO L444 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,770 INFO L444 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-11-20 04:07:47,770 INFO L444 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-11-20 04:07:47,771 INFO L444 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,771 INFO L444 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,771 INFO L444 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-11-20 04:07:47,771 INFO L444 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-11-20 04:07:47,771 INFO L444 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,771 INFO L444 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,771 INFO L444 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,771 INFO L444 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,771 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,771 INFO L444 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,771 INFO L444 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-11-20 04:07:47,771 INFO L444 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-11-20 04:07:47,771 INFO L444 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-11-20 04:07:47,771 INFO L444 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-11-20 04:07:47,771 INFO L444 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,771 INFO L444 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,772 INFO L444 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,772 INFO L444 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,772 INFO L444 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,772 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,772 INFO L444 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,772 INFO L444 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,772 INFO L444 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-11-20 04:07:47,772 INFO L444 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-11-20 04:07:47,772 INFO L444 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-11-20 04:07:47,772 INFO L444 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-11-20 04:07:47,772 INFO L444 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-11-20 04:07:47,772 INFO L444 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-11-20 04:07:47,772 INFO L444 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,772 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,772 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,772 INFO L444 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,773 INFO L444 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,773 INFO L444 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,773 INFO L444 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,773 INFO L444 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-20 04:07:47,773 INFO L444 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-11-20 04:07:47,773 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 04:07:47,773 INFO L444 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,774 INFO L444 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,774 INFO L444 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,774 INFO L444 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,774 INFO L444 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,774 INFO L444 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,774 INFO L444 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-11-20 04:07:47,774 INFO L444 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-11-20 04:07:47,774 INFO L444 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,775 INFO L444 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,775 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,775 INFO L444 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,775 INFO L444 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,775 INFO L444 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,775 INFO L444 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,775 INFO L444 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-11-20 04:07:47,775 INFO L444 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,775 INFO L444 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,776 INFO L444 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,776 INFO L444 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-11-20 04:07:47,776 INFO L444 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-11-20 04:07:47,776 INFO L444 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-11-20 04:07:47,776 INFO L444 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,776 INFO L444 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-11-20 04:07:47,776 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,776 INFO L444 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-11-20 04:07:47,776 INFO L444 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,776 INFO L444 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,776 INFO L444 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,776 INFO L444 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,776 INFO L444 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,776 INFO L444 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,776 INFO L444 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-11-20 04:07:47,776 INFO L444 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-11-20 04:07:47,777 INFO L444 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-11-20 04:07:47,777 INFO L444 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,777 INFO L444 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,777 INFO L444 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,777 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 04:07:47,777 INFO L444 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,777 INFO L444 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,777 INFO L444 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,777 INFO L444 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,778 INFO L444 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,778 INFO L444 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,778 INFO L444 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,778 INFO L444 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-11-20 04:07:47,778 INFO L444 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-11-20 04:07:47,778 INFO L444 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-11-20 04:07:47,778 INFO L444 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,779 INFO L444 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-11-20 04:07:47,779 INFO L444 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-11-20 04:07:47,779 INFO L444 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,779 INFO L444 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,779 INFO L444 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,779 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,779 INFO L444 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,780 INFO L444 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,780 INFO L444 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-11-20 04:07:47,780 INFO L444 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-20 04:07:47,780 INFO L444 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-11-20 04:07:47,780 INFO L444 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,780 INFO L444 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,780 INFO L444 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,781 INFO L440 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse7 (= 10 ~a25~0))) (let ((.cse3 (= 12 ~a25~0)) (.cse8 (<= ~a29~0 275)) (.cse2 (<= ~a23~0 312)) (.cse0 (= ~a25~0 13)) (.cse9 (<= (+ ~a23~0 43) 0)) (.cse6 (not .cse7)) (.cse10 (<= ~a29~0 245)) (.cse5 (exists ((v_~a29~0_502 Int)) (let ((.cse11 (+ v_~a29~0_502 69157))) (and (<= 130 v_~a29~0_502) (<= ~a29~0 (+ (mod .cse11 299861) 300138)) (<= 0 .cse11))))) (.cse4 (= ~a4~0 1)) (.cse1 (= 1 ~a4~0))) (or (and .cse0 (<= (+ ~a29~0 (* 5 ~a23~0)) 101230) .cse1) (and .cse2 .cse3 .cse4) (and .cse2 (<= ~a29~0 140)) (and .cse5 .cse1 .cse6) (and (<= ~a29~0 130) .cse7) (and .cse3 .cse8) (and .cse1 (= ~a25~0 11)) (and (= ~a25~0 9) .cse1) (and .cse8 .cse9 .cse6) (and .cse0 .cse2 .cse10) (and .cse4 .cse7 .cse9) (and (not .cse0) (<= ~a29~0 599998) .cse9 .cse6) (and (or (<= ~a23~0 138) .cse10) .cse5 .cse4) (and (< 306 ~a23~0) .cse7 .cse1)))) [2019-11-20 04:07:47,781 INFO L444 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,781 INFO L444 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-11-20 04:07:47,781 INFO L444 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-11-20 04:07:47,781 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,781 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,781 INFO L444 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-11-20 04:07:47,781 INFO L444 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,782 INFO L444 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,782 INFO L444 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 04:07:47,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:47,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:47,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:47,793 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:47,793 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:47,793 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:47,800 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:47,800 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:47,800 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:47,801 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:47,801 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:47,801 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:47,803 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:47,803 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:47,804 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:47,804 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:47,804 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:47,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:47,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:47,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:47,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:47,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:47,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:47,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:47,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 04:07:47 BoogieIcfgContainer [2019-11-20 04:07:47,810 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 04:07:47,908 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 04:07:47,908 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 04:07:47,908 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 04:07:47,908 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:06:58" (3/4) ... [2019-11-20 04:07:47,912 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 04:07:47,959 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 04:07:47,961 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 04:07:48,025 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((a25 == 13 && a29 + 5 * a23 <= 101230) && 1 == a4) || ((a23 <= 312 && 12 == a25) && a4 == 1)) || (a23 <= 312 && a29 <= 140)) || (((\exists v_~a29~0_502 : int :: (130 <= v_~a29~0_502 && a29 <= (v_~a29~0_502 + 69157) % 299861 + 300138) && 0 <= v_~a29~0_502 + 69157) && 1 == a4) && !(10 == a25))) || (a29 <= 130 && 10 == a25)) || (12 == a25 && a29 <= 275)) || (1 == a4 && a25 == 11)) || (a25 == 9 && 1 == a4)) || ((a29 <= 275 && a23 + 43 <= 0) && !(10 == a25))) || ((a25 == 13 && a23 <= 312) && a29 <= 245)) || ((a4 == 1 && 10 == a25) && a23 + 43 <= 0)) || (((!(a25 == 13) && a29 <= 599998) && a23 + 43 <= 0) && !(10 == a25))) || (((a23 <= 138 || a29 <= 245) && (\exists v_~a29~0_502 : int :: (130 <= v_~a29~0_502 && a29 <= (v_~a29~0_502 + 69157) % 299861 + 300138) && 0 <= v_~a29~0_502 + 69157)) && a4 == 1)) || ((306 < a23 && 10 == a25) && 1 == a4) [2019-11-20 04:07:48,031 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((a25 == 13 && a29 + 5 * a23 <= 101230) && 1 == a4) || ((a23 <= 312 && 12 == a25) && a4 == 1)) || (a23 <= 312 && a29 <= 140)) || (((\exists v_~a29~0_502 : int :: (130 <= v_~a29~0_502 && a29 <= (v_~a29~0_502 + 69157) % 299861 + 300138) && 0 <= v_~a29~0_502 + 69157) && 1 == a4) && !(10 == a25))) || (a29 <= 130 && 10 == a25)) || (12 == a25 && a29 <= 275)) || (1 == a4 && a25 == 11)) || (a25 == 9 && 1 == a4)) || ((a29 <= 275 && a23 + 43 <= 0) && !(10 == a25))) || ((a25 == 13 && a23 <= 312) && a29 <= 245)) || ((a4 == 1 && 10 == a25) && a23 + 43 <= 0)) || (((!(a25 == 13) && a29 <= 599998) && a23 + 43 <= 0) && !(10 == a25))) || (((a23 <= 138 || a29 <= 245) && (\exists v_~a29~0_502 : int :: (130 <= v_~a29~0_502 && a29 <= (v_~a29~0_502 + 69157) % 299861 + 300138) && 0 <= v_~a29~0_502 + 69157)) && a4 == 1)) || ((306 < a23 && 10 == a25) && 1 == a4) [2019-11-20 04:07:48,188 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_bd803c96-257b-433e-89a3-328009077599/bin/uautomizer/witness.graphml [2019-11-20 04:07:48,188 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 04:07:48,189 INFO L168 Benchmark]: Toolchain (without parser) took 53289.76 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 944.7 MB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 95.3 MB. Max. memory is 11.5 GB. [2019-11-20 04:07:48,190 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 04:07:48,190 INFO L168 Benchmark]: CACSL2BoogieTranslator took 910.02 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -118.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-11-20 04:07:48,191 INFO L168 Benchmark]: Boogie Procedure Inliner took 183.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2019-11-20 04:07:48,191 INFO L168 Benchmark]: Boogie Preprocessor took 128.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2019-11-20 04:07:48,191 INFO L168 Benchmark]: RCFGBuilder took 1920.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 854.5 MB in the end (delta: 179.5 MB). Peak memory consumption was 179.5 MB. Max. memory is 11.5 GB. [2019-11-20 04:07:48,192 INFO L168 Benchmark]: TraceAbstraction took 49764.87 ms. Allocated memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 854.5 MB in the beginning and 2.8 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-11-20 04:07:48,192 INFO L168 Benchmark]: Witness Printer took 280.93 ms. Allocated memory is still 3.0 GB. Free memory was 2.8 GB in the beginning and 2.8 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-11-20 04:07:48,194 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 910.02 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -118.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 183.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 128.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1920.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 854.5 MB in the end (delta: 179.5 MB). Peak memory consumption was 179.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 49764.87 ms. Allocated memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 854.5 MB in the beginning and 2.8 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 280.93 ms. Allocated memory is still 3.0 GB. Free memory was 2.8 GB in the beginning and 2.8 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 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_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 114]: 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: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2019-11-20 04:07:48,204 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:48,204 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:48,205 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:48,205 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:48,205 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:48,205 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:48,207 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:48,207 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:48,207 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:48,208 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:48,208 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:48,208 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] Derived loop invariant: ((((((((((((((a25 == 13 && a29 + 5 * a23 <= 101230) && 1 == a4) || ((a23 <= 312 && 12 == a25) && a4 == 1)) || (a23 <= 312 && a29 <= 140)) || (((\exists v_~a29~0_502 : int :: (130 <= v_~a29~0_502 && a29 <= (v_~a29~0_502 + 69157) % 299861 + 300138) && 0 <= v_~a29~0_502 + 69157) && 1 == a4) && !(10 == a25))) || (a29 <= 130 && 10 == a25)) || (12 == a25 && a29 <= 275)) || (1 == a4 && a25 == 11)) || (a25 == 9 && 1 == a4)) || ((a29 <= 275 && a23 + 43 <= 0) && !(10 == a25))) || ((a25 == 13 && a23 <= 312) && a29 <= 245)) || ((a4 == 1 && 10 == a25) && a23 + 43 <= 0)) || (((!(a25 == 13) && a29 <= 599998) && a23 + 43 <= 0) && !(10 == a25))) || (((a23 <= 138 || a29 <= 245) && (\exists v_~a29~0_502 : int :: (130 <= v_~a29~0_502 && a29 <= (v_~a29~0_502 + 69157) % 299861 + 300138) && 0 <= v_~a29~0_502 + 69157)) && a4 == 1)) || ((306 < a23 && 10 == a25) && 1 == a4) - InvariantResult [Line: 22]: Loop Invariant [2019-11-20 04:07:48,210 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:48,211 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:48,211 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:48,214 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:48,214 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:48,214 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:48,223 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:48,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:48,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:48,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:48,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 04:07:48,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] Derived loop invariant: ((((((((((((((a25 == 13 && a29 + 5 * a23 <= 101230) && 1 == a4) || ((a23 <= 312 && 12 == a25) && a4 == 1)) || (a23 <= 312 && a29 <= 140)) || (((\exists v_~a29~0_502 : int :: (130 <= v_~a29~0_502 && a29 <= (v_~a29~0_502 + 69157) % 299861 + 300138) && 0 <= v_~a29~0_502 + 69157) && 1 == a4) && !(10 == a25))) || (a29 <= 130 && 10 == a25)) || (12 == a25 && a29 <= 275)) || (1 == a4 && a25 == 11)) || (a25 == 9 && 1 == a4)) || ((a29 <= 275 && a23 + 43 <= 0) && !(10 == a25))) || ((a25 == 13 && a23 <= 312) && a29 <= 245)) || ((a4 == 1 && 10 == a25) && a23 + 43 <= 0)) || (((!(a25 == 13) && a29 <= 599998) && a23 + 43 <= 0) && !(10 == a25))) || (((a23 <= 138 || a29 <= 245) && (\exists v_~a29~0_502 : int :: (130 <= v_~a29~0_502 && a29 <= (v_~a29~0_502 + 69157) % 299861 + 300138) && 0 <= v_~a29~0_502 + 69157)) && a4 == 1)) || ((306 < a23 && 10 == a25) && 1 == a4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Result: SAFE, OverallTime: 49.6s, OverallIterations: 14, TraceHistogramMax: 6, AutomataDifference: 34.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.1s, HoareTripleCheckerStatistics: 1976 SDtfs, 10836 SDslu, 944 SDs, 0 SdLazy, 28259 SolverSat, 4459 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1290 GetRequests, 1212 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19967occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 23770 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 250 NumberOfFragments, 359 HoareAnnotationTreeSize, 3 FomulaSimplifications, 34624 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 18156 FormulaSimplificationTreeSizeReductionInter, 2.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 5348 NumberOfCodeBlocks, 5348 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 5330 ConstructedInterpolants, 432 QuantifiedInterpolants, 10143979 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1597 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 18 InterpolantComputations, 11 PerfectInterpolantSequences, 4564/5418 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...