./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label57.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_407d1b38-43e7-44dc-87d5-cedb70c1f811/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_407d1b38-43e7-44dc-87d5-cedb70c1f811/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_407d1b38-43e7-44dc-87d5-cedb70c1f811/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_407d1b38-43e7-44dc-87d5-cedb70c1f811/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label57.c -s /tmp/vcloud-vcloud-master/worker/run_dir_407d1b38-43e7-44dc-87d5-cedb70c1f811/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_407d1b38-43e7-44dc-87d5-cedb70c1f811/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 22c18731806e96bfa852bca51e2e7f8af9799504 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 03:29:17,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 03:29:17,773 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 03:29:17,788 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 03:29:17,789 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 03:29:17,790 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 03:29:17,791 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 03:29:17,800 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 03:29:17,805 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 03:29:17,809 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 03:29:17,810 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 03:29:17,811 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 03:29:17,812 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 03:29:17,814 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 03:29:17,815 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 03:29:17,816 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 03:29:17,817 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 03:29:17,818 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 03:29:17,820 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 03:29:17,824 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 03:29:17,828 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 03:29:17,830 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 03:29:17,833 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 03:29:17,834 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 03:29:17,837 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 03:29:17,837 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 03:29:17,837 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 03:29:17,839 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 03:29:17,839 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 03:29:17,840 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 03:29:17,841 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 03:29:17,841 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 03:29:17,842 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 03:29:17,843 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 03:29:17,844 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 03:29:17,844 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 03:29:17,845 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 03:29:17,845 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 03:29:17,845 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 03:29:17,846 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 03:29:17,847 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 03:29:17,848 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_407d1b38-43e7-44dc-87d5-cedb70c1f811/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 03:29:17,872 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 03:29:17,882 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 03:29:17,883 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 03:29:17,883 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 03:29:17,883 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 03:29:17,884 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 03:29:17,884 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 03:29:17,884 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 03:29:17,884 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 03:29:17,884 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 03:29:17,885 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 03:29:17,885 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 03:29:17,885 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 03:29:17,885 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 03:29:17,886 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 03:29:17,887 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 03:29:17,887 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 03:29:17,887 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 03:29:17,887 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 03:29:17,888 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 03:29:17,888 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 03:29:17,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:29:17,889 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 03:29:17,889 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 03:29:17,889 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 03:29:17,889 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 03:29:17,889 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 03:29:17,890 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 03:29:17,890 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_407d1b38-43e7-44dc-87d5-cedb70c1f811/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 -> 22c18731806e96bfa852bca51e2e7f8af9799504 [2019-11-20 03:29:18,052 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 03:29:18,063 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 03:29:18,066 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 03:29:18,068 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 03:29:18,068 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 03:29:18,069 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_407d1b38-43e7-44dc-87d5-cedb70c1f811/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem11_label57.c [2019-11-20 03:29:18,132 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_407d1b38-43e7-44dc-87d5-cedb70c1f811/bin/uautomizer/data/23a468d95/84db94767e7b4a758a39212f4a2006c4/FLAG65fd943e7 [2019-11-20 03:29:18,663 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 03:29:18,664 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_407d1b38-43e7-44dc-87d5-cedb70c1f811/sv-benchmarks/c/eca-rers2012/Problem11_label57.c [2019-11-20 03:29:18,678 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_407d1b38-43e7-44dc-87d5-cedb70c1f811/bin/uautomizer/data/23a468d95/84db94767e7b4a758a39212f4a2006c4/FLAG65fd943e7 [2019-11-20 03:29:19,140 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_407d1b38-43e7-44dc-87d5-cedb70c1f811/bin/uautomizer/data/23a468d95/84db94767e7b4a758a39212f4a2006c4 [2019-11-20 03:29:19,143 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 03:29:19,144 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 03:29:19,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 03:29:19,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 03:29:19,149 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 03:29:19,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:29:19" (1/1) ... [2019-11-20 03:29:19,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46ab6543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:29:19, skipping insertion in model container [2019-11-20 03:29:19,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:29:19" (1/1) ... [2019-11-20 03:29:19,160 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 03:29:19,231 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 03:29:19,792 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:29:19,796 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 03:29:19,949 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:29:19,964 INFO L192 MainTranslator]: Completed translation [2019-11-20 03:29:19,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:29:19 WrapperNode [2019-11-20 03:29:19,964 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 03:29:19,965 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 03:29:19,965 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 03:29:19,965 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 03:29:19,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:29:19" (1/1) ... [2019-11-20 03:29:19,993 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:29:19" (1/1) ... [2019-11-20 03:29:20,070 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 03:29:20,071 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 03:29:20,071 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 03:29:20,071 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 03:29:20,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:29:19" (1/1) ... [2019-11-20 03:29:20,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:29:19" (1/1) ... [2019-11-20 03:29:20,089 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:29:19" (1/1) ... [2019-11-20 03:29:20,089 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:29:19" (1/1) ... [2019-11-20 03:29:20,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:29:19" (1/1) ... [2019-11-20 03:29:20,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:29:19" (1/1) ... [2019-11-20 03:29:20,149 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:29:19" (1/1) ... [2019-11-20 03:29:20,166 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 03:29:20,167 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 03:29:20,167 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 03:29:20,167 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 03:29:20,168 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:29:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_407d1b38-43e7-44dc-87d5-cedb70c1f811/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 03:29:20,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 03:29:20,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 03:29:22,194 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 03:29:22,195 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 03:29:22,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:29:22 BoogieIcfgContainer [2019-11-20 03:29:22,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 03:29:22,197 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 03:29:22,197 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 03:29:22,200 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 03:29:22,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:29:19" (1/3) ... [2019-11-20 03:29:22,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51361e4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:29:22, skipping insertion in model container [2019-11-20 03:29:22,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:29:19" (2/3) ... [2019-11-20 03:29:22,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51361e4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:29:22, skipping insertion in model container [2019-11-20 03:29:22,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:29:22" (3/3) ... [2019-11-20 03:29:22,203 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label57.c [2019-11-20 03:29:22,212 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 03:29:22,219 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 03:29:22,229 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 03:29:22,254 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 03:29:22,255 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 03:29:22,255 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 03:29:22,255 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 03:29:22,255 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 03:29:22,255 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 03:29:22,256 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 03:29:22,256 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 03:29:22,291 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-11-20 03:29:22,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-20 03:29:22,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:29:22,301 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:29:22,302 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:29:22,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:29:22,307 INFO L82 PathProgramCache]: Analyzing trace with hash 291089130, now seen corresponding path program 1 times [2019-11-20 03:29:22,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:29:22,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428746399] [2019-11-20 03:29:22,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:29:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:29:22,680 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 03:29:22,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428746399] [2019-11-20 03:29:22,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:29:22,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:29:22,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448235572] [2019-11-20 03:29:22,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:29:22,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:29:22,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:29:22,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:29:22,703 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-11-20 03:29:24,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:29:24,919 INFO L93 Difference]: Finished difference Result 966 states and 1746 transitions. [2019-11-20 03:29:24,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:29:24,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-11-20 03:29:24,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:29:24,940 INFO L225 Difference]: With dead ends: 966 [2019-11-20 03:29:24,940 INFO L226 Difference]: Without dead ends: 616 [2019-11-20 03:29:24,944 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:29:24,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-11-20 03:29:25,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 600. [2019-11-20 03:29:25,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-11-20 03:29:25,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 910 transitions. [2019-11-20 03:29:25,024 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 910 transitions. Word has length 46 [2019-11-20 03:29:25,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:29:25,024 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 910 transitions. [2019-11-20 03:29:25,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:29:25,024 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 910 transitions. [2019-11-20 03:29:25,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 03:29:25,030 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:29:25,030 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:29:25,030 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:29:25,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:29:25,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1553487167, now seen corresponding path program 1 times [2019-11-20 03:29:25,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:29:25,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680972599] [2019-11-20 03:29:25,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:29:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:29:25,206 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:29:25,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680972599] [2019-11-20 03:29:25,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:29:25,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:29:25,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508255051] [2019-11-20 03:29:25,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:29:25,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:29:25,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:29:25,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:29:25,209 INFO L87 Difference]: Start difference. First operand 600 states and 910 transitions. Second operand 4 states. [2019-11-20 03:29:26,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:29:26,847 INFO L93 Difference]: Finished difference Result 2309 states and 3522 transitions. [2019-11-20 03:29:26,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:29:26,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-11-20 03:29:26,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:29:26,858 INFO L225 Difference]: With dead ends: 2309 [2019-11-20 03:29:26,858 INFO L226 Difference]: Without dead ends: 1711 [2019-11-20 03:29:26,864 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 03:29:26,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2019-11-20 03:29:26,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1527. [2019-11-20 03:29:26,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1527 states. [2019-11-20 03:29:26,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2032 transitions. [2019-11-20 03:29:26,935 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 2032 transitions. Word has length 117 [2019-11-20 03:29:26,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:29:26,937 INFO L462 AbstractCegarLoop]: Abstraction has 1527 states and 2032 transitions. [2019-11-20 03:29:26,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:29:26,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 2032 transitions. [2019-11-20 03:29:26,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-20 03:29:26,946 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:29:26,947 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, 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] [2019-11-20 03:29:26,947 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:29:26,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:29:26,947 INFO L82 PathProgramCache]: Analyzing trace with hash 624671770, now seen corresponding path program 1 times [2019-11-20 03:29:26,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:29:26,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341874248] [2019-11-20 03:29:26,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:29:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:29:27,131 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:29:27,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341874248] [2019-11-20 03:29:27,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:29:27,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:29:27,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826826956] [2019-11-20 03:29:27,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:29:27,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:29:27,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:29:27,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:29:27,137 INFO L87 Difference]: Start difference. First operand 1527 states and 2032 transitions. Second operand 4 states. [2019-11-20 03:29:28,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:29:28,899 INFO L93 Difference]: Finished difference Result 5088 states and 6913 transitions. [2019-11-20 03:29:28,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:29:28,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-11-20 03:29:28,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:29:28,918 INFO L225 Difference]: With dead ends: 5088 [2019-11-20 03:29:28,918 INFO L226 Difference]: Without dead ends: 3563 [2019-11-20 03:29:28,921 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 03:29:28,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3563 states. [2019-11-20 03:29:28,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3563 to 2447. [2019-11-20 03:29:28,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2447 states. [2019-11-20 03:29:28,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 3065 transitions. [2019-11-20 03:29:28,978 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 3065 transitions. Word has length 130 [2019-11-20 03:29:28,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:29:28,978 INFO L462 AbstractCegarLoop]: Abstraction has 2447 states and 3065 transitions. [2019-11-20 03:29:28,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:29:28,979 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 3065 transitions. [2019-11-20 03:29:28,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-20 03:29:28,980 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:29:28,980 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, 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] [2019-11-20 03:29:28,981 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:29:28,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:29:28,981 INFO L82 PathProgramCache]: Analyzing trace with hash 383208159, now seen corresponding path program 1 times [2019-11-20 03:29:28,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:29:28,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954502348] [2019-11-20 03:29:28,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:29:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:29:29,205 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:29:29,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954502348] [2019-11-20 03:29:29,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:29:29,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:29:29,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893491229] [2019-11-20 03:29:29,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 03:29:29,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:29:29,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 03:29:29,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:29:29,209 INFO L87 Difference]: Start difference. First operand 2447 states and 3065 transitions. Second operand 5 states. [2019-11-20 03:29:31,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:29:31,237 INFO L93 Difference]: Finished difference Result 8049 states and 10315 transitions. [2019-11-20 03:29:31,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:29:31,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 173 [2019-11-20 03:29:31,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:29:31,267 INFO L225 Difference]: With dead ends: 8049 [2019-11-20 03:29:31,267 INFO L226 Difference]: Without dead ends: 5788 [2019-11-20 03:29:31,271 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 03:29:31,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5788 states. [2019-11-20 03:29:31,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5788 to 5787. [2019-11-20 03:29:31,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5787 states. [2019-11-20 03:29:31,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5787 states to 5787 states and 7107 transitions. [2019-11-20 03:29:31,386 INFO L78 Accepts]: Start accepts. Automaton has 5787 states and 7107 transitions. Word has length 173 [2019-11-20 03:29:31,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:29:31,388 INFO L462 AbstractCegarLoop]: Abstraction has 5787 states and 7107 transitions. [2019-11-20 03:29:31,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 03:29:31,388 INFO L276 IsEmpty]: Start isEmpty. Operand 5787 states and 7107 transitions. [2019-11-20 03:29:31,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-11-20 03:29:31,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:29:31,398 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, 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, 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] [2019-11-20 03:29:31,398 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:29:31,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:29:31,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1602503085, now seen corresponding path program 1 times [2019-11-20 03:29:31,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:29:31,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356637558] [2019-11-20 03:29:31,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:29:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:29:31,641 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-20 03:29:31,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356637558] [2019-11-20 03:29:31,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:29:31,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:29:31,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590326617] [2019-11-20 03:29:31,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:29:31,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:29:31,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:29:31,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:29:31,643 INFO L87 Difference]: Start difference. First operand 5787 states and 7107 transitions. Second operand 4 states. [2019-11-20 03:29:33,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:29:33,183 INFO L93 Difference]: Finished difference Result 13801 states and 17074 transitions. [2019-11-20 03:29:33,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:29:33,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 309 [2019-11-20 03:29:33,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:29:33,222 INFO L225 Difference]: With dead ends: 13801 [2019-11-20 03:29:33,223 INFO L226 Difference]: Without dead ends: 8200 [2019-11-20 03:29:33,230 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 03:29:33,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8200 states. [2019-11-20 03:29:33,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8200 to 7995. [2019-11-20 03:29:33,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7995 states. [2019-11-20 03:29:33,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7995 states to 7995 states and 9579 transitions. [2019-11-20 03:29:33,381 INFO L78 Accepts]: Start accepts. Automaton has 7995 states and 9579 transitions. Word has length 309 [2019-11-20 03:29:33,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:29:33,381 INFO L462 AbstractCegarLoop]: Abstraction has 7995 states and 9579 transitions. [2019-11-20 03:29:33,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:29:33,382 INFO L276 IsEmpty]: Start isEmpty. Operand 7995 states and 9579 transitions. [2019-11-20 03:29:33,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-11-20 03:29:33,392 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:29:33,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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:29:33,393 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:29:33,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:29:33,393 INFO L82 PathProgramCache]: Analyzing trace with hash -606468400, now seen corresponding path program 1 times [2019-11-20 03:29:33,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:29:33,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035634349] [2019-11-20 03:29:33,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:29:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:29:33,610 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2019-11-20 03:29:33,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035634349] [2019-11-20 03:29:33,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:29:33,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:29:33,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950089934] [2019-11-20 03:29:33,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:29:33,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:29:33,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:29:33,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:29:33,612 INFO L87 Difference]: Start difference. First operand 7995 states and 9579 transitions. Second operand 4 states. [2019-11-20 03:29:35,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:29:35,437 INFO L93 Difference]: Finished difference Result 20621 states and 24840 transitions. [2019-11-20 03:29:35,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:29:35,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 332 [2019-11-20 03:29:35,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:29:35,503 INFO L225 Difference]: With dead ends: 20621 [2019-11-20 03:29:35,503 INFO L226 Difference]: Without dead ends: 12812 [2019-11-20 03:29:35,512 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 03:29:35,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12812 states. [2019-11-20 03:29:35,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12812 to 8539. [2019-11-20 03:29:35,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8539 states. [2019-11-20 03:29:35,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8539 states to 8539 states and 10160 transitions. [2019-11-20 03:29:35,704 INFO L78 Accepts]: Start accepts. Automaton has 8539 states and 10160 transitions. Word has length 332 [2019-11-20 03:29:35,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:29:35,706 INFO L462 AbstractCegarLoop]: Abstraction has 8539 states and 10160 transitions. [2019-11-20 03:29:35,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:29:35,707 INFO L276 IsEmpty]: Start isEmpty. Operand 8539 states and 10160 transitions. [2019-11-20 03:29:35,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-11-20 03:29:35,722 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:29:35,723 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:29:35,723 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:29:35,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:29:35,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1478199095, now seen corresponding path program 1 times [2019-11-20 03:29:35,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:29:35,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011832741] [2019-11-20 03:29:35,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:29:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:29:35,985 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2019-11-20 03:29:35,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011832741] [2019-11-20 03:29:35,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:29:35,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:29:35,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228212653] [2019-11-20 03:29:35,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:29:35,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:29:35,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:29:35,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:29:35,995 INFO L87 Difference]: Start difference. First operand 8539 states and 10160 transitions. Second operand 3 states. [2019-11-20 03:29:37,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:29:37,148 INFO L93 Difference]: Finished difference Result 17255 states and 20563 transitions. [2019-11-20 03:29:37,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:29:37,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 338 [2019-11-20 03:29:37,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:29:37,167 INFO L225 Difference]: With dead ends: 17255 [2019-11-20 03:29:37,167 INFO L226 Difference]: Without dead ends: 9826 [2019-11-20 03:29:37,177 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 03:29:37,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9826 states. [2019-11-20 03:29:37,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9826 to 6874. [2019-11-20 03:29:37,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6874 states. [2019-11-20 03:29:37,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6874 states to 6874 states and 8202 transitions. [2019-11-20 03:29:37,289 INFO L78 Accepts]: Start accepts. Automaton has 6874 states and 8202 transitions. Word has length 338 [2019-11-20 03:29:37,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:29:37,290 INFO L462 AbstractCegarLoop]: Abstraction has 6874 states and 8202 transitions. [2019-11-20 03:29:37,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:29:37,290 INFO L276 IsEmpty]: Start isEmpty. Operand 6874 states and 8202 transitions. [2019-11-20 03:29:37,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-11-20 03:29:37,302 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:29:37,303 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 03:29:37,303 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:29:37,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:29:37,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1497380334, now seen corresponding path program 1 times [2019-11-20 03:29:37,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:29:37,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701955351] [2019-11-20 03:29:37,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:29:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:29:37,715 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:29:37,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701955351] [2019-11-20 03:29:37,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:29:37,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 03:29:37,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266967223] [2019-11-20 03:29:37,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 03:29:37,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:29:37,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 03:29:37,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:29:37,718 INFO L87 Difference]: Start difference. First operand 6874 states and 8202 transitions. Second operand 5 states. [2019-11-20 03:29:40,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:29:40,074 INFO L93 Difference]: Finished difference Result 19096 states and 23065 transitions. [2019-11-20 03:29:40,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:29:40,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 351 [2019-11-20 03:29:40,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:29:40,095 INFO L225 Difference]: With dead ends: 19096 [2019-11-20 03:29:40,095 INFO L226 Difference]: Without dead ends: 12408 [2019-11-20 03:29:40,103 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 03:29:40,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12408 states. [2019-11-20 03:29:40,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12408 to 9998. [2019-11-20 03:29:40,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9998 states. [2019-11-20 03:29:40,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9998 states to 9998 states and 12013 transitions. [2019-11-20 03:29:40,245 INFO L78 Accepts]: Start accepts. Automaton has 9998 states and 12013 transitions. Word has length 351 [2019-11-20 03:29:40,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:29:40,246 INFO L462 AbstractCegarLoop]: Abstraction has 9998 states and 12013 transitions. [2019-11-20 03:29:40,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 03:29:40,246 INFO L276 IsEmpty]: Start isEmpty. Operand 9998 states and 12013 transitions. [2019-11-20 03:29:40,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2019-11-20 03:29:40,270 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:29:40,271 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 03:29:40,271 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:29:40,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:29:40,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1603876004, now seen corresponding path program 1 times [2019-11-20 03:29:40,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:29:40,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818153903] [2019-11-20 03:29:40,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:29:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:29:40,916 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 435 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-20 03:29:40,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818153903] [2019-11-20 03:29:40,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3525313] [2019-11-20 03:29:40,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_407d1b38-43e7-44dc-87d5-cedb70c1f811/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 03:29:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:29:41,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 03:29:41,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:29:41,471 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 438 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-20 03:29:41,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 03:29:41,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-20 03:29:41,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211878857] [2019-11-20 03:29:41,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:29:41,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:29:41,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:29:41,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 03:29:41,474 INFO L87 Difference]: Start difference. First operand 9998 states and 12013 transitions. Second operand 4 states. [2019-11-20 03:29:43,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:29:43,148 INFO L93 Difference]: Finished difference Result 21462 states and 25948 transitions. [2019-11-20 03:29:43,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:29:43,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 456 [2019-11-20 03:29:43,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:29:43,165 INFO L225 Difference]: With dead ends: 21462 [2019-11-20 03:29:43,166 INFO L226 Difference]: Without dead ends: 9994 [2019-11-20 03:29:43,179 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 03:29:43,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9994 states. [2019-11-20 03:29:43,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9994 to 8334. [2019-11-20 03:29:43,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8334 states. [2019-11-20 03:29:43,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8334 states to 8334 states and 9404 transitions. [2019-11-20 03:29:43,345 INFO L78 Accepts]: Start accepts. Automaton has 8334 states and 9404 transitions. Word has length 456 [2019-11-20 03:29:43,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:29:43,345 INFO L462 AbstractCegarLoop]: Abstraction has 8334 states and 9404 transitions. [2019-11-20 03:29:43,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:29:43,346 INFO L276 IsEmpty]: Start isEmpty. Operand 8334 states and 9404 transitions. [2019-11-20 03:29:43,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2019-11-20 03:29:43,368 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:29:43,368 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, 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, 3, 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, 1, 1, 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 03:29:43,572 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:29:43,572 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:29:43,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:29:43,573 INFO L82 PathProgramCache]: Analyzing trace with hash -734371707, now seen corresponding path program 1 times [2019-11-20 03:29:43,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:29:43,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718260315] [2019-11-20 03:29:43,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:29:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:29:44,100 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 611 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 03:29:44,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718260315] [2019-11-20 03:29:44,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:29:44,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:29:44,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911621314] [2019-11-20 03:29:44,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:29:44,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:29:44,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:29:44,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:29:44,104 INFO L87 Difference]: Start difference. First operand 8334 states and 9404 transitions. Second operand 4 states. [2019-11-20 03:29:45,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:29:45,790 INFO L93 Difference]: Finished difference Result 17602 states and 19905 transitions. [2019-11-20 03:29:45,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:29:45,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 505 [2019-11-20 03:29:45,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:29:45,810 INFO L225 Difference]: With dead ends: 17602 [2019-11-20 03:29:45,810 INFO L226 Difference]: Without dead ends: 9083 [2019-11-20 03:29:45,819 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 03:29:45,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9083 states. [2019-11-20 03:29:45,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9083 to 8700. [2019-11-20 03:29:45,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8700 states. [2019-11-20 03:29:45,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8700 states to 8700 states and 9703 transitions. [2019-11-20 03:29:45,923 INFO L78 Accepts]: Start accepts. Automaton has 8700 states and 9703 transitions. Word has length 505 [2019-11-20 03:29:45,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:29:45,924 INFO L462 AbstractCegarLoop]: Abstraction has 8700 states and 9703 transitions. [2019-11-20 03:29:45,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:29:45,924 INFO L276 IsEmpty]: Start isEmpty. Operand 8700 states and 9703 transitions. [2019-11-20 03:29:45,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2019-11-20 03:29:45,947 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:29:45,947 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, 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, 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, 1, 1, 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 03:29:45,947 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:29:45,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:29:45,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1159225603, now seen corresponding path program 1 times [2019-11-20 03:29:45,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:29:45,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364533345] [2019-11-20 03:29:45,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:29:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:29:46,622 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 403 proven. 382 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:29:46,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364533345] [2019-11-20 03:29:46,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985739067] [2019-11-20 03:29:46,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_407d1b38-43e7-44dc-87d5-cedb70c1f811/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 03:29:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:29:46,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-20 03:29:46,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:29:47,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:29:47,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:29:47,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:29:47,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:29:48,414 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 453 proven. 236 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-20 03:29:48,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:29:48,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 14 [2019-11-20 03:29:48,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897847432] [2019-11-20 03:29:48,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 03:29:48,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:29:48,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 03:29:48,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-11-20 03:29:48,419 INFO L87 Difference]: Start difference. First operand 8700 states and 9703 transitions. Second operand 14 states. [2019-11-20 03:30:00,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:30:00,299 INFO L93 Difference]: Finished difference Result 27949 states and 31001 transitions. [2019-11-20 03:30:00,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-11-20 03:30:00,300 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 522 [2019-11-20 03:30:00,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:30:00,326 INFO L225 Difference]: With dead ends: 27949 [2019-11-20 03:30:00,326 INFO L226 Difference]: Without dead ends: 18135 [2019-11-20 03:30:00,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 596 GetRequests, 551 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=563, Invalid=1599, Unknown=0, NotChecked=0, Total=2162 [2019-11-20 03:30:00,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18135 states. [2019-11-20 03:30:00,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18135 to 9248. [2019-11-20 03:30:00,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9248 states. [2019-11-20 03:30:00,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9248 states to 9248 states and 10126 transitions. [2019-11-20 03:30:00,489 INFO L78 Accepts]: Start accepts. Automaton has 9248 states and 10126 transitions. Word has length 522 [2019-11-20 03:30:00,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:30:00,489 INFO L462 AbstractCegarLoop]: Abstraction has 9248 states and 10126 transitions. [2019-11-20 03:30:00,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 03:30:00,490 INFO L276 IsEmpty]: Start isEmpty. Operand 9248 states and 10126 transitions. [2019-11-20 03:30:00,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2019-11-20 03:30:00,518 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:30:00,519 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-11-20 03:30:00,723 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:30:00,724 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:30:00,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:30:00,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1524195677, now seen corresponding path program 1 times [2019-11-20 03:30:00,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:30:00,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938346173] [2019-11-20 03:30:00,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:30:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:30:01,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1309 backedges. 647 proven. 0 refuted. 0 times theorem prover too weak. 662 trivial. 0 not checked. [2019-11-20 03:30:01,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938346173] [2019-11-20 03:30:01,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:30:01,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:30:01,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544728250] [2019-11-20 03:30:01,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:30:01,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:30:01,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:30:01,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:30:01,216 INFO L87 Difference]: Start difference. First operand 9248 states and 10126 transitions. Second operand 3 states. [2019-11-20 03:30:02,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:30:02,020 INFO L93 Difference]: Finished difference Result 18859 states and 20602 transitions. [2019-11-20 03:30:02,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:30:02,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 685 [2019-11-20 03:30:02,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:30:02,021 INFO L225 Difference]: With dead ends: 18859 [2019-11-20 03:30:02,022 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 03:30:02,026 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 03:30:02,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 03:30:02,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 03:30:02,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 03:30:02,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 03:30:02,027 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 685 [2019-11-20 03:30:02,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:30:02,027 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 03:30:02,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:30:02,028 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 03:30:02,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 03:30:02,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 03:30:02,618 WARN L191 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 370 DAG size of output: 309 [2019-11-20 03:30:03,158 WARN L191 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 370 DAG size of output: 309 [2019-11-20 03:30:05,538 WARN L191 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 297 DAG size of output: 114 [2019-11-20 03:30:07,638 WARN L191 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 297 DAG size of output: 114 [2019-11-20 03:30:07,641 INFO L444 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-20 03:30:07,641 INFO L444 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-11-20 03:30:07,641 INFO L444 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-11-20 03:30:07,641 INFO L447 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-11-20 03:30:07,641 INFO L444 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,641 INFO L444 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,641 INFO L444 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,641 INFO L444 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,641 INFO L444 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,642 INFO L444 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,642 INFO L444 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,642 INFO L444 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-20 03:30:07,642 INFO L444 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-11-20 03:30:07,642 INFO L444 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-20 03:30:07,642 INFO L444 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,642 INFO L444 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,642 INFO L444 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,642 INFO L444 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,642 INFO L444 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,642 INFO L444 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,642 INFO L444 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,642 INFO L444 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,642 INFO L444 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,642 INFO L444 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-11-20 03:30:07,643 INFO L444 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-20 03:30:07,643 INFO L444 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-11-20 03:30:07,643 INFO L444 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,643 INFO L440 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse22 (= 12 ~a25~0))) (let ((.cse10 (= ~a25~0 13)) (.cse23 (<= ~a4~0 0)) (.cse9 (= 10 ~a25~0)) (.cse25 (<= ~a29~0 140)) (.cse14 (< 306 ~a23~0)) (.cse5 (<= ~a23~0 138)) (.cse24 (<= ~a25~0 9)) (.cse18 (<= ~a29~0 277)) (.cse4 (= 1 ~a4~0)) (.cse3 (not .cse22)) (.cse21 (< 138 ~a23~0)) (.cse19 (<= 312 ~a23~0))) (let ((.cse2 (<= ~a29~0 245)) (.cse11 (let ((.cse28 (<= ~a23~0 312))) (or (and .cse3 .cse28 .cse21) (and .cse28 .cse19)))) (.cse8 (and .cse24 .cse18 .cse4)) (.cse12 (<= ~a29~0 599928)) (.cse13 (= ~a25~0 11)) (.cse7 (or .cse14 .cse5)) (.cse6 (<= (+ ~a29~0 92) 0)) (.cse15 (let ((.cse27 (and .cse9 .cse25))) (or (and .cse23 .cse27) (and .cse5 .cse27)))) (.cse16 (not .cse10)) (.cse20 (exists ((v_~a29~0_500 Int)) (and (< 277 v_~a29~0_500) (<= ~a29~0 (+ (mod v_~a29~0_500 299861) 300139)) (<= 0 v_~a29~0_500)))) (.cse0 (= 1 ~a3~0)) (.cse1 (= 15 ~a8~0)) (.cse17 (<= (+ ~a23~0 43) 0)) (.cse26 (not (= ~a4~0 1)))) (or (and .cse0 .cse1 .cse2 (and .cse3 .cse4)) (and .cse5 .cse6) (and .cse7 .cse2 .cse8) (and .cse9 .cse2 .cse4) (and .cse10 (<= ~a23~0 306) .cse11 .cse2 .cse4) (and .cse12 .cse0 .cse1 .cse4 .cse13) (and .cse12 (<= 13 ~a25~0) .cse0 .cse14 .cse1 .cse4) (and .cse10 .cse12 .cse0 .cse11 .cse1 .cse4) (and .cse15 .cse7) (and .cse3 .cse12 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse4 .cse14) (and (or .cse3 .cse19) .cse6 .cse7 .cse4) (and (<= ~a29~0 220) .cse8) (and .cse14 .cse20 .cse0 .cse1 .cse4 .cse13) (and .cse12 .cse5 .cse13) (and (<= ~a29~0 599998) .cse5 .cse4 .cse13) (and .cse5 .cse9 .cse4) (and .cse0 (exists ((v_~a29~0_500 Int)) (and (< 277 v_~a29~0_500) (<= (+ ~a29~0 299881) (mod v_~a29~0_500 299861)) (<= 0 v_~a29~0_500))) .cse1 .cse4 .cse21) (and .cse20 .cse0 .cse7 .cse9 .cse1 .cse4) (and .cse6 .cse15) (and .cse22 .cse23 .cse18) (and .cse24 .cse5 .cse4) (or (and .cse3 (<= (+ ~a29~0 22) 0) .cse5) (and .cse25 .cse16 .cse5 .cse26)) (and .cse20 .cse0 .cse24 .cse1 .cse4) (and .cse3 .cse18 .cse17) (and (and .cse22 .cse5 .cse26) .cse18))))) [2019-11-20 03:30:07,643 INFO L444 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,643 INFO L444 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,643 INFO L444 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,643 INFO L444 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,643 INFO L444 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,643 INFO L444 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,644 INFO L444 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,644 INFO L444 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,644 INFO L444 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-11-20 03:30:07,644 INFO L444 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-11-20 03:30:07,644 INFO L444 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-11-20 03:30:07,644 INFO L444 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-11-20 03:30:07,644 INFO L444 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-11-20 03:30:07,644 INFO L444 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-11-20 03:30:07,644 INFO L444 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-11-20 03:30:07,644 INFO L444 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,644 INFO L444 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,644 INFO L444 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,644 INFO L444 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,645 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,645 INFO L444 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,645 INFO L444 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,645 INFO L444 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,645 INFO L444 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,645 INFO L444 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,645 INFO L444 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-11-20 03:30:07,645 INFO L444 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-11-20 03:30:07,645 INFO L444 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-11-20 03:30:07,646 INFO L444 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-11-20 03:30:07,646 INFO L444 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,646 INFO L444 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,646 INFO L444 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,646 INFO L444 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,646 INFO L444 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,646 INFO L444 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-11-20 03:30:07,647 INFO L444 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-11-20 03:30:07,647 INFO L444 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-20 03:30:07,647 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,647 INFO L444 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,647 INFO L444 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,647 INFO L444 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,647 INFO L444 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-11-20 03:30:07,648 INFO L444 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-11-20 03:30:07,648 INFO L444 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,648 INFO L444 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,648 INFO L444 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,648 INFO L444 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,648 INFO L444 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,648 INFO L444 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,649 INFO L444 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-11-20 03:30:07,649 INFO L444 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-11-20 03:30:07,649 INFO L444 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,649 INFO L444 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,649 INFO L444 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-20 03:30:07,649 INFO L444 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-20 03:30:07,649 INFO L444 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-11-20 03:30:07,649 INFO L444 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,649 INFO L444 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,649 INFO L444 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,649 INFO L444 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,649 INFO L444 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,649 INFO L444 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,649 INFO L444 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,650 INFO L444 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-11-20 03:30:07,650 INFO L444 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-11-20 03:30:07,650 INFO L444 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-11-20 03:30:07,650 INFO L444 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-11-20 03:30:07,650 INFO L444 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-11-20 03:30:07,650 INFO L444 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-11-20 03:30:07,650 INFO L444 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-11-20 03:30:07,650 INFO L444 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,650 INFO L444 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,650 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 03:30:07,650 INFO L444 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-11-20 03:30:07,650 INFO L444 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-11-20 03:30:07,650 INFO L444 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,650 INFO L444 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,651 INFO L444 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,651 INFO L444 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,651 INFO L444 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,651 INFO L444 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-11-20 03:30:07,651 INFO L444 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-11-20 03:30:07,651 INFO L444 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-11-20 03:30:07,651 INFO L444 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,651 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,652 INFO L444 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,652 INFO L444 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,652 INFO L444 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,652 INFO L444 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,652 INFO L444 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-11-20 03:30:07,652 INFO L444 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-11-20 03:30:07,652 INFO L444 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-11-20 03:30:07,653 INFO L444 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,653 INFO L444 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,653 INFO L444 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,653 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,653 INFO L444 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,653 INFO L444 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,653 INFO L444 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,654 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 03:30:07,654 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 144) no Hoare annotation was computed. [2019-11-20 03:30:07,654 INFO L444 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,654 INFO L444 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-11-20 03:30:07,654 INFO L444 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-11-20 03:30:07,654 INFO L444 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-11-20 03:30:07,654 INFO L444 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,655 INFO L444 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,655 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,655 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,655 INFO L444 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,655 INFO L444 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,655 INFO L444 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,655 INFO L444 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,656 INFO L444 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,656 INFO L444 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,656 INFO L444 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,656 INFO L444 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-11-20 03:30:07,656 INFO L444 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-11-20 03:30:07,656 INFO L444 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-20 03:30:07,657 INFO L444 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-11-20 03:30:07,657 INFO L444 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-20 03:30:07,657 INFO L444 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,657 INFO L444 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,657 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,657 INFO L444 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,657 INFO L444 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,658 INFO L444 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,658 INFO L444 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,658 INFO L444 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-11-20 03:30:07,658 INFO L444 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-20 03:30:07,658 INFO L444 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-11-20 03:30:07,658 INFO L444 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,658 INFO L444 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,658 INFO L444 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,659 INFO L444 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-11-20 03:30:07,659 INFO L444 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-11-20 03:30:07,659 INFO L444 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,659 INFO L444 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,659 INFO L444 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,659 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,659 INFO L444 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,660 INFO L444 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-11-20 03:30:07,660 INFO L444 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-11-20 03:30:07,660 INFO L444 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,660 INFO L444 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,660 INFO L444 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-11-20 03:30:07,660 INFO L444 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-11-20 03:30:07,661 INFO L444 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,661 INFO L444 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,661 INFO L444 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,661 INFO L444 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,661 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,661 INFO L444 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,661 INFO L444 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-11-20 03:30:07,662 INFO L444 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-11-20 03:30:07,662 INFO L444 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-11-20 03:30:07,662 INFO L444 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-11-20 03:30:07,662 INFO L444 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,662 INFO L444 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,662 INFO L444 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,662 INFO L444 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,663 INFO L444 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,663 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,663 INFO L444 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,663 INFO L444 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,663 INFO L444 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-11-20 03:30:07,663 INFO L444 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-11-20 03:30:07,663 INFO L444 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-11-20 03:30:07,664 INFO L444 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-11-20 03:30:07,664 INFO L444 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-11-20 03:30:07,664 INFO L444 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-11-20 03:30:07,664 INFO L444 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,664 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,664 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,664 INFO L444 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,665 INFO L444 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,665 INFO L444 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,665 INFO L444 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,665 INFO L444 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-20 03:30:07,665 INFO L444 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-11-20 03:30:07,665 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 03:30:07,665 INFO L444 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,666 INFO L444 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,666 INFO L444 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,666 INFO L444 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,666 INFO L444 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,666 INFO L444 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,666 INFO L444 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-11-20 03:30:07,666 INFO L444 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-11-20 03:30:07,667 INFO L444 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,667 INFO L444 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,667 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,667 INFO L444 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,667 INFO L444 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,667 INFO L444 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,667 INFO L444 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,668 INFO L444 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-11-20 03:30:07,668 INFO L444 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,668 INFO L444 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,668 INFO L444 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,668 INFO L444 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-11-20 03:30:07,668 INFO L444 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-11-20 03:30:07,668 INFO L444 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-11-20 03:30:07,669 INFO L444 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,669 INFO L444 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-11-20 03:30:07,669 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,669 INFO L444 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-11-20 03:30:07,669 INFO L444 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,669 INFO L444 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,669 INFO L444 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,670 INFO L444 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,670 INFO L444 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,670 INFO L444 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,670 INFO L444 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-11-20 03:30:07,670 INFO L444 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-11-20 03:30:07,670 INFO L444 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-11-20 03:30:07,670 INFO L444 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,671 INFO L444 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,671 INFO L444 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,671 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 03:30:07,671 INFO L444 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,671 INFO L444 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,671 INFO L444 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,671 INFO L444 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,672 INFO L444 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,672 INFO L444 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,672 INFO L444 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,672 INFO L444 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-11-20 03:30:07,672 INFO L444 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-11-20 03:30:07,672 INFO L444 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-11-20 03:30:07,672 INFO L444 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,673 INFO L444 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-11-20 03:30:07,673 INFO L444 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-11-20 03:30:07,673 INFO L444 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,673 INFO L444 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,673 INFO L444 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,673 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,673 INFO L444 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,674 INFO L444 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,674 INFO L444 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-11-20 03:30:07,674 INFO L444 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-20 03:30:07,674 INFO L444 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-11-20 03:30:07,674 INFO L444 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,674 INFO L444 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,674 INFO L444 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,675 INFO L440 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse22 (= 12 ~a25~0))) (let ((.cse10 (= ~a25~0 13)) (.cse23 (<= ~a4~0 0)) (.cse9 (= 10 ~a25~0)) (.cse25 (<= ~a29~0 140)) (.cse14 (< 306 ~a23~0)) (.cse5 (<= ~a23~0 138)) (.cse24 (<= ~a25~0 9)) (.cse18 (<= ~a29~0 277)) (.cse4 (= 1 ~a4~0)) (.cse3 (not .cse22)) (.cse21 (< 138 ~a23~0)) (.cse19 (<= 312 ~a23~0))) (let ((.cse2 (<= ~a29~0 245)) (.cse11 (let ((.cse28 (<= ~a23~0 312))) (or (and .cse3 .cse28 .cse21) (and .cse28 .cse19)))) (.cse8 (and .cse24 .cse18 .cse4)) (.cse12 (<= ~a29~0 599928)) (.cse13 (= ~a25~0 11)) (.cse7 (or .cse14 .cse5)) (.cse6 (<= (+ ~a29~0 92) 0)) (.cse15 (let ((.cse27 (and .cse9 .cse25))) (or (and .cse23 .cse27) (and .cse5 .cse27)))) (.cse16 (not .cse10)) (.cse20 (exists ((v_~a29~0_500 Int)) (and (< 277 v_~a29~0_500) (<= ~a29~0 (+ (mod v_~a29~0_500 299861) 300139)) (<= 0 v_~a29~0_500)))) (.cse0 (= 1 ~a3~0)) (.cse1 (= 15 ~a8~0)) (.cse17 (<= (+ ~a23~0 43) 0)) (.cse26 (not (= ~a4~0 1)))) (or (and .cse0 .cse1 .cse2 (and .cse3 .cse4)) (and .cse5 .cse6) (and .cse7 .cse2 .cse8) (and .cse9 .cse2 .cse4) (and .cse10 (<= ~a23~0 306) .cse11 .cse2 .cse4) (and .cse12 .cse0 .cse1 .cse4 .cse13) (and .cse12 (<= 13 ~a25~0) .cse0 .cse14 .cse1 .cse4) (and .cse10 .cse12 .cse0 .cse11 .cse1 .cse4) (and .cse15 .cse7) (and .cse3 .cse12 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse4 .cse14) (and (or .cse3 .cse19) .cse6 .cse7 .cse4) (and (<= ~a29~0 220) .cse8) (and .cse14 .cse20 .cse0 .cse1 .cse4 .cse13) (and .cse12 .cse5 .cse13) (and (<= ~a29~0 599998) .cse5 .cse4 .cse13) (and .cse5 .cse9 .cse4) (and .cse0 (exists ((v_~a29~0_500 Int)) (and (< 277 v_~a29~0_500) (<= (+ ~a29~0 299881) (mod v_~a29~0_500 299861)) (<= 0 v_~a29~0_500))) .cse1 .cse4 .cse21) (and .cse20 .cse0 .cse7 .cse9 .cse1 .cse4) (and .cse6 .cse15) (and .cse22 .cse23 .cse18) (and .cse24 .cse5 .cse4) (or (and .cse3 (<= (+ ~a29~0 22) 0) .cse5) (and .cse25 .cse16 .cse5 .cse26)) (and .cse20 .cse0 .cse24 .cse1 .cse4) (and .cse3 .cse18 .cse17) (and (and .cse22 .cse5 .cse26) .cse18))))) [2019-11-20 03:30:07,675 INFO L444 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,675 INFO L444 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-11-20 03:30:07,675 INFO L444 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-11-20 03:30:07,676 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,676 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,676 INFO L444 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-11-20 03:30:07,676 INFO L444 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,676 INFO L444 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,676 INFO L444 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:07,687 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,688 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,688 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,690 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,690 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,690 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,701 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,702 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,702 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,702 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,703 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,703 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,703 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,703 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,704 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,704 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,704 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,705 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 03:30:07 BoogieIcfgContainer [2019-11-20 03:30:07,722 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 03:30:07,722 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 03:30:07,722 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 03:30:07,723 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 03:30:07,723 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:29:22" (3/4) ... [2019-11-20 03:30:07,726 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 03:30:07,750 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 03:30:07,752 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 03:30:07,780 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((1 == a3 && 15 == a8) && a29 <= 245) && !(12 == a25) && 1 == a4) || (a23 <= 138 && a29 + 92 <= 0)) || (((306 < a23 || a23 <= 138) && a29 <= 245) && (a25 <= 9 && a29 <= 277) && 1 == a4)) || ((10 == a25 && a29 <= 245) && 1 == a4)) || ((((a25 == 13 && a23 <= 306) && (((!(12 == a25) && a23 <= 312) && 138 < a23) || (a23 <= 312 && 312 <= a23))) && a29 <= 245) && 1 == a4)) || ((((a29 <= 599928 && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11)) || (((((a29 <= 599928 && 13 <= a25) && 1 == a3) && 306 < a23) && 15 == a8) && 1 == a4)) || (((((a25 == 13 && a29 <= 599928) && 1 == a3) && (((!(12 == a25) && a23 <= 312) && 138 < a23) || (a23 <= 312 && 312 <= a23))) && 15 == a8) && 1 == a4)) || (((a4 <= 0 && 10 == a25 && a29 <= 140) || (a23 <= 138 && 10 == a25 && a29 <= 140)) && (306 < a23 || a23 <= 138))) || (((!(12 == a25) && a29 <= 599928) && !(a25 == 13)) && a23 + 43 <= 0)) || ((((1 == a3 && 15 == a8) && a29 <= 277) && 1 == a4) && 306 < a23)) || ((((!(12 == a25) || 312 <= a23) && a29 + 92 <= 0) && (306 < a23 || a23 <= 138)) && 1 == a4)) || (a29 <= 220 && (a25 <= 9 && a29 <= 277) && 1 == a4)) || (((((306 < a23 && (\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500)) && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11)) || ((a29 <= 599928 && a23 <= 138) && a25 == 11)) || (((a29 <= 599998 && a23 <= 138) && 1 == a4) && a25 == 11)) || ((a23 <= 138 && 10 == a25) && 1 == a4)) || ((((1 == a3 && (\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 + 299881 <= v_~a29~0_500 % 299861) && 0 <= v_~a29~0_500)) && 15 == a8) && 1 == a4) && 138 < a23)) || ((((((\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500) && 1 == a3) && (306 < a23 || a23 <= 138)) && 10 == a25) && 15 == a8) && 1 == a4)) || (a29 + 92 <= 0 && ((a4 <= 0 && 10 == a25 && a29 <= 140) || (a23 <= 138 && 10 == a25 && a29 <= 140)))) || ((12 == a25 && a4 <= 0) && a29 <= 277)) || ((a25 <= 9 && a23 <= 138) && 1 == a4)) || ((!(12 == a25) && a29 + 22 <= 0) && a23 <= 138) || (((a29 <= 140 && !(a25 == 13)) && a23 <= 138) && !(a4 == 1))) || (((((\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500) && 1 == a3) && a25 <= 9) && 15 == a8) && 1 == a4)) || ((!(12 == a25) && a29 <= 277) && a23 + 43 <= 0)) || (((12 == a25 && a23 <= 138) && !(a4 == 1)) && a29 <= 277) [2019-11-20 03:30:07,783 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((1 == a3 && 15 == a8) && a29 <= 245) && !(12 == a25) && 1 == a4) || (a23 <= 138 && a29 + 92 <= 0)) || (((306 < a23 || a23 <= 138) && a29 <= 245) && (a25 <= 9 && a29 <= 277) && 1 == a4)) || ((10 == a25 && a29 <= 245) && 1 == a4)) || ((((a25 == 13 && a23 <= 306) && (((!(12 == a25) && a23 <= 312) && 138 < a23) || (a23 <= 312 && 312 <= a23))) && a29 <= 245) && 1 == a4)) || ((((a29 <= 599928 && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11)) || (((((a29 <= 599928 && 13 <= a25) && 1 == a3) && 306 < a23) && 15 == a8) && 1 == a4)) || (((((a25 == 13 && a29 <= 599928) && 1 == a3) && (((!(12 == a25) && a23 <= 312) && 138 < a23) || (a23 <= 312 && 312 <= a23))) && 15 == a8) && 1 == a4)) || (((a4 <= 0 && 10 == a25 && a29 <= 140) || (a23 <= 138 && 10 == a25 && a29 <= 140)) && (306 < a23 || a23 <= 138))) || (((!(12 == a25) && a29 <= 599928) && !(a25 == 13)) && a23 + 43 <= 0)) || ((((1 == a3 && 15 == a8) && a29 <= 277) && 1 == a4) && 306 < a23)) || ((((!(12 == a25) || 312 <= a23) && a29 + 92 <= 0) && (306 < a23 || a23 <= 138)) && 1 == a4)) || (a29 <= 220 && (a25 <= 9 && a29 <= 277) && 1 == a4)) || (((((306 < a23 && (\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500)) && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11)) || ((a29 <= 599928 && a23 <= 138) && a25 == 11)) || (((a29 <= 599998 && a23 <= 138) && 1 == a4) && a25 == 11)) || ((a23 <= 138 && 10 == a25) && 1 == a4)) || ((((1 == a3 && (\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 + 299881 <= v_~a29~0_500 % 299861) && 0 <= v_~a29~0_500)) && 15 == a8) && 1 == a4) && 138 < a23)) || ((((((\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500) && 1 == a3) && (306 < a23 || a23 <= 138)) && 10 == a25) && 15 == a8) && 1 == a4)) || (a29 + 92 <= 0 && ((a4 <= 0 && 10 == a25 && a29 <= 140) || (a23 <= 138 && 10 == a25 && a29 <= 140)))) || ((12 == a25 && a4 <= 0) && a29 <= 277)) || ((a25 <= 9 && a23 <= 138) && 1 == a4)) || ((!(12 == a25) && a29 + 22 <= 0) && a23 <= 138) || (((a29 <= 140 && !(a25 == 13)) && a23 <= 138) && !(a4 == 1))) || (((((\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500) && 1 == a3) && a25 <= 9) && 15 == a8) && 1 == a4)) || ((!(12 == a25) && a29 <= 277) && a23 + 43 <= 0)) || (((12 == a25 && a23 <= 138) && !(a4 == 1)) && a29 <= 277) [2019-11-20 03:30:07,907 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_407d1b38-43e7-44dc-87d5-cedb70c1f811/bin/uautomizer/witness.graphml [2019-11-20 03:30:07,907 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 03:30:07,909 INFO L168 Benchmark]: Toolchain (without parser) took 48765.04 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 944.7 MB in the beginning and 1.0 GB in the end (delta: -59.1 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-11-20 03:30:07,909 INFO L168 Benchmark]: CDTParser took 0.24 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 03:30:07,909 INFO L168 Benchmark]: CACSL2BoogieTranslator took 819.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -142.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-11-20 03:30:07,910 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-20 03:30:07,910 INFO L168 Benchmark]: Boogie Preprocessor took 95.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-20 03:30:07,911 INFO L168 Benchmark]: RCFGBuilder took 2029.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 881.1 MB in the end (delta: 178.7 MB). Peak memory consumption was 178.7 MB. Max. memory is 11.5 GB. [2019-11-20 03:30:07,911 INFO L168 Benchmark]: TraceAbstraction took 45524.81 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 881.1 MB in the beginning and 1.0 GB in the end (delta: -168.4 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-20 03:30:07,911 INFO L168 Benchmark]: Witness Printer took 185.30 ms. Allocated memory is still 2.6 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. [2019-11-20 03:30:07,913 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 819.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -142.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 105.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 95.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2029.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 881.1 MB in the end (delta: 178.7 MB). Peak memory consumption was 178.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 45524.81 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 881.1 MB in the beginning and 1.0 GB in the end (delta: -168.4 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 185.30 ms. Allocated memory is still 2.6 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 144]: 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 03:30:07,924 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,924 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,925 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,925 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,925 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,926 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,926 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,926 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,926 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,929 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,929 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,930 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,930 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,930 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((1 == a3 && 15 == a8) && a29 <= 245) && !(12 == a25) && 1 == a4) || (a23 <= 138 && a29 + 92 <= 0)) || (((306 < a23 || a23 <= 138) && a29 <= 245) && (a25 <= 9 && a29 <= 277) && 1 == a4)) || ((10 == a25 && a29 <= 245) && 1 == a4)) || ((((a25 == 13 && a23 <= 306) && (((!(12 == a25) && a23 <= 312) && 138 < a23) || (a23 <= 312 && 312 <= a23))) && a29 <= 245) && 1 == a4)) || ((((a29 <= 599928 && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11)) || (((((a29 <= 599928 && 13 <= a25) && 1 == a3) && 306 < a23) && 15 == a8) && 1 == a4)) || (((((a25 == 13 && a29 <= 599928) && 1 == a3) && (((!(12 == a25) && a23 <= 312) && 138 < a23) || (a23 <= 312 && 312 <= a23))) && 15 == a8) && 1 == a4)) || (((a4 <= 0 && 10 == a25 && a29 <= 140) || (a23 <= 138 && 10 == a25 && a29 <= 140)) && (306 < a23 || a23 <= 138))) || (((!(12 == a25) && a29 <= 599928) && !(a25 == 13)) && a23 + 43 <= 0)) || ((((1 == a3 && 15 == a8) && a29 <= 277) && 1 == a4) && 306 < a23)) || ((((!(12 == a25) || 312 <= a23) && a29 + 92 <= 0) && (306 < a23 || a23 <= 138)) && 1 == a4)) || (a29 <= 220 && (a25 <= 9 && a29 <= 277) && 1 == a4)) || (((((306 < a23 && (\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500)) && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11)) || ((a29 <= 599928 && a23 <= 138) && a25 == 11)) || (((a29 <= 599998 && a23 <= 138) && 1 == a4) && a25 == 11)) || ((a23 <= 138 && 10 == a25) && 1 == a4)) || ((((1 == a3 && (\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 + 299881 <= v_~a29~0_500 % 299861) && 0 <= v_~a29~0_500)) && 15 == a8) && 1 == a4) && 138 < a23)) || ((((((\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500) && 1 == a3) && (306 < a23 || a23 <= 138)) && 10 == a25) && 15 == a8) && 1 == a4)) || (a29 + 92 <= 0 && ((a4 <= 0 && 10 == a25 && a29 <= 140) || (a23 <= 138 && 10 == a25 && a29 <= 140)))) || ((12 == a25 && a4 <= 0) && a29 <= 277)) || ((a25 <= 9 && a23 <= 138) && 1 == a4)) || ((!(12 == a25) && a29 + 22 <= 0) && a23 <= 138) || (((a29 <= 140 && !(a25 == 13)) && a23 <= 138) && !(a4 == 1))) || (((((\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500) && 1 == a3) && a25 <= 9) && 15 == a8) && 1 == a4)) || ((!(12 == a25) && a29 <= 277) && a23 + 43 <= 0)) || (((12 == a25 && a23 <= 138) && !(a4 == 1)) && a29 <= 277) - InvariantResult [Line: 22]: Loop Invariant [2019-11-20 03:30:07,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 03:30:07,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((1 == a3 && 15 == a8) && a29 <= 245) && !(12 == a25) && 1 == a4) || (a23 <= 138 && a29 + 92 <= 0)) || (((306 < a23 || a23 <= 138) && a29 <= 245) && (a25 <= 9 && a29 <= 277) && 1 == a4)) || ((10 == a25 && a29 <= 245) && 1 == a4)) || ((((a25 == 13 && a23 <= 306) && (((!(12 == a25) && a23 <= 312) && 138 < a23) || (a23 <= 312 && 312 <= a23))) && a29 <= 245) && 1 == a4)) || ((((a29 <= 599928 && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11)) || (((((a29 <= 599928 && 13 <= a25) && 1 == a3) && 306 < a23) && 15 == a8) && 1 == a4)) || (((((a25 == 13 && a29 <= 599928) && 1 == a3) && (((!(12 == a25) && a23 <= 312) && 138 < a23) || (a23 <= 312 && 312 <= a23))) && 15 == a8) && 1 == a4)) || (((a4 <= 0 && 10 == a25 && a29 <= 140) || (a23 <= 138 && 10 == a25 && a29 <= 140)) && (306 < a23 || a23 <= 138))) || (((!(12 == a25) && a29 <= 599928) && !(a25 == 13)) && a23 + 43 <= 0)) || ((((1 == a3 && 15 == a8) && a29 <= 277) && 1 == a4) && 306 < a23)) || ((((!(12 == a25) || 312 <= a23) && a29 + 92 <= 0) && (306 < a23 || a23 <= 138)) && 1 == a4)) || (a29 <= 220 && (a25 <= 9 && a29 <= 277) && 1 == a4)) || (((((306 < a23 && (\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500)) && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11)) || ((a29 <= 599928 && a23 <= 138) && a25 == 11)) || (((a29 <= 599998 && a23 <= 138) && 1 == a4) && a25 == 11)) || ((a23 <= 138 && 10 == a25) && 1 == a4)) || ((((1 == a3 && (\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 + 299881 <= v_~a29~0_500 % 299861) && 0 <= v_~a29~0_500)) && 15 == a8) && 1 == a4) && 138 < a23)) || ((((((\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500) && 1 == a3) && (306 < a23 || a23 <= 138)) && 10 == a25) && 15 == a8) && 1 == a4)) || (a29 + 92 <= 0 && ((a4 <= 0 && 10 == a25 && a29 <= 140) || (a23 <= 138 && 10 == a25 && a29 <= 140)))) || ((12 == a25 && a4 <= 0) && a29 <= 277)) || ((a25 <= 9 && a23 <= 138) && 1 == a4)) || ((!(12 == a25) && a29 + 22 <= 0) && a23 <= 138) || (((a29 <= 140 && !(a25 == 13)) && a23 <= 138) && !(a4 == 1))) || (((((\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500) && 1 == a3) && a25 <= 9) && 15 == a8) && 1 == a4)) || ((!(12 == a25) && a29 <= 277) && a23 + 43 <= 0)) || (((12 == a25 && a23 <= 138) && !(a4 == 1)) && a29 <= 277) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Result: SAFE, OverallTime: 45.4s, OverallIterations: 12, TraceHistogramMax: 6, AutomataDifference: 30.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.6s, HoareTripleCheckerStatistics: 1638 SDtfs, 9025 SDslu, 768 SDs, 0 SdLazy, 23381 SolverSat, 3942 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1093 GetRequests, 1021 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9998occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 22087 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 148 NumberOfFragments, 1049 HoareAnnotationTreeSize, 3 FomulaSimplifications, 11962 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 14418 FormulaSimplificationTreeSizeReductionInter, 4.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 4942 NumberOfCodeBlocks, 4942 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 4928 ConstructedInterpolants, 177 QuantifiedInterpolants, 8357007 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1253 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 5417/6038 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...